PrintForm Definitions automata 5 Sections AutomataTheory Doc

At: any iso min auto 1 1 2 1 1 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))

< (s,a. a.s),nil,(l.Auto(l)) > = < (s,a. a.s),nil,(l.A(l)) > Automata(Alph;x,y:Alph*//(x LangOf(Auto)-induced Equiv y))
By: Unfold `automata` 0 THEN Analyze THENL [Auto;Analyze] THENL [Auto;Auto;Analyze]
Generated subgoals:

114. s: x,y:Alph*//(x LangOf(Auto)-induced Equiv y)
15. a: Alph
a.s = a.s
2 nil = nil x,y:Alph*//(x LangOf(Auto)-induced Equiv y)
314. l: x,y:Alph*//(x LangOf(Auto)-induced Equiv y)
Auto(l) = A(l)
4 x,y:Alph*//(x LangOf(Auto)-induced Equiv y) = x,y:Alph*//(x LangOf(Auto)-induced Equiv y)

About:
equalquotientlistpairlambda
consniluniversebool