Explain the theoretical underpinnings of the P vs NP problem. Define P (Polynomial time) and NP (Nondeterministic Polynomial time) clearly, and discuss the significance of NP-complete problems. Analyze the implications of a potential proof that P equals NP versus P not equaling NP on cryptography, optimization, and mathematical reasoning.