Model vocabulary — Supplied models of the eight Lean forms can lack or contain a held relation
DefinitionAPFB06_held_relation_worlds_VocabularyData, predicates and immediate constructor helpers for this reviewed model. Its substantive results are published as separate proved theorem nodes.
Supplied models of the eight Lean forms can lack or contain a held relation. BridgeWorld lacks a task outside a nonempty family. RelationWorld has three supplied profiles, two tasks and bills 1/2; its supportNovel witness and universal floor are proved directly. Boundaries: RelationWorld Cont is supplied, not constructed by corrected word execution, and its A2/BW domain is singleton. Independence is confined to the listed encoded forms; neither model certifies the original physical inputs or intended meaning of a relation between tasks.
This is conditional reference mathematics. The supplied model and its hypotheses are not adopted Foundation inputs, and this node does not establish K1, K3 or K4 closure.
/-
APF Foundation Ledger — theorem node DRAFT (Claude seat, session EthanBrooke-01WrrBvv, 2026-11-13; not
gated, not reviewed, not released, not built on the build box)
name: APFB06_held_relation_worlds
title: The eight declared forms hold in one supplied world where no relation is held and in another where the occupant holds one
inputs_revision: 2026-10-04.1
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: the eight declared-input definition nodes, unchanged. Def_APFB06_HeldRelation; Def_APFB06_
AlignmentHoldsRelation; Thm_APFB06_held_relation_of_occupancy; Thm_APFB06_bridge_independence_eight and
Thm_APFB06_held_family_world (the first world). The second world follows the pattern of
Def_APFPaper5_Worlds_TwoObjects with three raw states, two distinctions, two protocols and two records.
consumes_inputs: none as hypotheses. Declared forms are PROVED of supplied data, which certifies nothing
about the physical inputs.
first world (APFB06.BridgeWorld): the world of the bridge-independence theorem. It has one distinction, so
no task lies outside a nonempty family. (no_held_relation) HeldRelationExists fails. (not_hrel) not every
actual joint alignment holds a relation.
second world (APFB06.RelationWorld): raw states a, b, c with three different continuation relations. Two
distinctions: dA, true at a only; dR, true at a and b. Two protocols: the light one bills 1 and keeps the
record for dA; the full one bills 2 and keeps both records. Capacity 2, floor 1. The alignment sits at a
and carries both distinctions. (eight_hold) all eight declared forms hold, B06 in the instantiation of the
held-family theorems. (alignment_holds_relation) the alignment holds a relation: dR is tested and
support-novel over the family of dA. (held_relation_exists, relation_pays) the theorems of
Thm_APFB06_held_relation_of_occupancy apply and give HeldRelationExists and a third charge of at least the
floor.
reading: the eight declared forms, as encoded and with B06 read under the joint-class ruling, neither give
nor exclude a held relation. That an actual joint alignment holds one is independent of them.
not_claimed: independence from the physical inputs as the author means them; that either world is a
physical context; that dR is "the relation between" anything.
-/
import Theorems.Thm_APFB06_needsNewRecord_iff_inside_held
import Theorems.Thm_APFB06_heldRelationExists_of_alignments_hold_relation
import Theorems.Thm_APFB06_held_relation_pays_floor
import Definitions.Def_APFB06_held_family_world_Vocabulary
import Theorems.Thm_APFB06_BridgeWorld_world_B06_on_domain
import Definitions.Def_APF_B04_DeclaredInput
import Definitions.Def_APF_B07a_DeclaredInput
import Definitions.Def_APF_B07b_DeclaredInput
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
set_option autoImplicit false
open APFPaper1.Source
/-! ### First world: no relation is held -/
namespace APFB06.BridgeWorld
instance instDecEqDomain (g : Unit) : DecidableEq {d : Raw g → Bool // Delta g d} :=
fun a b => isTrue (Subtype.ext (a.2.trans b.2.symm))
end APFB06.BridgeWorld
/-! ### Second world: the occupant holds a relation -/
namespace APFB06.RelationWorld
inductive St
| a | b | c
deriving DecidableEq
/-- The continuation relation. The processes are the two protocols: `false` the light one, `true` the
full one. State a admits both, state b the full one only, state c neither. -/
def cont : St → Bool → Prop
| .a, _ => True
| .b, q => q = true
| .c, _ => False
theorem cont_inj (x y : St) (h : cont x = cont y) : x = y := by
cases x <;> cases y
· rfl
· exact Bool.noConfusion (show false = true from Eq.mp (congrFun h false) trivial)
· exact (show False from Eq.mp (congrFun h false) trivial).elim
· exact Bool.noConfusion (show false = true from Eq.mpr (congrFun h false) trivial)
· rfl
· exact (show False from Eq.mp (congrFun h true) rfl).elim
· exact (show False from Eq.mpr (congrFun h false) trivial).elim
· exact (show False from Eq.mpr (congrFun h true) rfl).elim
· rfl
abbrev K : (g : Unit) → St → Bool → Prop := fun _ => cont
/-- True at a only. -/
def dA : St → Bool
| .a => true
| _ => false
/-- True at a and b. -/
def dR : St → Bool
| .c => false
| _ => true
/-- The distinction domain: dA and dR. -/
abbrev Delta : (g : Unit) → (St → Bool) → Prop := fun _ d => d = dA ∨ d = dR
noncomputable instance instDecEqDomain (g : Unit) : DecidableEq {d : St → Bool // Delta g d} :=
Classical.decEq _
abbrev Dist : Type := {d : St → Bool // Delta () d}
theorem hresp (g : Unit) (d : {d : St → Bool // Delta g d}) (x y : St) (h : K g x = K g y) :
d.val x = d.val y := by
rw [cont_inj x y h]
def dAd : Dist := ⟨dA, Or.inl rfl⟩
def dRd : Dist := ⟨dR, Or.inr rfl⟩
/-- The protocols: both processes. -/
def protocols : (g : Unit) → Set Bool := fun _ => Set.univ
def pL : {p : Bool // p ∈ protocols ()} := ⟨false, Set.mem_univ _⟩
def pF : {p : Bool // p ∈ protocols ()} := ⟨true, Set.mem_univ _⟩
/-- Records: `false` is the record for dA, `true` the record for dR. A distinction's record is its value
at b. The light protocol keeps the first; the full protocol keeps both. -/
def maint (g : Unit) (p : {p : Bool // p ∈ protocols g}) : Set Bool := {r | r = false ∨ p.val = true}
def suff (g : Unit) (_ : {p : Bool // p ∈ protocols g}) (s : Set Bool)
(d : {d : St → Bool // Delta g d}) : Prop := d.val St.b ∈ s
def uses (g : Unit) (_ : {p : Bool // p ∈ protocols g}) (d : {d : St → Bool // Delta g d})
(s : Set Bool) : Prop := d.val St.b ∈ s
def wholeRes (g : Unit) (p : {p : Bool // p ∈ protocols g}) : Bool := p.val
def calibration (_ : Unit) : Bool → NNReal
| true => 2
| false => 1
def C : Unit → NNReal := fun _ => 2
abbrev ServesFam (p : {p : Bool // p ∈ protocols ()}) (S : Finset Dist) : Prop :=
∀ d ∈ S, ∃ sigma : Set Bool, sigma ⊆ maint () p ∧ suff () p sigma d ∧ uses () p d sigma
noncomputable abbrev cost (S : Finset Dist) : ℝ :=
familyCost (wholeRes ()) (calibration ()) (maint ()) (suff ()) (uses ()) S
abbrev billSet (S : Finset Dist) : Set ℝ :=
{c : ℝ | ∃ p : {p : Bool // p ∈ protocols ()},
ServesFam p S ∧ ((calibration () (wholeRes () p) : NNReal) : ℝ) = c}
/-- The held family: both distinctions. -/
noncomputable def heldD : Finset Dist := {dAd, dRd}
/-- The occupant's alignment: it sits at a and carries dA and dR. -/
noncomputable def alignR : APFB06.OriginalAlignment (K ())
(APFB06.physicalDomain (K ()) (Delta ()) (hresp ())) where
carrier := APFB01.physicalClass (K ()) St.a
carried := heldD.map (APFB06.taskEquiv (K ()) (Delta ()) (hresp ())).symm.toEmbedding
active := by
intro t ht
obtain ⟨d, hd, rfl⟩ := Finset.mem_map.mp ht
rcases Finset.mem_insert.mp hd with rfl | hd'
· rfl
· rw [Finset.mem_singleton.mp hd']
rfl
def actualJointR : Set (Sigma fun g =>
APFB06.OriginalAlignment (K g) (APFB06.physicalDomain (K g) (Delta g) (hresp g))) :=
{⟨(), alignR⟩}
/-- The eight declared forms on the supplied data, B06 in the instantiation of the held-family theorems. -/
def EightHold : Prop :=
APF_B01_DeclaredInput (K ())
(fun (f : APFB01.PhysicalState (K ()) → Prop) (x : St) => f (APFB01.physicalClass (K ()) x))
(fun (f : APFB01.PhysicalState (K ()) → Prop) (x : St) => f (APFB01.physicalClass (K ()) x))
(fun (f : APFB01.PhysicalState (K ()) → Prop) (x : St) => f (APFB01.physicalClass (K ()) x))
(fun (f : APFB01.PhysicalState (K ()) → Prop) (x : St) => f (APFB01.physicalClass (K ()) x)) ∧
APFB02.B02SourceMeaning (Context := Unit) (X := fun _ => St) (Q := fun _ => Bool)
(P := fun g => {p : Bool // p ∈ protocols g}) (Record := fun _ => Bool)
K Delta maint suff uses ∧
APFB03.B03TaskCost (Context := Unit) (D := fun g => {d : St → Bool // Delta g d})
(P := fun g => {p : Bool // p ∈ protocols g}) (R := fun _ => Bool) (Record := fun _ => Bool)
wholeRes calibration maint suff uses ∧
APFB04.B04FiniteCapacity (Context := Unit) (fun g => ((C g : NNReal) : ℝ)) ∧
APFB05.MarginalFloor (Context := Unit) (D := fun g => {d : St → Bool // Delta g d})
(P := fun g => {p : Bool // p ∈ protocols g}) (R := fun _ => Bool) (Record := fun _ => Bool)
wholeRes calibration maint suff uses (fun _ _ => True) (fun g => ((C g : NNReal) : ℝ))
(fun _ => (1 : ℝ)) ∧
APFB06.AmendedB06_20260914 K
(fun g => APFB06.physicalDomain (K g) (Delta g) (hresp g)) protocols
(fun g => APFB06.extensionalJoint (maint g)
(fun p s t => suff g p s (APFB06.taskEquiv (K g) (Delta g) (hresp g) t))
(fun p t s => uses g p (APFB06.taskEquiv (K g) (Delta g) (hresp g) t) s))
wholeRes calibration C actualJointR ∧
APFB07a.A2Selection (Interface := Unit)
(Configuration := fun _ => APFB01.PhysicalState (K ()))
(fun _ s => s = APFB01.physicalClass (K ()) St.a) (fun _ _ => (1 : ℝ))
(fun _ => APFB01.physicalClass (K ()) St.a) ∧
APFB07b.BWUniqueMinimum (Interface := Unit)
(Configuration := fun _ => APFB01.PhysicalState (K ()))
(fun _ s => s = APFB01.physicalClass (K ()) St.a) (fun _ _ => (1 : ℝ))
end APFB06.RelationWorld
Confirmed by the mission captain (proposal self-audit).