(17steps total) PrintForm Definitions Lemmas mb nat Sections MarkB generic Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: increasing is id 1 3 1 1

1. k : 
2. 0<k
3. f:((k-1)(k-1)). increasing(f;k-1)  (i:(k-1). f(i) = i)
4. f : kk
5. increasing(f;k)
6. i : k
7. i:(k-1). (j.f(j))(i) = i
8. i = k-1
  f(k-1) = k-1


By: CaseNat 1 `k'


Generated subgoals:

1 9. k = 1
  f(1-1) = 1-1

Auto
2 9. k = 1
  f(k-1) = k-1

3 steps

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

(17steps total) PrintForm Definitions Lemmas mb nat Sections MarkB generic Doc