Nuprl - Proof: increasing le 1

(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

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)

k

m

By:	AllHyps (InstHyp [m-1])

Generated subgoals:

1 m-1
3 steps

2 f:((k-1)(m-1)). increasing(f;k-1)
6 steps

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