Nuprl - Proof: cons sublist cons 2 2 2 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: cons sublist cons 2 2 2 1

1. T : Type
2. x1 : T
3. x2 : T
4. L1 : T List
5. L2 : T List
6. f :

(||L1||+1)

||L2||
7. increasing(f;||L1||+1)
8.

(||L1||+1). [x1 / L1][j] = L2[(f(j))]
9. j :

(||L1||+1)

[x1 / L1][j] = [x2 / L2][(f(j)+1)]

By:	Subst ([x2 / L2][(f(j)+1)] = L2[(f(j))]) 0

Generated subgoals:

1   [x2 / L2][(f(j)+1)] = L2[(f(j))]
1 step

2   [x1 / L1][j] = L2[(f(j))]
1 step

3 10. z : T
  ([x1 / L1][j] = z)  Prop
2 steps

About:

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