Nuprl - Proof: disjoint increasing onto 1 1 1 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 1 1 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)

f:(

m

(n+k)). Inj(

m;

(n+k); f)

By:	InstConcl [i.InjCase(h(i); p. 1of(p), n+1of(p))]

Generated subgoals:

1   (i.InjCase(h(i); p. 1of(p), n+1of(p)))  m(n+k)
2 steps

2   Inj(m; (n+k); i.InjCase(h(i); p. 1of(p), n+1of(p)))
5 steps

3 10. f1 : m(n+k)
  Inj(m; (n+k); f1)  Prop
Auto

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