(2steps total) PrintForm Definitions Lemmas FTA Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: remove prime factor 1

1. a : 
2. b : 
3. f : {a..b}
4. p : 
5. is_prime_factorization(abf)
6. prime(p)
7. p | {a..b}(f)
8. p  {a..b}
9. 0<f(p)
  {a..b}(f) = p{a..b}(reduce_factorization(fp))


By: FwdThru: 
Thm*  a,b:f:({a..b}), z:{a..b}.
Thm*  0<f(z {a..b}(f) = z{a..b}(reduce_factorization(fz))
on [ 0<f(p) ]


Generated subgoals:

None

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

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