dsimp [NFA.Run.last] at h
case step.h
α qs : Type
inst✝³ : DecidableEq α
inst✝² : DecidableEq qs
inst✝¹ : DecidableEq α
inst✝ : DecidableEq qs
M : NFA α qs
a✝² : { x // x ∈ (toNFA (fromNFA M)).Q }
a✝¹ : Word { x // x ∈ (toNFA (fromNFA M)).Z }
self✝ : { x // x ∈ (toNFA (fromNFA M)).Q }
h' : ↑a✝² ⊆ ↑self✝
q₂✝ : { x // x ∈ (toNFA (fromNFA M)).Q }
a✝ : { x // x ∈ (toNFA (fromNFA M)).Z }
w✝ : Word { x // x ∈ (toNFA (fromNFA M)).Z }
r✝ : NFA.Run (toNFA (fromNFA M)) q₂✝ w✝
x✝ : q₂✝ ∈ (toNFA (fromNFA M)).δ (a✝², a✝)
h✝ : a✝¹ = a✝ :: w✝
h : NFA.Run.last (NFA.Run.step a✝² x✝ r✝ h✝) ∈ (fromNFA M).F
⊢ NFA.Run.last r✝ ∈ (fromNFA M).F
case step.h
α qs : Type
inst✝³ : DecidableEq α
inst✝² : DecidableEq qs
inst✝¹ : DecidableEq α
inst✝ : DecidableEq qs
M : NFA α qs
a✝² : { x // x ∈ (toNFA (fromNFA M)).Q }
a✝¹ : Word { x // x ∈ (toNFA (fromNFA M)).Z }
self✝ : { x // x ∈ (toNFA (fromNFA M)).Q }
h' : ↑a✝² ⊆ ↑self✝
q₂✝ : { x // x ∈ (toNFA (fromNFA M)).Q }
a✝ : { x // x ∈ (toNFA (fromNFA M)).Z }
w✝ : Word { x // x ∈ (toNFA (fromNFA M)).Z }
r✝ : NFA.Run (toNFA (fromNFA M)) q₂✝ w✝
x✝ : q₂✝ ∈ (toNFA (fromNFA M)).δ (a✝², a✝)
h✝ : a✝¹ = a✝ :: w✝
h : NFA.Run.last r✝ ∈ (fromNFA M).F
⊢ NFA.Run.last r✝ ∈ (fromNFA M).F