Euclid Proof Explanation?

How did Euclid prove that if (2^p)-1 is prime then (2^p-1)((2^p)-1) is a perfect number. I've searched online but all sites give the proposition and not a proof of why this is true. Any help is appreciated.