PrintForm Definitions automata 5 Sections AutomataTheory Doc

At: min is unique 1 1 1 1 1 1 1 1
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

Inj(St; x,y:Alph*//(x LangOf(Auto)-induced Equiv y); f)
By: BackThru Thm* Auto:Automata(Alph;St), c:(StAlph*). (q:St. (Result(Auto)c(q)) = q) & Fin(Alph) & Fin(St) & (St ~ (x,y:Alph*//(x LangOf(Auto)-induced Equiv y))) Inj(St; x,y:Alph*//(x LangOf(Auto)-induced Equiv y); c)
Generated subgoal:

110. q: St
(Result(Auto)f(q)) = q

About:
quotientlistuniversefunctionallequalapply