(6steps total) PrintForm Definitions Lemmas LogicSupplement Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: dec pred imp bool decider exists

  A:Type, P:(AType).
  (x:A. Dec(P(x)))  (!{p:(A)| x:Ap(x P(x) })


By: Guarding (<type>) UnivCD
THEN
FwdThru: 
Thm*  (x:T. Dec(E(x)))  (f:(T). x:Tf(x E(x))
on [ x:A. Dec(P(x)) ]


Generated subgoal:

1 1. A : Type
2. P : AType
3. x:A. Dec(P(x))
4. f:(A). x:Af(x P(x)
  !{p:(A)| x:Ap(x P(x) }

5 steps

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

(6steps total) PrintForm Definitions Lemmas LogicSupplement Sections DiscrMathExt Doc