(5steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: least is least2 1

1. p : {p:()| i:p(i) }
  j:(least i:p(i)). p(j)


By: Use:[p]
Inst: 
Thm*  p:{p:()| i:p(i) }. 
Thm*  (least i:p(i))  {i:p(i) & (j:j<i  p(j)) }


Generated subgoal:

1 2. (least i:p(i))  {i:p(i) & (j:j<i  p(j)) }
  j:(least i:p(i)). p(j)

3 steps

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

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