(23steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: card split prod intseg family decbl 1 1
1. A : Type
2. B : AType
3. P : AProp
4. x:A. Dec(P(x))
  g:((x:A st P(x)B(x))(x:A st P(x)B(x))(x:AB(x))). 
  InvFuns(x:AB(x);(x:A st P(x)B(x))(x:A st P(x)B(x));h.<h,h>;g)
By: get choice decision function from x:A. Dec(P(x))

Generated subgoal:

1 4. d : A2
5. x:A. if d(x)=0 P(x) else P(x) fi
  g:((x:A st P(x)B(x))(x:A st P(x)B(x))(x:AB(x))). 
  InvFuns(x:AB(x);(x:A st P(x)B(x))(x:A st P(x)B(x));h.<h,h>;g)
20 steps

About:
pairproductifthenelsenatural_numberlambda
applyfunctionuniversepropimpliesallexists
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

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