exact .inr (.inl (Fin.eq_of_val_eq hj))
case inl.inl
nfa : NFA
pos : String.Pos
next : SparseSet nfa.nodes.size
currentSave : Array (Option String.Pos)
matched : Option (Array (Option String.Pos))
saveSlots : Data.Vec (Array (Option String.Pos)) nfa.nodes.size
stack : Array (StackEntry nfa.nodes.size)
matched' : Option (Array (Option String.Pos))
next' : SparseSet nfa.nodes.size
saveSlots' : Data.Vec (Array (Option String.Pos)) nfa.nodes.size
target₁ target₂ : ℕ
isLt : (Node.split target₁ target₂).inBounds nfa.nodes.size
i j : Fin nfa.nodes.size
inv : LowerInvExploreεClosure nfa next i stack
h✝ : i ∉ next
hn : nfa[↑i] = Node.split target₁ target₂
h :
  exploreεClosure nfa pos (next.insert i) currentSave matched saveSlots ⟨target₁, ⋯⟩
      (stack.push (StackEntry.explore ⟨target₂, ⋯⟩)) =
    (matched', next', saveSlots')
hi : i ∈ next.insert i
hj : ↑j = target₁
⊢ j ∈ next.insert i ∨ j = ⟨target₁, ⋯⟩ ∨ StackEntry.explore j ∈ stack.push (StackEntry.explore ⟨target₂, ⋯⟩)
no goals