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

1. k : 
2. 0<k
3. p:{p:((k-1))| i:(k-1). p(i) }. 
3. (least i:p(i))  {i:(k-1)| p(i) & (j:ip(j)) }
4. p : k
5. i : k
6. p(i)
7. p(0)
  (least i:p(i+1))+1  {i:kp(i) & (j:ip(j)) }


By: Use:[p(i):= p(i+1)] Inst: Hyp:3


Generated subgoals:

1   (i.p(i+1))  {p:((k-1))| i:(k-1). p(i) }
6 steps
2 8. (least i:p(i+1))  {i:(k-1)| p(i+1) & (j:ip(j+1)) }
  (least i:p(i+1))+1  {i:kp(i) & (j:ip(j)) }

5 steps

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

(17steps total) Remark PrintForm Definitions DiscreteMath Sections DiscrMathExt Doc