PrintForm
Definitions
action
sets
Sections
AutomataTheory
Doc
At:
n0n1
irregular
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1.
S:
ActionSet(
)
2.
s:
S.car
3.
q:
S.car
4.
n:
5.
f:
S.car
n
6.
g:
n
S.car
7.
g o f = Id
8.
f o g = Id
9.
k:
. (S:n0n1(k)
s) = q
10.
i:
(n+1)
11.
j:
(n+1)
12.
i < j
13.
f((S:([1]
i)
s)) = f((S:([1]
j)
s))
14.
(S:([1]
i)
s) = (S:([1]
j)
s)
(S:([0]
j) @ ([1]
i)
s) = q
By:
Inst
Thm*
S:ActionSet(Alph), s:S.car, L1,L2,L:Alph*. (S:L1
s) = (S:L2
s)
(S:L @ L1
s) = (S:L @ L2
s) [
;S;s;([1]
i);([1]
j);([0]
j)]
Generated subgoals:
1
(S:([1]
i)
s) = (S:([1]
j)
s)
2
15.
(S:([0]
j) @ ([1]
i)
s) = (S:([0]
j) @ ([1]
j)
s)
(S:([0]
j) @ ([1]
i)
s) = q
About: