intro assm i mem _ j step
case mpr
nfa : NFA
S : Set ℕ
⊢ (∀ i ∈ S, nfa.εClosure i ⊆ S) → ∀ i ∈ S, ∀ (x : i < nfa.nodes.size), ∀ j ∈ nfa[i].εStep, j ∈ S
case mpr
nfa : NFA
S : Set ℕ
assm : ∀ i ∈ S, nfa.εClosure i ⊆ S
i : ℕ
mem : i ∈ S
x✝ : i < nfa.nodes.size
j : ℕ
step : j ∈ nfa[i].εStep
⊢ j ∈ S