(3steps total) PrintForm Definitions Lemmas FTA Sections DiscrMathExt Search Doc
IF YOU CAN SEE THIS go to http://www.cs.cornell.edu/Info/People/sfa/Nuprl/Shared/Xindentation_hack_doc.html
The Fundamental Theorem of Arithmetic (FTA)

There is a unique prime factorization for every positive integer.

At: fta mset


  n:{1...}. !f:(Prime). f is a factorization of n

By: SimilarTo Thm*  n:{1...}. f:(Prime). f is a factorization of n


Generated subgoal:

1 1. n : {1...}
2. f : Prime
3. f is a factorization of n
  f is the f:(Prime). f is a factorization of n

2 steps

About:
natural_numberfunctionallexists
IF YOU CAN SEE THIS go to http://www.cs.cornell.edu/Info/People/sfa/Nuprl/Shared/Xindentation_hack_doc.html

(3steps total) PrintForm Definitions Lemmas FTA Sections DiscrMathExt Search Doc