(5steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: card st vs boolsize 1

1. a : 
2. p : a
  {x:ap(x) } ~ (Msize(x.if p(x) 1 else 0 fi))


By: BackThru: 
Thm*  f:(a2). 
Thm*  (i:aP(i f(i) = 1  2)  ({x:aP(x) } ~ (Msize(f)))
THEN
Reduce Concl


Generated subgoal:

1   i:ap(i if p(i) 1 else 0 fi = 1  2
3 steps

About:
boolifthenelseassertnatural_numberset
lambdaapplyfunctionequalpropimplies
all
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

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