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

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

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