Write a detailed theoretical exploration of the P vs NP problem. First, define P and NP complexity classes. Then, hypothesize the scenario where it is proven that P equals NP. Discuss the profound implications this would have on cryptography, optimization, mathematics, and our understanding of problem-solving efficiency.