PrintForm
Definitions
finite
sets
Sections
AutomataTheory
Doc
At:
phole
lemma
1
1
1.
n:
{1...}
2.
m:
{n+1...}
3.
f:
m
n
4.
i:
(n+1), j:
i. f(i) = f(j)
i,j:
m. i < j & f(i) = f(j)
By:
ExRepD
Generated subgoal:
1
4.
i:
(n+1)
5.
j:
i
6.
f(i) = f(j)
i,j:
m. i < j & f(i) = f(j)
About:
(n+1)i
i,j:m. i < j & f(i) = f(j)m
ni:(n+1), j:i. f(i) = f(j) i,j:m. i < j & f(i) = f(j)(n+1)i i,j:m. i < j & f(i) = f(j)
