Nuprl - Proof: nsub inj discr range bij 1 2

(6steps 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 discr range bij 1 2

1. A : Type
2. A Discrete
3. k :

4. f :

k inj

A
5. {a:A|

k. a = f(i) }

Type
6. f

{a:A|

k. a = f(i) } & Surj(

k; {a:A|

k. a = f(i) }; f)
7. {a:A|

k. a = f(i) }

Type

{a:A|

k. a = f(i) } & Bij(

k; {a:A|

k. a = f(i) }; f)

By:	Analyze4 THEN UnhideSqStableHyp Hyp:5

Generated subgoal:

1 4. f : kA
5. Inj(k; A; f)
6. {a:A| i:k. a = f(i) }  Type
7. f  k{a:A| i:k. a = f(i) } & Surj(k; {a:A| i:k. a = f(i) }; f)
8. {a:A| i:k. a = f(i) }  Type
  f  k{a:A| i:k. a = f(i) } & Bij(k; {a:A| i:k. a = f(i) }; f)
2 steps

About:

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

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