PrintForm
Definitions
finite
sets
Sections
AutomataTheory
Doc
At:
phole
aux
n:{1...}, f:(
(n+1)
n).
i:
(n+1), j:
i. f(i) = f(j)
By:
BackThru
Thm*
i:
, E:({i...}
Prop). E(i)
(
k:{i+1...}. E(k-1)
E(k))
(
k:{i...}. E(k))
THEN
RepD
Generated subgoals:
1
1.
f:
(1+1)
1
i:
(1+1), j:
i. f(i) = f(j)
2
1.
n:
{1+1...}
2.
f:(
(n-1+1)
(n-1)).
i:
(n-1+1), j:
i. f(i) = f(j)
3.
f:
(n+1)
n
i:
(n+1), j:
i. f(i) = f(j)
About: