Added: I believe that the current proof we have of Fermat's Last Theorem uses the existence of a(t least one) Grothendieck universe. However, my understanding is that this dependence can be completely removed due to the fact that Fermat's Last Theorem has small quantifier complexity. I imagine that proofsdue to the fact that Fermat's Last Theorem has small quantifier complexity. I imagine that proofs of statements with higher quantifier complexity that use Grothendieck universes, do not necessarily have a way of removing their dependence on said universes. How would we tell if such arithmetic statements are true of the natural numbers? [Some of statements with higher quantifier complexity that use Grothendieck universesthis was incorrect, do not necessarily have a way of removing their dependence on said universesas pointed out by David Roberts and Timothy Chow. How would we tell if such arithmetic statements are true of the natural numbers?]
Became Hot Network Question