P vs. NP

Do you still win the 1 million dollars if you show that P=NP (and thus P!=NP) is unprovable, as opposed to equal or unequal?

If P=NP, there is some algorithm that can decide NP-complete problems in P time. If such an algorithm exists, it can easily (trivially) be proven that P=NP. Therefore, if it can't be proven that P=NP, P!=NP.

If you can prove to me that N=NP is unprovable, I'll go claim the 1 million dollars ;)