Every side along a novel chain
ProvedAPFB05.every_side_along_a_novel_chainapfapf-referencesib-v52-2026-11
For nonempty X, under FreeWhereNovel, a chain starting empty and inserting a novel distinction at each of n steps realizes every assignment on its final family. The conditioned FreeWhereNovel premise was never adopted. Retain starting-state nonemptiness, the chain and novelty hypotheses. The exclusion theorem does not assert either constituent reading belongs to Delta.
Preamble
import Definitions.Def_APFB05_FreeWhereNovel import Definitions.Def_APF_B02_DeclaredInput import Theorems.Thm_APFPaper5_Worlds_bill3_cases import Theorems.Thm_APFPaper5_Worlds_contT_inj import Theorems.Thm_APFPaper5_Worlds_contT_step import Theorems.Thm_APFPaper5_Worlds_world_T_eight_hold import Theorems.Thm_APFPaper5_Worlds_world_T_tied import Theorems.Thm_APFPaper5_Worlds_world_T_not_all_sides import Theorems.Thm_APFPaper5_Worlds_world_T_second_is_novel import Theorems.Thm_APFPaper5_Worlds_world_T_second_pays_the_floor set_option autoImplicit false
Formal statement
theorem APFB05.every_side_along_a_novel_chain {X D : Type*} [DecidableEq D] [Nonempty X]
(novel : Finset D → D → Prop) (reads : D → X → Bool)
(hfree : APFB05.FreeWhereNovel novel reads)
(n : ℕ) (S : ℕ → Finset D) (d : ℕ → D) (h0 : S 0 = ∅)
(hstep : ∀ i < n, S (i + 1) = insert (d i) (S i))
(hnovel : ∀ i < n, novel (S i) (d i)) (v : D → Bool) :
∃ x : X, ∀ e ∈ S n, reads e x = v e := by sorry
Source
Papers/Paper 01 - The Enforceability of Distinction/Paper_1_Enforceability_of_Distinction_Supplement_v9.28.tex; lines 1224-1243,1276-1332,1741-1771,1833-1885,2601-2680; APF Reference Docs/APF Reconstruction Spine/FOUNDATION_INPUTS.json; revision 2026-11-14.1; input B02; source/Theorems/Thm_APFB05_free_where_novel.lean; source/Theorems/Thm_APFB05_free_where_novel.lean; line 32
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.