Nuprl - Proof: disjoint increasing onto 1 1 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: disjoint increasing onto 1 1 1

1. m :

2. n :

3. k :

4. f :

m
5. g :

m
6. increasing(f;n)
7. increasing(g;k)
8.

m. (

n. i = f(j))

(

k. i = g(j))
9.

j1:

n, j2:

f(j1) = g(j2)

f:(

(n+k)). Inj(

(n+k); f)

By:	RenameVar `h' 8 THEN Unfolds [`all`;`exists`;`or`] 8

Generated subgoal:

1 8. i:m(j:ni = f(j))+(j:ki = g(j))
9. j1:n, j2:k. f(j1) = g(j2)
f:(m(n+k)). Inj(m; (n+k); f)
9 steps

About:

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