Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The language {∈,j}\{\in, j\}{∈,j} of set theory with a self-embedding

Definition
KunenZF_language

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

logicmodel-theoryset-theory

This definition introduces the first-order language used to state the Kunen inconsistency problem without the Axiom of Choice. The language {∈,j}\{\in, j\}{∈,j} extends the usual language of set theory {∈}\{\in\}{∈} by a single unary function symbol jjj, intended to name a class elementary embedding j:V→Vj : V \to Vj:V→V. Formulas have free variables named by natural numbers, and the usual quantifiers and universal closure are provided. The inclusion incl:{∈}↪{∈,j}\mathrm{incl} : \{\in\} \hookrightarrow \{\in, j\}incl:{∈}↪{∈,j} lets every pure set-theoretic formula be read in the expanded language, which is how the elementarity scheme for jjj is formed. Auxiliary formulas define subset, transitivity, and the property of being an ordinal (a transitive set all of whose elements are transitive), used to speak about the critical point of jjj.

Formalization Note. Built on Mathlib's FirstOrder.Language and the platform's ContinuumHypothesis.setLang; the relation symbol is shared with the pure language so the inclusion acts as the identity on ∈\in∈.

Definition code
import Mathlib
import Definitions.Def_CH_SetTheoryLanguage

/-!
# The language of set theory with a class self-embedding `j`

`setLangJ` extends the first-order language of set theory `{∈}` by a single unary
function symbol `j`, intended to name a (class) elementary embedding `j : V → V`.
`incl` is the inclusion of the pure language `{∈}` into `{∈, j}`.
-/

namespace KunenZF

open FirstOrder FirstOrder.Language

noncomputable section

/-- The function symbols of the expanded language: a single unary symbol `j`. -/
inductive JFun : ℕ → Type
  | j : JFun 1

/-- The first-order language `{∈, j}`: membership plus a unary function symbol `j`. -/
@[reducible] def setLangJ : FirstOrder.Language.{0, 0} where
  Functions := JFun
  Relations := ContinuumHypothesis.SetRel

/-- Formulas of `{∈, j}` with free variables named by natural numbers. -/
abbrev SFormulaJ : Type := setLangJ.BoundedFormula ℕ 0

/-- The inclusion of the pure language of set theory into `{∈, j}`. -/
def incl : ContinuumHypothesis.setLang →ᴸ setLangJ where
  onFunction := fun {_} e => Empty.elim e
  onRelation := fun {_} r => r

/-- The term `j(v)`. -/
def jTerm (v : ℕ) : setLangJ.Term ℕ := Term.func JFun.j (fun _ => Term.var v)

namespace SFormulaJ

/-- The atomic formula `x ∈ y`. -/
def memJ (x y : ℕ) : SFormulaJ :=
  Relations.formula₂ (ContinuumHypothesis.SetRel.mem : setLangJ.Relations 2) (Term.var x) (Term.var y)

/-- The atomic formula `x = y`. -/
def eqJ (x y : ℕ) : SFormulaJ := Term.equal (Term.var x) (Term.var y)

/-- `∀ x, φ`, binding the named variable `x`. -/
def allJ (x : ℕ) (φ : SFormulaJ) : SFormulaJ :=
  Formula.iAlls Unit (Formula.relabel (fun v => if v = x then Sum.inr () else Sum.inl v) φ)

/-- `∃ x, φ`, binding the named variable `x`. -/
def exJ (x : ℕ) (φ : SFormulaJ) : SFormulaJ :=
  Formula.iExs Unit (Formula.relabel (fun v => if v = x then Sum.inr () else Sum.inl v) φ)

/-- An upper bound for the names of the free variables of `φ`. -/
def varBoundJ (φ : SFormulaJ) : ℕ := φ.freeVarFinset.sup id

/-- The universal closure of `φ`, a sentence. -/
def closeJ (φ : SFormulaJ) : setLangJ.Sentence :=
  Formula.iAlls (Fin (varBoundJ φ + 1))
    (Formula.relabel (fun n =>
      (Sum.inr ⟨n % (varBoundJ φ + 1), Nat.mod_lt _ (Nat.succ_pos _)⟩ : Empty ⊕ Fin _)) φ)

/-- `x ⊆ y`. -/
def subsetJ (x y : ℕ) : SFormulaJ := allJ 1040 (memJ 1040 x ⟹ memJ 1040 y)

/-- `t` is transitive. -/
def isTransitiveJ (t : ℕ) : SFormulaJ := allJ 1041 (memJ 1041 t ⟹ subsetJ 1041 t)

/-- `α` is an ordinal: a transitive set all of whose elements are transitive. -/
def isOrdinalJ (α : ℕ) : SFormulaJ :=
  isTransitiveJ α ⊓ allJ 1042 (memJ 1042 α ⟹ isTransitiveJ 1042)

end SFormulaJ

end

end KunenZF
Source
Hamkins–Kirmayer–Perlmutter, Generalizations of the Kunen inconsistency, §1 (the theory ZF(j)); https://arxiv.org/abs/1106.1951. Wikipedia, Reinhardt cardinal (formulation with a function symbol j).
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