Nuprl - Proof: nsub inj exteq nsub surj 1 1 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 1 1 2

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

{y:

k|

y = b })

False

By:	Rewrite'-1 by Thm* k:, j:k. {i:k\| i = j } ~ (k-1)

Generated subgoal:

1 7. (k inj (k-1))
False
1 step

About:

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

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