(9steps total) Remark PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: least exists2 1

1. P : Prop
2. i:. P(i)  [not for witness]
3. i:. Dec(P(i))
  {i:| P(i) & (j:. j<i  P(j)) }


By: Rewrite'-1 by Thm*  (x:T. Dec(E(x)))  (f:(T). x:T. f(x)  E(x))
THEN
New:p Analyze-1


Generated subgoal:

1 3. p : 
4. i:. p(i)  P(i)
  {i:| P(i) & (j:. j<i  P(j)) }

7 steps

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

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