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

A mapping from one finite collection into a smaller collection assigns a single output to two inputs.

At: pigeon hole


  m,k:f:(mk). k<m  (x,y:mx  y & f(x) = f(y))

By: Auto


Generated subgoal:

1 1. m : 
2. k : 
3. f : mk
4. k<m
  x,y:mx  y & f(x) = f(y)

7 steps

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

(8steps total) PfGloss PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc