PrintForm
Definitions
finite
sets
Sections
AutomataTheory
Doc
At:
phole
aux
2
1
2
1
1
1.
n:
{2...}
2.
f:(
n
(-1+n)).
i:
n, j:
i. f(i) = f(j)
3.
f:
(1+n)
n
4.
iii:
{1..(1+n)
}
5.
(
ii:{iii..(1+n)
}, jj:
ii.
f(ii) = f(jj))
(
i:
iii, j:
i. f(i) = f(j))
6.
ii:{(1+iii)..(1+n)
}, jj:
ii.
f(ii) = f(jj)
7.
fi:
n
8.
fi = f(iii)
9.
x:
iii. fi = f(x)
i:
(1+iii), j:
i. f(i) = f(j)
By:
Analyze -1
THEN
Inst [iii;x] 0
Generated subgoals:
None
About:
f:(
n
(-1+n)). 
i:n, j:i. f(i) = f(j)(1+n)n
}ii:{iii..(1+n)}, jj:ii. 
f(ii) = f(jj)) 
(i:iii, j:i. f(i) = f(j))ii:{(1+iii)..(1+n)}, jj:ii. f(ii) = f(jj)nx:iii. fi = f(x)
i:(1+iii), j:i. f(i) = f(j)
