PrintForm Definitions myhill nerode Sections AutomataTheory Doc

At: mn 12 1 2 2 1 2 1 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)

Fin(x,y:Alph*//((Result(Auto)x) = (Result(Auto)y))) & (l:Alph*. L(l) (l.Auto(l))(l)) & (x,y,z:Alph*. (Result(Auto)x) = (Result(Auto)y) (Result(Auto)z @ x) = (Result(Auto)z @ y))
By: Analyze 0
Generated subgoals:

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

About:
andquotientlistequalall
applyassertlambdaimpliesuniverse