FTA Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
RankTheoremName
21Thm*  a:{2...}, b:, g,h:({a..b}).
Thm*  is_prime_factorization(a; b; g)
Thm*  
Thm*  is_prime_factorization(a; b; h)  {a..b}(g) = {a..b}(h)  g = h
[prime_factorization_unique]
cites the following:
19Thm*  a:, b:, f:({a..b}), p:.
Thm*  is_prime_factorization(a; b; f)
Thm*  
Thm*  prime(p)  p | {a..b}(f)  p  {a..b} & 0<f(p)
[prime_factorization_includes_prime_divisors]
7Thm*  a,b:, f:({a..b}), j:{a..b}. 0<f(j)  j | {a..b}(f)[factor_divides_evalfactorization]
20Thm*  a:, b:, f:({a..b}), p:.
Thm*  is_prime_factorization(a; b; f)
Thm*  
Thm*  prime(p)
Thm*  
Thm*  p | {a..b}(f)  {a..b}(f) = p{a..b}(reduce_factorization(f; p))
[remove_prime_factor]
0Thm*  a,b:, f,g:({a..b}), j:{a..b}.
Thm*  0<f(j)
Thm*  
Thm*  0<g(j)  reduce_factorization(f; j) = reduce_factorization(g; j)  f = g
[reduce_factorization_cancel]
4Thm*  a:, b:, f:({a..b}). {a..b}(f)  [eval_factorization_nat_plus]
7Thm*  a:, b:, f:({a..b}), j:{a..b}.
Thm*  2j  0<f(j)  {a..b}(reduce_factorization(f; j))<{a..b}(f)
[eval_reduce_factorization_less]
1Thm*  a,b:, f:({a..b}), j:{a..b}.
Thm*  0<f(j)
Thm*  
Thm*  is_prime_factorization(a; b; f)
Thm*  
Thm*  is_prime_factorization(a; b; reduce_factorization(f; j))
[reduce_fac_pres_isprimefac]
6Thm*  a:{2...}, b:, f:({a..b}). {a..b}(f) = 1  f = (x.0)[eval_factorization_one_c]
6Thm*  a:{2...}, b:, f:({a..b}). {a..b}(f) = 1  (i:{a..b}. 0<f(i))[eval_factorization_one_b]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
FTA Sections DiscrMathExt Doc