Nuprl - Proof: upto decomp 2 2

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: upto decomp 2 2

1. m :

2. 0<m
3.

(m-1+1). upto(m-1) ~ (upto(n) @ map(

x.x+n;upto(m-1-n)))
4. n :

(m+1)
5.

n = m

upto(m) ~ (upto(n) @ map(

x.x+n;upto(m-n)))

By:	RW (AddrC [1] (RecUnfoldC `upto`)) 0 THEN SplitOnConclITE

Generated subgoals:

1 6. m = 0
nil ~ (upto(n) @ map(x.x+n;upto(m-n)))
1 step

2 6. m = 0
(upto(m-1) @ [(m-1)]) ~ (upto(n) @ map(x.x+n;upto(m-n)))
7 steps

About:

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

1	6. m = 0 nil ~ (upto(n) @ map(x.x+n;upto(m-n)))	1 step
2	6. m = 0 (upto(m-1) @ [(m-1)]) ~ (upto(n) @ map(x.x+n;upto(m-n)))	7 steps