PrintForm Definitions myhill nerode Sections AutomataTheory Doc

At: mn 12 1 2 2
1. Alph: Type
2. L: LangOver(Alph)
3. Fin(Alph)
4. St: Type
5. Auto: Automata(Alph;St)
6. Fin(St)
7. L = LangOf(Auto)
8. EquivRel x,y:Alph*. (Result(Auto)x) = (Result(Auto)y)

(EquivRel x,y:Alph*. x (x,y. (Result(Auto)x) = (Result(Auto)y)) y) c (g:((x,y:Alph*//(x,y. (Result(Auto)x) = (Result(Auto)y))(x,y))). Fin(x,y:Alph*//(x,y. (Result(Auto)x) = (Result(Auto)y))(x,y)) & (l:Alph*. L(l) g(l)) & (x,y,z:Alph*. (x,y. (Result(Auto)x) = (Result(Auto)y))(x,y) (x,y. (Result(Auto)x) = (Result(Auto)y))((z @ x),z @ y)))
By: Reduce 0
Generated subgoal:

1 (EquivRel x,y:Alph*. (Result(Auto)x) = (Result(Auto)y)) c (g:((x,y:Alph*//((Result(Auto)x) = (Result(Auto)y))) ). Fin(x,y:Alph*//((Result(Auto)x) = (Result(Auto)y))) & (l:Alph*. L(l) g(l)) & (x,y,z:Alph*. (Result(Auto)x) = (Result(Auto)y) (Result(Auto)z @ x) = (Result(Auto)z @ y)))

About:
listlambdaequalexistsfunctionquotientapply
boolandallassertimpliesuniverse