(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 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. f : ab
6. Inj(abf)
  (x.if x=a-1 f(a-1) else f(x) fi) = f  a inj b


By: Analyze THEN (FunExtensionality THEN Reduce Concl)


Generated subgoals:

1 7. x : a
  if x=a-1 f(a-1) else f(x) fi = f(x)

2 steps
2   Inj(abx.if x=a-1 f(a-1) else f(x) fi)
5 steps

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