(9steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Existence of a least number having a given property.

At: least exists2


  P:{P:(Prop)| i:P(i) }. 
  (i:. Dec(P(i)))  ({i:P(i) & (j:j<i  P(j)) })


By: UnivCD THEN Analyze1


Generated subgoal:

1 1. P : Prop
2. i:P(i)  [not for witness]
3. i:. Dec(P(i))
  {i:P(i) & (j:j<i  P(j)) }

8 steps

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

(9steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc