Nuprl - Proof: nsub discr range surj 1

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

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: nsub discr range surj 1

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

4. f :

{a:A|

k. a = f(i) }

Type

& f

{a:A|

k. a = f(i) }

& Surj(

k; {a:A|

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

By:	2 Times Analyze

Generated subgoals:

1 5. {a:A| i:k. a = f(i) }  Type
  f  k{a:A| i:k. a = f(i) }
2 steps

2 5. {a:A| i:k. a = f(i) }  Type
6. f  k{a:A| i:k. a = f(i) }
  Surj(k; {a:A| i:k. a = f(i) }; f)
12 steps

About:

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

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

1	5. {a:A\| i:k. a = f(i) } Type f k{a:A\| i:k. a = f(i) }	2 steps
2	5. {a:A\| i:k. a = f(i) } Type 6. f k{a:A\| i:k. a = f(i) } Surj(k; {a:A\| i:k. a = f(i) }; f)	12 steps