PrintForm Definitions automata 5 Sections AutomataTheory Doc

At: min is unique 1 1 1 1 1 2 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
10. f1: St(x,y:Alph*//(x LangOf(Auto)-induced Equiv y))
11. s: St
12. a: Alph
13. b: Alph
14. q1: Alph*
15. q2: Alph*
16. z:Alph*. LangOf(Auto)(z @ q1) LangOf(Auto)(z @ q2)

(b.q1) LangOf(Auto)-induced Equiv (b.q2)
By:
Unfold `lang_rel` 0
THEN
Reduce 0
Generated subgoal:

1 z:Alph*. LangOf(Auto)(z @ (b.q1)) LangOf(Auto)(z @ (b.q2))

About:
consuniverselistquotientfunctionallequalapply