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

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


By: Inst: 
Thm*  k:p:{p:(k)| i:kp(i) }.
Thm*  (least i:p(i))  {i:kp(i) & (j:ip(j)) }
on
[i+1 | p]


Generated subgoals:

1   p  {p:((i+1))| i:(i+1). p(i) }
2 steps
2 4. (least i:p(i))  {i:(i+1)| p(i) & (j:ip(j)) }
  (least i:p(i))  {i:p(i) & (j:j<i  p(j)) }

5 steps

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

(10steps total) Remark PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc