Nuprl - Proof: fta mset

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
The Fundamental Theorem of Arithmetic (FTA)

There is a unique prime factorization for every positive integer.

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:

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