PrintForm Definitions automata 4 Sections AutomataTheory Doc

At: homo step 1 1 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. g: (x,y:Alph*//(x LangOf(Auto)-induced Equiv y))
6. c: StAlph*
7. q:St. (Result(Auto)c(q)) = q
8. q: St
9. a: Alph
10. (Result(Auto)c(Result(Auto)a.c(q))) = (Result(Auto)a.c(q))
11. x,y:Alph*. (Result(Auto)x) = (Result(Auto)y) (Result(A(g))x) = (Result(A(g))y)
12. c(Result(Auto)a.c(q)) = a.c(q) x,y:Alph*//(x LangOf(Auto)-induced Equiv y)

c(Auto(q,a)) = A(g)(c(q),a) x,y:Alph*//(x LangOf(Auto)-induced Equiv y)
By:
RecUnfold `compute_list` 12
THEN
Reduce 12
Generated subgoal:

112. c(Auto((Result(Auto)c(q)),a)) = a.c(q) x,y:Alph*//(x LangOf(Auto)-induced Equiv y)
c(Auto(q,a)) = A(g)(c(q),a) x,y:Alph*//(x LangOf(Auto)-induced Equiv y)

About:
equalquotientlistapplyuniverse
functionboolallconsimplies