(6steps total) PfGloss PrintForm Definitions DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Lemma for the pigeon-hole principle.

A finite non-injection into integers maps some two distinct arguments to the same value.

At: finite inj counter example


  m:, f:(m). Inj(m; ; f)  (x:m, y:x. f(x) = f(y))

By: Auto


Generated subgoal:

1 1. m : 
2. f : m
3. Inj(m; ; f)
  x:m, y:x. f(x) = f(y)

5 steps

About:
intnatural_numberapplyfunctionequalimpliesallexists
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

(6steps total) PfGloss PrintForm Definitions DiscreteMath Sections DiscrMathExt Doc