Nuprl - Proof: nsub surj imp a rev inj gen 1 1 2

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

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

1. B : Type
2. e : B

B

3. IsEqFun(B;e)
4. a :

5. f :

a

B
6. Surj(

a; B; f)
7. f

a onto

B
8. (

y,x. (f(x)) e y)

B

{p:(

a

)|

i:

a. p(i) }

(

y.least x:

. (f(x)) e y)

B

a

By:	Analyze THEN BackThru: Thm* e:(BB). Thm* IsEqFun(B;e) (a:, f:(a onto B), y:B. (least x:. (f(x)) e y) a)

Generated subgoals:

None

About:

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

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