Nuprl - Proof: disjoint increasing onto 1 2 1 1 2 1

(22steps 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: disjoint increasing onto 1 2 1 1 2 1

1. m :

2. n :

3. k :

4. f :

n

m
5. g :

k

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

i:

m. (

j:

n. i = f(j))

(

j:

k. i = g(j))
9.

j1:

n, j2:

k.

f(j1) = g(j2)
10. m

n+k
11.

a1,a2:

k. g(a1) = g(a2)

a1 = a2
12.

a1,a2:

n. f(a1) = f(a2)

a1 = a2
13. a1 :

(n+k)
14. a2 :

(n+k)
15. a1<n
16. n

a2
17. f(a1) = g(a2-n)

a1 = a2

By:	InstHyp [a1;a2-n] 9

Generated subgoals:

None

About:

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

(22steps total) PrintForm Definitions Lemmas mb nat Sections MarkB generic Doc