exact .step (.charStep (Nat.le_trans (Nat.min_le_left _ _) h) assm step) (.base (Nat.min_le_right _ _))
case base
j k : ℕ
nfa : NFA
i : ℕ
cs : List Char
c : Char
start i✝ : ℕ
h : start ≤ i✝
assm : i✝ < nfa.nodes.size
step : k ∈ nfa[i✝].charStep c
⊢ nfa.pathIn (min start k) i✝ k [c]
no goals