Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A nontrivial elementary j:V→Vj:V\to Vj:V→V moves an ordinal

Open
KunenZF.nontrivial_moves_ordinal

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

large-cardinalslogicset-theory

In ZF(j)\mathrm{ZF}(j)ZF(j), a nontrivial elementary embedding j:V→Vj : V \to Vj:V→V must move an ordinal. Equivalently, adding the sentence "jjj fixes every ordinal" to the Reinhardt theory yields an inconsistent theory. Consequently a nontrivial such jjj has a critical point — the least ordinal it moves — which is a Reinhardt cardinal; this justifies reading the goal as a statement about Reinhardt cardinals rather than merely about nontrivial embeddings. This is the critical-point existence lemma of Hamkins–Kirmayer–Perlmutter (Lemma 4(2)), specialized to self-embeddings of VVV, and is provable in ZF(j)\mathrm{ZF}(j)ZF(j) without Choice.

Formalization Note. Stated as the nonexistence of a model of the Reinhardt theory together with the universal sentence ∀α (Ordinal(α)→j(α)=α)\forall \alpha\,(\mathrm{Ordinal}(\alpha) \to j(\alpha)=\alpha)∀α(Ordinal(α)→j(α)=α), where "ordinal" is a transitive set of transitive sets.

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 nontrivial_moves_ordinal {M : Type u} [setLangJ.Structure M] :
    ¬ (M ⊨ (reinhardtTheory ∪ {SFormulaJ.closeJ fixesOrdinalsFormula})) := by sorry
end KunenZF
Source
Hamkins–Kirmayer–Perlmutter, Generalizations of the Kunen inconsistency, Lemma 4(2) (critical point), https://arxiv.org/abs/1106.1951; Ann. Pure Appl. Logic 163 (2012), 1872–1890.
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