PrintForm Definitions automata 5 Sections AutomataTheory Doc

At: min is unique 1 1 1 1 1 1 4
1. Alph: Type
2. St: Type
3. Auto: Automata(Alph;St)
4. EquivRel x,y:Alph*. x LangOf(Auto)-induced Equiv y
5. St ~ (x,y:Alph*//(x LangOf(Auto)-induced Equiv y))
6. Fin(Alph)
7. Fin(St)
8. f: StAlph*
9. s:St. (Result(Auto)f(s)) = s
10. s: St

FinalState(Auto)(s) = Auto(f(s))
By:
Unfold `accept_list` 0
THEN
Reduce 0
Generated subgoal:

1 FinalState(Auto)(s) = FinalState(Auto)(Result(Auto)f(s))

About:
equalboolapplyuniverselistquotientfunctionall