Theorem: NA.memAccepts (FOL/Parsing/Compute.lean)

State before:
α σ : Type
N : NA α σ
input : List α
⊢ N.accepts input ↔ ∃ s ∈ N.evalFrom N.startingStates input, s ∈ N.acceptingStates
Tactic:
rfl
State after:
no goals