Nuprl - Proof: before-upto 2 1

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

1. n :

2. x :

n
3. y :

n
4. x<y

increasing(

i.if i=

x else y fi;2)

& (

2. [x; y][j] = upto(n)[((

i.if i=

x else y fi)(j))])

By:

Analyze 0

Generated subgoals:

1 increasing(i.if i=0 x else y fi;2)
1 step

2 j:2. [x; y][j] = upto(n)[((i.if i=0 x else y fi)(j))]
4 steps

About:

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

1	increasing(i.if i=0 x else y fi;2)	1 step
2	j:2. [x; y][j] = upto(n)[((i.if i=0 x else y fi)(j))]	4 steps