Nuprl - Proof: increasing lower bound 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: increasing lower bound 1

1. k :

2. f :

3. x :

k
4. increasing(f;k)

f(0)+x

f(x)

By:	Analyze -2 THEN IntInd -3

Generated subgoal:

1 3. increasing(f;k)
4. x :
5. 0<x
6. 0 x-1 < k f(0)+x-1f(x-1)
7. 0x
8. x<k
f(0)+xf(x)
2 steps

About:

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