PrintForm Definitions automata 4 Sections AutomataTheory Doc

At: lang auto compute 1 1 2 1 1
1. Alph: Type
2. L: LangOver(Alph)
3. EquivRel x,y:Alph*. x L-induced Equiv y
4. L Alph*Prop
5. g: (x,y:Alph*//(x L-induced Equiv y))
6. l: Alph*

(Result(A(g))nil) = nil
By:
RecUnfold `compute_list` 0
THEN
Reduce 0
Generated subgoal:

1 nil = nil x,y:Alph*//(x L-induced Equiv y)

About:
equalquotientlistniluniverse
memberfunctionpropbool