(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 2

1. p : 
2. i : 
3. p(i)
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)) }


By: BackThru: 
{i:(i+1)| p(i) & (j:ip(j)) }  {i:p(i) & (j:j<i  p(j)) }


Generated subgoal:

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

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

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