PrintForm
Definitions
automata
4
Sections
AutomataTheory
Doc
At:
lang
auto
compute
1
1
1.
Alph:
Type
2.
L:
LangOver(Alph)
3.
EquivRel x,y:Alph*. x L-induced Equiv y
g:((x,y:Alph*//(x L-induced Equiv y))
), l:Alph*. (Result(A(g))l) = l
x,y:Alph*//(x L-induced Equiv y)
By:
Assert (L
Alph*
Prop)
Generated subgoals:
1
L
Alph*
Prop
2
4.
L
Alph*
Prop
g:((x,y:Alph*//(x L-induced Equiv y))
), l:Alph*. (Result(A(g))l) = l
x,y:Alph*//(x L-induced Equiv y)
About: