(31steps total) Remark PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: card nsub inj vs lopped 1 1 3 2 1

1. a : 
2. b : 
3. (f.<f(a-1),f>)  (a inj b)(i:b(a-1) inj {x:bx = i })
4. (ie.ie/i,ex.if x=a-1 i else e(x) fi)
4.  (i:b(a-1) inj {x:bx = i })a inj b
5. i : b
6. e : (a-1){x:bx = i }
7. Inj((a-1); {x:bx = i }; e)
  if a-1=a-1 i else e(a-1) fi = i


By: SplitITE Concl


Generated subgoals:

None

About:
pairspreadproductifthenelseint
natural_numbersubtractsetlambdaapplyfunctionequal
member
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

(31steps total) Remark PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc