PrintForm
Definitions
automata
4
Sections
AutomataTheory
Doc
At:
lang
auto
compute
1
1
2
1
2
2
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*
7.
u:
Alph
8.
v:
Alph*
9.
(Result(A(g))v) = v
x,y:Alph*//(x L-induced Equiv y)
10.
u.v = nil
11.
z1:
Alph*
12.
z2:
Alph*
13.
z1 L-induced Equiv z2
(u.z1) L-induced Equiv (u.z2)
By:
Unfold `lang_rel` 0
THEN
Reduce 0
Generated subgoal:
1
z:Alph*. L(z @ (u.z1))
L(z @ (u.z2))
About:
z:Alph*. L(z @ (u.z1)) 
L(z @ (u.z2))
Alph*
Prop
x,y:Alph*//(x L-induced Equiv y)
u.v = nil (u.z1) L-induced Equiv (u.z2) z:Alph*. L(z @ (u.z1)) L(z @ (u.z2))
