In some sense we won't really know whether a proof is rock-solid until we have run it through a verifier, using a proven-correct verifier on proven-correct hardware.
If theorem provers grow to be more easy to use, we may require proofs to be verified, but we aren't there yet by a wide stretch.
For an idea about how hard this can be, check out http://www.cs.ru.nl/~freek/comparison/comparison.pdf:
"In 1998, Tom Hales proved the Kepler Conjecture […] with a proof that is in the same category as the Four Color Theorem proof in that it relies on a large amount of computer computation. For this reason the referees of the Annals of Mathematics, where he submitted this proof, did not feel that they could check his work. And then he decided to formalize his proof to force them to admit that it was correct. He calculated that this formalization effort would take around twenty man-years"
(that effort is ongoing at http://code.google.com/p/flyspeck/wiki/FlyspeckFactSheet)
It doesn't need to create the proof, just validate it. See P vs NP.