Nuprl - Proof: increasing le 1 2

(11steps 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 le 1 2

1. k :

2. 0<k
3.

m:

. (

f:(

(k-1)

m). increasing(f;k-1))

k-1

m
4. m :

5. f :

k

m
6. increasing(f;k)

f:(

(k-1)

(m-1)). increasing(f;k-1)

By:	InstConcl [i.f(i+1)-f(1)]

Generated subgoals:

1 7. i : (k-1)
f(i+1)-f(1) (m-1)
4 steps

2 increasing(i.f(i+1)-f(1);k-1)
1 step

About:

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

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