PrintForm Definitions automata 5 Sections AutomataTheory Doc

At: homo is surj 1 1 3 1
1. Alph: Type
2. St: Type
3. Auto: Automata(Alph;St)
4. c: StAlph*
5. (q:St. (Result(Auto)c(q)) = q) & Fin(Alph) & Fin(St)
6. EquivRel x,y:Alph*. x LangOf(Auto)-induced Equiv y
7. h: Alph*Alph*
8. (x,y:Alph*. (x (x,y. x = y x,y:Alph*//(x LangOf(Auto)-induced Equiv y)) y) h(x) = h(y)) & (x:Alph*. x (x,y. x = y x,y:Alph*//(x LangOf(Auto)-induced Equiv y)) (h(x)))

Surj(St; x,y:Alph*//(x LangOf(Auto)-induced Equiv y); c)
By: Unfold `surject` 0
Generated subgoal:

1 b:x,y:Alph*//(x LangOf(Auto)-induced Equiv y). a:St. c(a) = b x,y:Alph*//(x LangOf(Auto)-induced Equiv y)

About:
quotientlistuniversefunctionand
allequalapplylambdaexists