DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Rank
Theorem
Name
3
Thm*
(
A
~
m
)
(
A
~
k
)
m
=
k
[counting_is_unique]
cites the following:
2
Thm*
(
f
:(
m
k
). Inj(
m
;
k
;
f
))
m
k
[inj_imp_le]
2
Thm*
(
f
:(
A
B
). Bij(
A
;
B
;
f
))
(
A
~
B
)
[bij_iff_1_1_corr_version2]
1
Thm*
EquivRel
X
,
Y
:Type.
X
~
Y
[one_one_corr_is_equiv_rel]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
DiscreteMath
Sections
DiscrMathExt
Doc