PrintForm
Definitions
finite
sets
Sections
AutomataTheory
Doc
At:
prod
fin
is
fin
1
2
6
1
1
7
1.
T:
Type
2.
t:
T
3.
n:
4.
f:
n
T
5.
a1,a2:
n. f(a1) = f(a2)
a1 = a2
6.
Surj(
n; T; f)
7.
n > 0
8.
a1:
(n
n)
9.
a2:
(n
n)
(a2
n) < n
By:
BackThru
Thm*
n:
, x:
(n
n). (x
n) < n
Generated subgoals:
None
About:
n
T
a1,a2:n. f(a1) = f(a2) 
a1 = a2n; T; f)(n
n)(nn)
(a2 
n) < nn:
, x:(nn). (x n) < n
