MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).

All statements expressible in the language of arithmetic can be represented by formulas in the language of set theory that are only $\Delta_1$ in the Levy hierarchy. In particular, all transitive models will agree on whether they are true. If we further restrict ourselves to only consider the true statements in $\mathbb{N}$ that are ZFC theorems, then all ZFC models will agree that these statements must be true so they are about as obvious to ZFC models as possible. Now if you are an oracle having knowledge of all such true statements, then you will probably develop an intuition that makes them all seem "intuitively obvious." This reflects the answers suggesting that a theorem is obvious after you prove it.
To add one more related point here, when addressing G$\ddot{\textrm{o}}$del's Incompleteness Theorem, one can naively ask about completing PA in the "obvious" way, i.e., by extending it to be the theory consisting of all true statements in $\mathbb{N}$. But of course such a completion is not computable.