unheld sides turn freely
ProvedAPFPaper1.FreeWays.unheld_sides_turn_freelyapfapf-referencepullbacks-v46-2026-11
Result: unheld sides turn freely. All parameters and hypotheses are retained in the declaration below.
theorem unheld_sides_turn_freely (e : ℝ) (he : 0 < e) :
Identity (UnheldTurnConn e) ∧ Concat (UnheldTurnConn e) ∧
NarrowFloor (fun (_ : Unit) (A : OneMark ()) => A.1.2) (UnheldTurnConn e) (fun _ => e) ∧
UnheldTurnConn e ⟨(), ⟨(true, false), by simp⟩⟩ ⟨(), ⟨(false, false), by simp⟩⟩ 0 ∧
(∀ B : OneMark (), FreeChain (UnheldTurnConn e) ⟨(), ⟨(true, true), by simp⟩⟩ ⟨(), B⟩ →
B.1.1 = true) ∧
¬ Floor (UnheldTurnConn e) (fun _ => e)
Module context and limits: NarrowFloor is a supplied condition on a held-content map and connection relation. With Identity and cross-context Concat it fixes held content along free chains; guarded unique minimization additionally fixes a minimum. A model distinguishes it from the wide Floor. No converse that unchanged holdings imply free motion, physical adoption, or release mechanism is claimed.
Source scope parameters:
universe u v w
variable {Ctx : Type u} {Al : Ctx → Type v} {Hd : Ctx → Type w}
variable {held : (g : Ctx) → Al g → Hd g} {Conn : Place Al → Place Al → ℝ → Prop} {eps : Ctx → ℝ}
variable {Ctx : Type u} {Cfg : Ctx → Type v} {Dn : Ctx → Type w}
variable {reads : (g : Ctx) → Dn g → Cfg g → Bool}
{Conn : Place (Alignment reads) → Place (Alignment reads) → ℝ → Prop} {eps : Ctx → ℝ}
Public reference result; this record does not establish Foundation admission, physical K1–K4 closure, a forced transfer or Born-rule derivation.
Preamble
import Definitions.Def_APFPaper1_the_narrow_floor_Vocabulary import Definitions.Def_APFB06_two_context_world_has_no_per_realignment_floor_Vocabulary import Theorems.Thm_APFB06_TwoContextWorld_kept_wAwayAndBack import Theorems.Thm_APFB06_TwoContextWorld_kept_wTurnTwice import Theorems.Thm_APFB06_TwoContextWorld_away_and_back_turns_the_side_over import Theorems.Thm_APFB06_TwoContextWorld_turning_twice_turns_the_side_over import Theorems.Thm_APFB06_TwoContextWorld_a_free_way_turns_the_side_over import Theorems.Thm_APFB06_TwoContextWorld_two_free_turns_turn_the_side_over import Theorems.Thm_APFB06_TwoContextWorld_two_context_world_has_no_per_realignment_floor import Definitions.Def_APFB07b_unique_minimum_where_no_tie_Vocabulary import Theorems.Thm_APFB07b_bwWhere_true_iff import Theorems.Thm_APFB07b_bwWhere_of_bw import Theorems.Thm_APFB07b_not_generic_of_two_minima import Theorems.Thm_APFB07b_unique_fewest_of_generic import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum set_option autoImplicit false
Formal statement
theorem APFPaper1.FreeWays.unheld_sides_turn_freely :
∀ (e : Real)
(he : @LT.lt.{0} Real Real.instLT (@OfNat.ofNat.{0} Real (nat_lit 0) (@Zero.toOfNat0.{0} Real Real.instZero)) e),
And (@APFPaper1.FreeWays.Identity.{0, 0} Unit APFPaper1.FreeWays.OneMark (APFPaper1.FreeWays.UnheldTurnConn e))
(And (@APFPaper1.FreeWays.Concat.{0, 0} Unit APFPaper1.FreeWays.OneMark (APFPaper1.FreeWays.UnheldTurnConn e))
(And
(@APFPaper1.FreeWays.NarrowFloor.{0, 0, 0} Unit (fun (x : Unit) => APFPaper1.FreeWays.OneMark Unit.unit)
(fun (x : Unit) => Bool)
(fun (x : Unit) (A : APFPaper1.FreeWays.OneMark Unit.unit) =>
@Prod.snd.{0, 0} Bool Bool
(@Subtype.val.{1} (Prod.{0, 0} Bool Bool)
(fun (p : Prod.{0, 0} Bool Bool) =>
@Eq.{1} Bool (@Prod.snd.{0, 0} Bool Bool p) Bool.true →
@Eq.{1} Bool (@Prod.fst.{0, 0} Bool Bool p) Bool.true)
A))
(APFPaper1.FreeWays.UnheldTurnConn e) fun (x : Unit) => e)
(And
(APFPaper1.FreeWays.UnheldTurnConn e
(@Sigma.mk.{0, 0} Unit APFPaper1.FreeWays.OneMark Unit.unit
(@Subtype.mk.{1} (Prod.{0, 0} Bool Bool)
(fun (p : Prod.{0, 0} Bool Bool) =>
@Eq.{1} Bool (@Prod.snd.{0, 0} Bool Bool p) Bool.true →
@Eq.{1} Bool (@Prod.fst.{0, 0} Bool Bool p) Bool.true)
(@Prod.mk.{0, 0} Bool Bool Bool.true Bool.false)
(@of_eq_true (@Eq.{1} Bool Bool.false Bool.true → @Eq.{1} Bool Bool.true Bool.true)
(@Eq.trans.{1} Prop (@Eq.{1} Bool Bool.false Bool.true → @Eq.{1} Bool Bool.true Bool.true)
(False → True) True
(@implies_congr.{0, 0} (@Eq.{1} Bool Bool.false Bool.true) False (@Eq.{1} Bool Bool.true Bool.true)
True Bool.false_eq_true (@eq_self.{1} Bool Bool.true))
(implies_true.{0} False)))))
(@Sigma.mk.{0, 0} Unit APFPaper1.FreeWays.OneMark Unit.unit
(@Subtype.mk.{1} (Prod.{0, 0} Bool Bool)
(fun (p : Prod.{0, 0} Bool Bool) =>
@Eq.{1} Bool (@Prod.snd.{0, 0} Bool Bool p) Bool.true →
@Eq.{1} Bool (@Prod.fst.{0, 0} Bool Bool p) Bool.true)
(@Prod.mk.{0, 0} Bool Bool Bool.false Bool.false)
(@of_eq_true (@Eq.{1} Bool Bool.false Bool.true → @Eq.{1} Bool Bool.false Bool.true)
(@Eq.trans.{1} Prop (@Eq.{1} Bool Bool.false Bool.true → @Eq.{1} Bool Bool.false Bool.true)
(False → False) True
(@implies_congr.{0, 0} (@Eq.{1} Bool Bool.false Bool.true) False (@Eq.{1} Bool Bool.false Bool.true)
False Bool.false_eq_true Bool.false_eq_true)
(@imp_self._simp_1 False)))))
(@OfNat.ofNat.{0} Real (nat_lit 0) (@Zero.toOfNat0.{0} Real Real.instZero)))
(And
(∀ (B : APFPaper1.FreeWays.OneMark Unit.unit),
@APFPaper1.FreeWays.FreeChain.{0, 0} Unit APFPaper1.FreeWays.OneMark (APFPaper1.FreeWays.UnheldTurnConn e)
(@Sigma.mk.{0, 0} Unit APFPaper1.FreeWays.OneMark Unit.unit
(@Subtype.mk.{1} (Prod.{0, 0} Bool Bool)
(fun (p : Prod.{0, 0} Bool Bool) =>
@Eq.{1} Bool (@Prod.snd.{0, 0} Bool Bool p) Bool.true →
@Eq.{1} Bool (@Prod.fst.{0, 0} Bool Bool p) Bool.true)
(@Prod.mk.{0, 0} Bool Bool Bool.true Bool.true)
(@of_eq_true (@Eq.{1} Bool Bool.true Bool.true → @Eq.{1} Bool Bool.true Bool.true)
(@Eq.trans.{1} Prop (@Eq.{1} Bool Bool.true Bool.true → @Eq.{1} Bool Bool.true Bool.true)
(True → True) True
(@implies_congr.{0, 0} (@Eq.{1} Bool Bool.true Bool.true) True
(@Eq.{1} Bool Bool.true Bool.true) True (@eq_self.{1} Bool Bool.true)
(@eq_self.{1} Bool Bool.true))
(@imp_self._simp_1 True)))))
(@Sigma.mk.{0, 0} Unit APFPaper1.FreeWays.OneMark Unit.unit B) →
@Eq.{1} Bool
(@Prod.fst.{0, 0} Bool Bool
(@Subtype.val.{1} (Prod.{0, 0} Bool Bool)
(fun (p : Prod.{0, 0} Bool Bool) =>
@Eq.{1} Bool (@Prod.snd.{0, 0} Bool Bool p) Bool.true →
@Eq.{1} Bool (@Prod.fst.{0, 0} Bool Bool p) Bool.true)
B))
Bool.true)
(Not
(@APFPaper1.FreeWays.Floor.{0, 0} Unit APFPaper1.FreeWays.OneMark (APFPaper1.FreeWays.UnheldTurnConn e)
fun (x : Unit) => e)))))) := by sorry
Source
['Theorems.Thm_APFPaper1_the_narrow_floor:195; pullbacks v46; source SHA-256 27e0ac447161b859d9cb18d16e29437c93e3c0ce853c1cdfdad89c87bdf8c9d6']