Allsidesheld of turning over
ProvedAPFPaper5.K1.allSidesHeld_of_turning_overapfapf-referencesib-v44-2026-11
For a finite coordinate family and a nonempty state type, assume every state can be replaced by a state reversing any chosen coordinate while preserving all others. Then the readout realizes every Boolean assignment. The individual-flip closure is a substantive assumption.
Preamble
import Definitions.Def_APF_B02_DeclaredInput import Theorems.Thm_APFPaper5_K1_reaching_every_value_needs_a_turn_over import Theorems.Thm_APFPaper5_K1_holdStep_returns import Theorems.Thm_APFPaper5_K1_turn_mixes_the_pair_of_step import Theorems.Thm_APFPaper5_K1_two_distinctions_quarter_turn import Theorems.Thm_APFPaper5_K1_quarter2_is_not_a_rearrangement_in_any_naming import Mathlib.Algebra.Order.BigOperators.Group.Finset set_option autoImplicit false namespace APFPaper5.K1 end APFPaper5.K1 open APFPaper5.K1
Formal statement
theorem APFPaper5.K1.allSidesHeld_of_turning_over {X D : Type*} [Fintype D] [DecidableEq D] [Nonempty X]
(reads : D → X → Bool)
(hturn : ∀ (x : X) (d : D), ∃ y : X, reads d y = !(reads d x) ∧
∀ e : D, e ≠ d → reads e y = reads e x) : AllSidesHeld reads := by sorry
Source
Sib v44 Theorems/Thm_APFPaper5_K1_list_reduced.lean:91
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.