(20steps total) PrintForm Definitions Lemmas FTA Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: nat prime div each factorLEMMA 1 1

1. X : 
2. prime(X)
3. X1:X1<X  prime(X1 (a,b:X1 | ab  X1 | a  X1 | b)
4. W : 
5. W1:W1<W  0<W1  W1<X  (t:X | tW1  X | t)
6. 0<W
7. W<X
8. t : 
9. X | tW
  X | t


By: Rewrite'-1 by Thm*  a,b:a | b  (c:b = ac) ... THEN New:u Analyze-1


Generated subgoal:

1 9. u : 
10. tW = Xu
  X | t

17 steps

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

(20steps total) PrintForm Definitions Lemmas FTA Sections DiscrMathExt Doc