PrintForm Definitions automata 5 Sections AutomataTheory Doc

At: Rl quo is decidable 1 1 1
1. Alph: Type
2. St: Type
3. Auto: Automata(Alph;St)
4. Fin(Alph) & Fin(St)
5. x: Alph*
6. y: Alph*
7. n:
8. f:(n(x,y:Alph*//(x LangOf(Auto)-induced Equiv y))). Bij(n; x,y:Alph*//(x LangOf(Auto)-induced Equiv y); f)

Dec(x = y x,y:Alph*//(x LangOf(Auto)-induced Equiv y))
By:
Inst Thm* L:LangOver(A). EquivRel x,y:A*. x L-induced Equiv y [Alph;LangOf(Auto)]
THEN
RWH (LemmaC Thm* (f:(AB). Bij(A; B; f)) (A ~ B)) 8
Generated subgoal:

18. n ~ (x,y:Alph*//(x LangOf(Auto)-induced Equiv y))
9. EquivRel x,y:Alph*. x LangOf(Auto)-induced Equiv y
Dec(x = y x,y:Alph*//(x LangOf(Auto)-induced Equiv y))

About:
equalquotientlistuniverseandexistsfunctionnatural_number