Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

ZF207: consistency implies unprovability of nonhalting

Open
PalomarZF207.neg_unprovable_of_represents207

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

busy-beaverincompletenessindependencemathematical-logicset-theoryturing-machineszf207

Let HHH be any closed set-theoretic sentence that expresses blank-tape halting of the literal 207-state machine in every ZF model (Represents207 H). If ZF is consistent, then ZF does not prove ¬H\neg H¬H. This is the unprovability clause of Theorem 1.2(1), in lemma form generalized over the representing sentence (the paper states it for the sentence it constructs). In the source it follows from the calibration principle (Lemma 1.3) and Gödel's second incompleteness theorem for the calibrated arithmetic theory, via neg_unprovable_of_calibration.

Preamble
import Definitions.Def_palomar_zf207_history
import Definitions.Def_palomar_zf207_zf
import Definitions.Def_palomar_zf207_statement
Formal statement
namespace PalomarZF207

theorem neg_unprovable_of_represents207 (H : Formula) (hH : Represents207 H) : Consistent → ¬ Provable (Neg H) := by sorry

end PalomarZF207
Source
James Chang, ZF207 paper (2026), Theorem 1.2(1) and Lemma 1.3 (lem:calib); production proof https://github.com/jamesyc/BusyBeaver/blob/37861b991bb70dbaee7dbd91120ab533cba658e2/ZF207/ProofSources/Independence/Godel.lean#L24-L40 and https://github.com/jamesyc/BusyBeaver/blob/37861b991bb70dbaee7dbd91120ab533cba658e2/ZF207/ProofSources/Independence/Top.lean#L39-L52

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