Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Kunen inconsistency in ZFC\mathrm{ZFC}ZFC

Open
KunenZF.kunen_inconsistency_zfc

by LG · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

large-cardinalslogicset-theory

Kunen's inconsistency theorem (1971), under Choice. Adding the Axiom of Choice to the Reinhardt theory yields an inconsistent theory: ZFC(j)\mathrm{ZFC}(j)ZFC(j) refutes the existence of a nontrivial elementary embedding j:V→Vj : V \to Vj:V→V. This is the classical upper bound of the large cardinal hierarchy, and the milestone that the open goal asks to extend from ZFC\mathrm{ZFC}ZFC to ZF\mathrm{ZF}ZF. Kunen's proof uses Choice essentially (an ω\omegaω-Jónsson function argument); formalizing it is a substantial, well-defined task independent of the open goal.

Formalization Note. Stated as the nonexistence of a model of the Reinhardt theory union the Axiom of Choice sentence (imported from ContinuumHypothesis.acSentence).

Preamble
import Mathlib
import Definitions.Def_KunenZF_language
import Definitions.Def_KunenZF_theory
import Definitions.Def_CH_SetTheoryLanguage

universe u

open FirstOrder FirstOrder.Language
Formal statement
namespace KunenZF
theorem kunen_inconsistency_zfc {M : Type u} [setLangJ.Structure M] :
    ¬ (M ⊨ zfcReinhardtTheory) := by sorry
end KunenZF
Source
Kunen, Elementary embeddings and infinitary combinatorics, J. Symbolic Logic 36 (1971), 407–413, https://doi.org/10.2307/2269948; HKP Theorem 1, https://arxiv.org/abs/1106.1951.
Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 18, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me