[bodhiandpysics1]

It's important to remember that P=NP doesn't just imply that P = NP; it implies that P = PH (the polynomial hierarchy). There are a whole series of much harder problems than NP that also are in P if P = NP. Finding proofs is always at least NP hard! Remember, any proof is at least going to include some boolean phrase (this is true and that is true so we get such and such), which is just BSAT, an NP complete problem. In other words, yes. It's very very unlikely.