(27steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Search
Doc
IF YOU CAN SEE THIS go to http://www.cs.cornell.edu/Info/People/sfa/Nuprl/Shared/Xindentation_hack_doc.html
There are as many non-negative integers as integers.
At:
int
ooc
nat
~
By:
BackThru:
Thm*
(
f
:(
A
B
). Bij(
A
;
B
;
f
))
(
A
~
B
)
Generated subgoal:
1
f
:(
). Bij(
;
;
f
)
26
steps
About:
IF YOU CAN SEE THIS go to http://www.cs.cornell.edu/Info/People/sfa/Nuprl/Shared/Xindentation_hack_doc.html
(27steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Search
Doc
~ 
f:(A
B). Bij(A; B; f)) 
(A ~ B)
