Theorem: Regex.NFA.Node.lt_of_inBounds.epsilon (Regex/NFA/Basic.lean)

State before:
size next : Nat
h : (Node.epsilon next).inBounds size
⊢ next < size
Tactic:
simp [inBounds] at h
State after:
size next : Nat
h : next < size
⊢ next < size

State before:
size next : Nat
h : next < size
⊢ next < size
Tactic:
exact h
State after:
no goals