have ih := ih assm step
case step
j k : ℕ
nfa : NFA
i : ℕ
cs : List Char
start i✝ j✝ k✝ : ℕ
cs₁✝ cs₂✝ : List Char
step' : nfa.stepIn start i✝ j✝ cs₁✝
rest : nfa.pathIn start j✝ k✝ cs₂✝
ih : ∀ (assm : k✝ < nfa.nodes.size), k ∈ nfa[k✝].εStep → nfa.pathIn (min start k) j✝ k cs₂✝
assm : k✝ < nfa.nodes.size
step : k ∈ nfa[k✝].εStep
⊢ nfa.pathIn (min start k) i✝ k (cs₁✝ ++ cs₂✝)
case step
j k : ℕ
nfa : NFA
i : ℕ
cs : List Char
start i✝ j✝ k✝ : ℕ
cs₁✝ cs₂✝ : List Char
step' : nfa.stepIn start i✝ j✝ cs₁✝
rest : nfa.pathIn start j✝ k✝ cs₂✝
ih✝ : ∀ (assm : k✝ < nfa.nodes.size), k ∈ nfa[k✝].εStep → nfa.pathIn (min start k) j✝ k cs₂✝
assm : k✝ < nfa.nodes.size
step : k ∈ nfa[k✝].εStep
ih : nfa.pathIn (min start k) j✝ k cs₂✝
⊢ nfa.pathIn (min start k) i✝ k (cs₁✝ ++ cs₂✝)