Does proving security in the random oracle model ensure that using a hash function is secure?

Question

In security proofs,

I have seen the random oracle model and the standard model.

If I prove security in the random oracle model, does this mean that if I use SHA-3, assuming sha-3 cannot be broken, that the protocol is secure under sha-3?

Are there any caveats to proving security in the random oracle model and real-life?