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

(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 1 1 2 1

1. k :

2. f :

k inj

k
3. f

k

k
4. Inj(

k;

k; f)
5. b :

k
6.

(

a:

k. f(a) = b)
7.

(

k inj

(k-1))

False

By:	FwdThru: Thm* ((m inj k)) mk on [ Hyp:-1 ]

Generated subgoals:

None

About:

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

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