But, is it proven that RSA is secure? Wouldn't that also prove P != NP?

Haha, well it does depend on the assumption that integer factorisation is hard. Although I'm not sure that being able to do it implies P = NP.