Traditionally writing verified proofs is a hard undertaking, exactly because you need to write out a lot of steps "normal human" mathematics jump over, but with AI its easier.
They aren't
You'd still have to check the theorem statement, which is not going to be nearly as easy as with FLT (Riemann uses analytic continuations etc) but it's much easier than checking a 250,000 page proof.
It's always, always, always stating problem wrong.
It's going to be the age of the oracle.