(15steps total) PrintForm Definitions Lemmas FTA Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: prime factorization unique a

1. a : {2...}
2. b : 
3. k:g,h:({a..b}).
3. is_prime_factorization(abg)
3. 
3. is_prime_factorization(abh)
3. 
3. {a..b}(g) = k  {a..b}(g) = {a..b}(h g = h
  g,h:({a..b}).
  is_prime_factorization(abg)
  
  is_prime_factorization(abh {a..b}(g) = {a..b}(h g = h


By: Auto


Generated subgoal:

1 4. g : {a..b}
5. h : {a..b}
6. is_prime_factorization(abg)
7. is_prime_factorization(abh)
8. {a..b}(g) = {a..b}(h)
  g = h

2 steps

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

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