DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Rank
Theorem
Name
3
Thm*
m
,
k
:
,
f
:(
m
k
).
k
<
m
(
x
,
y
:
m
.
x
y
&
f
(
x
) =
f
(
y
))
[pigeon_hole]
cites the following:
0
Thm*
m
:
,
f
:(
m
).
Inj(
m
;
;
f
)
(
x
:
m
,
y
:
x
.
f
(
x
) =
f
(
y
))
[finite_inj_counter_example]
2
Thm*
(
f
:(
m
k
). Inj(
m
;
k
;
f
))
m
k
[inj_imp_le]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
DiscreteMath
Sections
DiscrMathExt
Doc