Suzuki: no parameter-definable Reinhardt embedding
OpenKunenZF.suzuki_no_definable_reinhardtSuzuki's theorem (1999), the definable case in . For every pure set-theoretic formula , the Reinhardt theory together with the assertion " is defined by from parameters" is inconsistent. In other words, no elementary embedding that is definable from parameters (with 's graph given by for some choice of parameters ) is nontrivial. This is the strongest known -only partial result toward the goal: it rules out all definable Reinhardt embeddings without using Choice, and its least-moved-ordinal diagonalization is exactly the argument that does not extend to arbitrary (non-definable) classes.
Formalization Note. The theorem quantifies over the defining formula ; the definability sentence universally closes the input/output variables and existentially closes the remaining parameter variables of .
import Mathlib import Definitions.Def_KunenZF_language import Definitions.Def_KunenZF_theory import Definitions.Def_CH_SetTheoryLanguage universe u open FirstOrder FirstOrder.Language
namespace KunenZF
theorem suzuki_no_definable_reinhardt {M : Type u} [setLangJ.Structure M]
(δ : ContinuumHypothesis.SFormula) :
¬ (M ⊨ reinhardtDefinableTheory δ) := by sorry
end KunenZFConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.