side keeping ways meet the laws
ProvedAPFPaper1.FreeWays.side_keeping_ways_meet_the_lawsapfapf-referencepullbacks-v46-2026-11
Result: side keeping ways meet the laws. All parameters and hypotheses are retained in the declaration below.
theorem side_keeping_ways_meet_the_laws (e : ℝ) (he : 0 < e) :
Identity (SideKeepingConn e) ∧ Concat (SideKeepingConn e) ∧
Floor (SideKeepingConn e) (fun _ => e) ∧
(∀ (m n : ℤ) (b : Bool), SideKeepingConn e ⟨m, b⟩ ⟨n, b⟩ 0) ∧
(∀ (m n : ℤ) (b : Bool) (c : ℝ), SideKeepingConn e ⟨m, b⟩ ⟨n, !b⟩ c → c = e)
Module context and limits: Identity, unconditional cross-context Concat and a positive Floor on distinct alignments are explicit hypotheses. Under them free chains returning to a context fix its alignment, and reversible free reach is a renaming. Concat is stronger than the paper's conditional admissible-composition clause; these laws are not adopted inputs or assertions of physical connectivity.
Source scope parameters:
universe u v
variable {Ctx : Type u} {Al : Ctx → Type v}
variable {Conn : Place Al → Place Al → ℝ → Prop} {eps : Ctx → ℝ}
variable {Ctx : Type u} {Al : Ctx → Type v}
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_free_ways_under_the_per_realignment_floor_Vocabulary import Mathlib.Data.Real.Basic import Mathlib.Tactic.Linarith set_option autoImplicit false
Formal statement
theorem APFPaper1.FreeWays.side_keeping_ways_meet_the_laws :
∀ (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} Int (fun (x : Int) => Bool) (APFPaper1.FreeWays.SideKeepingConn e))
(And (@APFPaper1.FreeWays.Concat.{0, 0} Int (fun (x : Int) => Bool) (APFPaper1.FreeWays.SideKeepingConn e))
(And
(@APFPaper1.FreeWays.Floor.{0, 0} Int (fun (x : Int) => Bool) (APFPaper1.FreeWays.SideKeepingConn e)
fun (x : Int) => e)
(And
(∀ (m n : Int) (b : Bool),
APFPaper1.FreeWays.SideKeepingConn e (@Sigma.mk.{0, 0} Int (fun (x : Int) => Bool) m b)
(@Sigma.mk.{0, 0} Int (fun (x : Int) => Bool) n b)
(@OfNat.ofNat.{0} Real (nat_lit 0) (@Zero.toOfNat0.{0} Real Real.instZero)))
(∀ (m n : Int) (b : Bool) (c : Real),
APFPaper1.FreeWays.SideKeepingConn e (@Sigma.mk.{0, 0} Int (fun (x : Int) => Bool) m b)
(@Sigma.mk.{0, 0} Int (fun (x : Int) => Bool) n (Bool.not b)) c →
@Eq.{1} Real c e)))) := by sorry
Source
['Theorems.Thm_APFPaper1_free_ways_under_the_per_realignment_floor:269; pullbacks v46; source SHA-256 529f30c5a3bf2cde9840cd61eb28752149341bafeb1b37a568e95251a8592976']