PrintForm
Definitions
finite
sets
Sections
AutomataTheory
Doc
At:
phole
aux
2
1
1
1
2
1.
n:
{2...}
2.
f:(
n
(-1+n)).
i:
n, j:
i. f(i) = f(j)
3.
f:
(1+n)
n
4.
ii:{1..(1+n)
}, jj:
ii.
f(ii) = f(jj)
5.
i:
n, j:
i. (
x.if f(x)=
n-1
f(n) else f(x) fi)(i) = (
x.if f(x)=
n-1
f(n) else f(x) fi)(j)
(-1+n)
i:
1, j:
i. f(i) = f(j)
By:
Analyze 5
THEN
Analyze 6
THEN
Reduce 7
Generated subgoal:
1
5.
i:
n
6.
j:
i
7.
if f(i)=
n-1
f(n) else f(i) fi = if f(j)=
n-1
f(n) else f(j) fi
(-1+n)
i:
1, j:
i. f(i) = f(j)
About: