PrintForm Definitions automata 5 Sections AutomataTheory Doc

At: any iso min auto 1 1 2 1 2 1 1
1. Alph: Type
2. St: Type
3. Auto: Automata(Alph;St)
4. S: Type
5. A: Automata(Alph;S)
6. Fin(Alph)
7. Fin(S)
8. Con(A)
9. S ~ (x,y:Alph*//(x LangOf(Auto)-induced Equiv y))
10. LangOf(Auto) = LangOf(A)
11. EquivRel x,y:Alph*. x LangOf(Auto)-induced Equiv y
12. EquivRel x,y:Alph*. x LangOf(A)-induced Equiv y
13. A A(l.A(l))
14. A(l.Auto(l)) = A(l.A(l)) Automata(Alph;x,y:Alph*//(x LangOf(Auto)-induced Equiv y))

A A(l.A(l))
By: Assert (x,y:Alph*//(x LangOf(Auto)-induced Equiv y) = x,y:Alph*//(x LangOf(A)-induced Equiv y))
Generated subgoals:

1 x,y:Alph*//(x LangOf(Auto)-induced Equiv y) = x,y:Alph*//(x LangOf(A)-induced Equiv y)
215. x,y:Alph*//(x LangOf(Auto)-induced Equiv y) = x,y:Alph*//(x LangOf(A)-induced Equiv y)
A A(l.A(l))

About:
quotientlistlambdaequaluniverse