DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Rank
Theorem
Name
4
Thm*
(
P
:Prop.
P
P
)
(
A
:Type.
Finite(
A
)
Unbounded(
A
))
[negnegelim_imp_notfin_imp_unb_inf]
cites the following:
3
Thm*
(
f
:(
A
B
). Bij(
A
;
B
;
f
))
(
B
~
A
)
[bij_iff_1_1_corr_version2a]
1
Thm*
(
x
:
T
.
Q
(
x
))
(
x
:
T
.
Q
(
x
))
[not_over_exists_imp]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
DiscreteMath
Sections
DiscrMathExt
Doc