Nuprl - Proof: nsub inj exteq nsub surj 1 1 1 1 1 2

(35steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: nsub inj exteq nsub surj 1 1 1 1 1 2

1. k :

2. f :

k inj

k
3. f

k

k
4. Inj(

k;

k; f)
5.

(

b:

k.

(

a:

k. f(a) = b))

b:

k.

a:

k. f(a) = b

By:	FwdThru: Thm* (x:T. Q(x)) (x:T. Q(x)) on [ Hyp:-1 ]

Generated subgoal:

1 6. b:k. (a:k. f(a) = b)
7. b : k
a:k. f(a) = b
2 steps

About:

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

(35steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc