Model vocabulary — A supplied swap model
DefinitionAPFB06_swap_world_Vocabularyapfapf-referenceusb-v58-batch-a-2026-11
Data, predicates and immediate constructor helpers for this reviewed model. Its substantive results are published as separate proved theorem nodes.
The supplied no-record fragment swaps the two Boolean readings. It is an involution, fixes (true,true), and moves (true,false). Historical declared forms and the stated NothingDrawn/StillHeldAfter predicates are proved on this model. The historical header retains later-ruling caveats. No physical free swap, current input certification, protocol binding or continuity follows.
Supplied data and hypotheses
- Every formal parameter and hypothesis remains exposed. Historical model encodings and named conditions are not adopted as current physical inputs.
Limits
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.
Definition code
/-
APF Foundation Ledger — theorem node DRAFT (Claude seat, session EthanBrooke-01WrrBvv, 2026-11-17; not
gated, not reviewed, not released, not built on the build machine, in no bundle)
name: APFB06_swap_world
title: One supplied world in which a hold swaps the two sides of a pair and turns nothing over, and which still meets the eight declared forms, B02 with its second sentence, the joint class, the held-relation reading and the record sentences
inputs_revision: 2026-11-20.2 (the eight declared forms as encoded, with B02 also in the builder seat's
proposed form Def_APF_B02_DeclaredInput_r2_proposed)
restated: 2026-11-21 09:49 HST, for bundle v57, at the author's word of 09:43 HST, "yes", to this seat's question
"Shall I build v57 as set out, yes or no?"
(RULING_build_v57_with_the_headers_restated_to_2026-11-20.2_and_stage_the_run_2026-11-21; set out in
TEE_UP_the_build_run_before_the_upload_bundle_v57_with_headers_restated_to_the_revision_in_force_2026-11-21).
HEADER ONLY. Every line after this comment is the file as in bundle v56 (sha256
4304281bc1fb1346faaa8cf3eae0d0d2428571e948d082f8a824f645291b6d87), kept in Old/ as
Thm_APFB06_swap_world_pre-restating_v57_2026-11-21.lean. No declaration is changed. THE RESTATED BYTES ARE
NOT RELEASED.
Changed in this header: the revision named on the inputs_revision line, which was 2026-11-17.4, and this
entry. Nothing else.
WHAT HAPPENED: since revision 2026-11-17.4, which this header named until now, three revisions of
FOUNDATION_INPUTS were installed. Revision 2026-11-18.2, installed 2026-11-18 at 18:22 HST (sha256
290a59cad5591706d9b929fc98dde9f1b1215b4e40dc3d8eff790e8c59090cf0;
INSTALL_RECEIPT_FOUNDATION_INPUTS_2026-11-18.2_2026-11-18): the reading of B02's first sentence
(reading_20261114_list_complete) is scoped to what is recorded. It now reads: "The distinctions of a
context are complete for what is recorded: potential states that every distinction of the context reads
alike are recorded alike. They may differ in what they hold unrecorded. Then what can follow them tells
them apart, and no side does." It is a reading and not a commitment; B02's two sentences are unchanged.
Revision 2026-11-18.3, installed 2026-11-18 at 19:50 HST (sha256
95815d3a9ef01dd631bd52729a66a79531ff4590ed44d451be5882af20cc35b2;
INSTALL_RECEIPT_FOUNDATION_INPUTS_2026-11-18.3_and_GATE_POLICY_2026-11-18.inputs.2_2026-11-18): one block
was added that records where 13 cited files now resolve. No wording of a commitment changed. Revision
2026-11-20.2, installed 2026-11-20 at 12:36 HST (sha256
05c831bf6e786f168d9a9f0bb366b496388bd049960e9df3ca0acad8680d6252;
INSTALL_RECEIPT_FOUNDATION_INPUTS_2026-11-20.2_2026-11-20): B06 is reduced. After its first four sentences,
which are unchanged, it now reads: "To draw a distinction is to keep its record: each distinction has one
record, the same in every protocol, and a protocol draws the distinction exactly when it keeps that record.
Every record a protocol keeps is the record of some tested distinction or family of tested distinctions,
and is used for it. Every process pays epsilon for each record it keeps, and nothing else, where epsilon is
positive and fixed by the context. In every context some protocol draws no distinction. The occupant draws
exactly its family, and every part of that family is drawn alone by some protocol. A process that keeps no
record costs nothing. A process that keeps no record changes nothing that is recorded." Against revision
2026-11-18.3, six sentences are replaced by four and three are kept word for word. The six that are no
longer sentences of the inputs: "Each record carries a cost. What a set of records is sufficient for does
not depend on the protocol that keeps it. The occupant holds its distinctions with exactly the records they
need, and its bill is the cost of those records. The same is true of every part of it: any family of its
distinctions is held with exactly the records that family needs, at exactly their cost, and there is no
cheaper way to hold that family. Epsilon is the unit of the occupant: each record it keeps costs epsilon,
the floor of its context. Holding nothing costs nothing." B03 and B05 are retired as inputs and are kept in
the inputs file as derived statements. B07a and B07b each gain a note, note_20261120_protocol_binding;
their wording, scope and forms are unchanged. B01, B02 and B04 are unchanged. The commitments are six: B01,
B02, B04, B06, B07a, B07b. The gate policy on the build machine is policy_revision 2026-11-20.inputs.1
(sha256 5e9f3ec3cfa6c9a0a0b28549d13370c31ef78de38272ac6391efeac472f9a4aa) and requires this revision
(INSTALL_RECEIPT_GATE_POLICY_2026-11-20.inputs.1_2026-11-20).
HOW TO READ THE REST OF THIS HEADER: it named revision 2026-11-17.4 and is left as written, any earlier
entries "restated" below included. Where it names revision 2026-11-17.4 or an earlier one as the revision
in force, that is no longer so: the revision in force is 2026-11-20.2. Where it counts eight commitments,
eight inputs or eight declared forms: there are now six commitments. The declared forms of B03 and B05 are
unchanged and are now forms of derived statements. Where it calls B03 or B05 an input, or takes the
declared form of either as a hypothesis: the installed file says of B03, and in the same words of B05, "A
dependency on B03 is a dependency on its declared form, which is unchanged. From revision 2026-11-20.2 that
form is a derived statement and not an input. The derivation is a draft and is not certified: until it is
admitted through the gate, a node that consumes B03 is conditional on it. Resolve it before foundation
certification. Do not treat an old use of B03 as a use of B06." Where it speaks of B06 by a count of its
sentences or by their numbers, of the occupant statement, of the amended B06, or of a sentence of B06 as an
input: that is B06 as it stood at the revision the header then named, and B06 now reads as quoted above. A
statement here that takes one of the six replaced sentences as a premise stays true as a conditional;
whether it follows from the reduced B06 is NOT SAID by this entry (for what used them see
MEMO_pullbacks_passes119_and_120_what_used_the_dropped_sentences_and_one_world_for_all_eleven_2026-11-18 in
Notes). Where it says of a sentence that is in B06 as quoted above that it is proposed, a ruling carried as
a named hypothesis, NOT RULED, not installed or not an input: that is no longer so, for that sentence as
worded above and for no typing of it. Where it takes the reading of B02's first sentence as first recorded
(the distinctions of a context are complete: potential states that every distinction reads alike have the
same continuation profile; the physical objects of a context correspond one to one with the combinations of
sides of its distinctions) as a reading of the inputs: from revision 2026-11-18.2 the inputs do not assert
it. A statement that takes it as a premise stays true as a conditional. A supplied world in which it holds
is not excluded: the scoped reading adds no constraint. THE NEW SENTENCES OF B06 HAVE NO CERTIFIED LEAN
FORM: the forms the inputs file names for the reduced B06 are drafts of the two seats, marked
PROPOSED_NOT_CERTIFIED, and the Lean that derives the declared forms of B03 and B05 is a draft and is not
gated. NOTHING in this entry says that a theorem of this file follows from the inputs at revision
2026-11-20.2, or that a supplied world of this file is a world of them: each theorem stands as before, on
its named hypotheses or on its supplied world, and a supplied world that breaks a sentence of the inputs at
revision 2026-11-20.2 is not a world of the inputs at that revision, whatever this header says of an
earlier one. The gate policy says of the move to this revision: "immutable; dependency compatibility must
be established separately; no stale-basis waiver". This entry establishes no such compatibility. Proposed
revision 2026-11-20.3 (one further note on each of B07a and B07b) is NOT installed.
restated: 2026-11-17 20:13 HST, for bundle v52, at the author's word of 20:04 HST, "yes, thats perect", to this
seat's question "Shall I push those two now and then build v52 with them aboard?"
(RULING_push_the_two_then_build_v52_2026-11-17). HEADER ONLY. Every line after this comment is the file as
in bundle v51 (sha256 cb74bef3026a6ae304d21dbe4795175150f8db5265658a94eca56e2368b7f9b5), kept in Old/ as
Thm_APFB06_swap_world_pre-restating_v52_2026-11-17.lean. No declaration is changed. THE RESTATED BYTES ARE
NOT RELEASED.
Changed in this header: the revision named on the inputs_revision line, and this entry. Nothing else.
WHAT HAPPENED: FOUNDATION_INPUTS revision 2026-11-17.4 was installed on 2026-11-17 at 19:11 HST (sha256
641cb7725112dc24168d4b5342e8ab94feb8f7cb8803ded1fbb8ac1daf6316c8;
INSTALL_RECEIPT_FOUNDATION_INPUTS_2026-11-17.4_2026-11-17). Two sentences were added to the end of B06's
current wording: "A process that keeps no record changes nothing that is recorded. Every record a protocol
keeps is the record of some tested distinction or family of tested distinctions, and is used for it." It
changes no other wording and no declared Lean form. There is no installed revision 2026-11-17.3.
HOW TO READ THE REST OF THIS HEADER: it was written before that install and is left as written. Where it
says of either of those two sentences, or of what this seat's drafts call a record pinning its side, no
free gain, the still recorded side (HeldFamilyPinned, NoFreeGain, RecordedSideStill), or of the sentence
that every record a protocol keeps is some tested distinction's and used for it, that it is proposed, a
ruling carried as a named hypothesis, NOT RULED, not installed or not an input: that is no longer so. The
sentence is in the inputs at revision 2026-11-17.4. In the second sentence joint records count, by the
author's ruling of 18:25 HST; the typing the inputs file names for it, as proposed and NOT RULED, is the
family reading of pass 113 (EveryRecordIsNeededForATestedFamily), not the typings of passes 110, 111 or
112. NOTHING ELSE that this header calls a candidate, a reading, a ruling or a hypothesis was installed:
"every word of a context is a process", "a protocol maintains what its fragments keep" and the bill as a
sum are the author's rulings and not inputs; SufficientSupportIsUsed, the clause "within capacity", and
this seat's two conditions (the empty set of records is sufficient for no distinction; a positive lower
bound on the costs of single distinctions) are this seat's and not ruled. The new text has no declared Lean
form; definition nodes are the builder seat's. So everything here stands as before, each theorem on its
named hypotheses or on its supplied world, and the Lean forms this seat typed for the new text are
candidates: the inputs file marks their fidelity as proposed, not certified. A supplied world that breaks
either new sentence is not a world of the inputs at revision 2026-11-17.4, whatever this header says of an
earlier revision.
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: this file is Thm_APFB06_moving_world (2026-11-14) copied, with ONE line of the world
changed: the hold takes the state (a, r) to (r, a), where the moving world's takes it to (r, not a).
Three theorems about the quarter turn are replaced by three about the swap (turn_turn,
turn_fixes_both_true, turn_moves_a_state), and two proofs that named the turn-over are adjusted
(act_draws_nothing, act_surjective). Every other line of Lean is the moving world's, under the
namespace APFB06.SwapWorld. The name `turn` is kept so that the copy can be checked line by line.
Built for pass 107 (the author, 2026-11-17 09:35 HST: "Find the papers you need on Google Drive.
Proceed as indicated"), as the world against which the narrow floor typed by sides is tested. The
papers and codebank consulted are listed in Def_APFPaper1_NarrowFloorOnWords; this file adds no
physical statement.
consumes_inputs: none as hypotheses. Declared forms and readings are PROVED of supplied data, which
certifies nothing about the physical inputs.
the world (APFB06.SwapWorld): one context. Four raw states, one for each combination of sides of two
distinctions dA and dR. Two records, ra and rr. Three fragments: one that keeps ra, one that keeps rr,
and the hold. A record fragment runs where its distinction is held true and leaves the state. The hold
runs everywhere, keeps no record of its own, and takes the state (a, r) to (r, a). A word keeps the
records its fragments keep; its bill is the number of records kept; capacity 2; floor 1. Every word is
a protocol. The occupant sits where both distinctions are held true and carries both.
statement: everything proved of the moving world apart from its three theorems on the quarter turn
(eight_hold, meets_B02_r2, alignments_hold_relation, sum_holds, keep_holds, after_holds,
capacity_holds, empty_keeps_nothing, available, cost_eq_card, cost_subadditive,
prefix_restriction_holds, identity_holds, subword_heredity_holds, hold_acts, hold_admitted,
hold_erases_no_record, word_acts, nothing_drawn, still_held_after,
every_word_meets_the_hold_readings, hold_map), and:
(turn_turn) two holds bring every state back; (turn_fixes_both_true) the hold leaves the state where
both distinctions read true where it is; (turn_moves_a_state) it moves the state where dA reads true
and dR reads false.
not_claimed: that the readings are true or follow from the declared forms; that the hold is free in a
physical context; that this world is the physical one. Families still do not overlap in the records
they need. The occupant's alignment is one actual alignment. A2's protocol binding and the continuity
clause are not checked here. No lane. No claim that the transfer is forced, that the carrier gap is
closed or narrowed, or that Born is derived.
axioms: within propext, Classical.choice, Quot.sound. No sorry.
restated: 2026-11-17, for bundle v51. Written before the author's rulings of 11:41 HST (a record pins its
side), 13:09 HST (no free gain) and 16:03 HST (every record a protocol keeps is some tested distinction's
and used for it). Under the first two, on the recorded side a process that keeps no record changes
nothing that is recorded (passes 108 and 109). So what this header leaves open about holds on the
recorded side is settled there under his rulings. It is not settled by the inputs. Under the third, the
narrow floor typed by records is a theorem of B05 for protocols (pass 111). Nothing else in this header
is changed. Every byte after this comment is the byte of the file as first written.
-/
import Definitions.Def_APFPaper5_Worlds_TwoObjects
import Definitions.Def_APFB06_ExtensionalJoint
import Definitions.Def_APFB06_AlignmentHoldsRelation
import Definitions.Def_APF_B02_DeclaredInput_r2_proposed
import Definitions.Def_APFB02_HoldOnDistinctions
import Definitions.Def_APF_B04_DeclaredInput
import Definitions.Def_APF_B07a_DeclaredInput
import Definitions.Def_APF_B07b_DeclaredInput
import Theorems.Thm_APFPaper1_Source_needed_subset_kept
import Theorems.Thm_APFPaper1_Source_card_needed_le_bill
import Theorems.Thm_APFPaper1_Source_card_needed_le_familyCost
import Theorems.Thm_APFPaper1_Source_familyCost_eq_card_of_available
import Theorems.Thm_APFPaper1_Source_join_of_available
import Theorems.Thm_APFPaper1_Continuation_prefixMonotone_of_sum_and_keep
import Theorems.Thm_APFPaper1_Continuation_cont_prefix_of_sum_and_keep
import Theorems.Thm_APFPaper1_Continuation_cont_iff_contHereditary_of_sum_and_keep
import Theorems.Thm_APFPaper1_Continuation_subwordHeredity_of_subword_bill
import Theorems.Thm_APFPaper1_Continuation_subwordHeredity_of_sum_and_keeps
import Theorems.Thm_APFPaper1_Continuation_bill_nullWord_of_sum
import Theorems.Thm_APFPaper1_Continuation_cont_identity_of_sum
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
set_option autoImplicit false
open APFPaper1.Continuation
namespace APFB06.SwapWorld
/-- The records. -/
inductive Rc
| ra | rr
deriving DecidableEq
instance : Fintype Rc := ⟨{Rc.ra, Rc.rr}, fun r => by cases r <;> decide⟩
/-- The fragments: `some r` keeps the record r; `none` is the swap. -/
abbrev Frag : Unit → Unit → Type := fun _ _ => Option Rc
/-- Raw states: the side of dA, then the side of dR. -/
abbrev St : Type := Bool × Bool
abbrev Raw : Unit → Type := fun _ => St
abbrev Res : Unit → Type := fun _ => Finset Rc
/-- The swap of the pair: dA comes to read what dR read, and dR what dA read. Nothing is turned over.
(The name `turn` is kept from the moving world, of which this file is a copy with this one line changed.) -/
def turn : St → St := fun x => (x.2, x.1)
/-- Where a fragment can run: a record is kept where its distinction is held true; the hold runs
everywhere. -/
def runs : Option Rc → St → Prop
| some .ra, x => x.1 = true
| some .rr, x => x.2 = true
| none, _ => True
/-- What a fragment does to the state: keeping a record leaves it; the hold swaps its two sides. -/
def act : Option Rc → St → St
| some _, x => x
| none, x => turn x
def step : (g h : Unit) → Frag g h → Raw g → Raw h → Prop := fun _ _ f x y => runs f x ∧ y = act f x
/-- The fragments of a word, in execution order. -/
def labels : {g h : Unit} → Word Frag g h → List (Option Rc)
| _, _, Word.nil _ => []
| _, _, Word.cons f w => f :: labels w
/-- What a word keeps: the records its fragments keep. The hold keeps none of its own. -/
def kept (g : Unit) (w : WordFrom Frag g) : Finset Rc :=
Finset.univ.filter (fun r => some r ∈ labels w.2)
theorem card_kept_le (g : Unit) (w : WordFrom Frag g) : (kept g w).card ≤ 2 :=
le_trans (Finset.card_le_card (Finset.filter_subset _ _)) (by decide)
def resource : (g : Unit) → WordFrom Frag g → Res g := fun g w => kept g w
def calibration : (g : Unit) → Res g → NNReal := fun _ s => ((s.card : ℕ) : NNReal)
def C : Unit → NNReal := fun _ => 2
/-- Each record costs 1. -/
def recCost : Rc → NNReal := fun _ => 1
abbrev K : (g : Unit) → Raw g → WordFrom Frag g → Prop := Cont step resource calibration C
/-- Every word is within budget: there are only two records. -/
theorem in_budget (g : Unit) (w : WordFrom Frag g) : calibration g (resource g w) ≤ C g := by
show (((kept g w).card : ℕ) : NNReal) ≤ 2
have h := card_kept_le g w
exact_mod_cast h
/-! ### Words from lists of fragments -/
def wordOf : (g : Unit) → List (Option Rc) → Word Frag g g
| g, [] => Word.nil g
| g, f :: l => Word.cons (g := g) (h := g) (k := g) f (wordOf g l)
/-- The word with the listed fragments, in that order. -/
def wd (g : Unit) (l : List (Option Rc)) : WordFrom Frag g := ⟨g, wordOf g l⟩
theorem wA_in_iff (x : St) : K () x (wd () [some Rc.ra]) ↔ x.1 = true := by
constructor
· rintro ⟨⟨_, _, ⟨hr, _⟩, _⟩, _⟩
exact hr
· intro h
exact ⟨⟨x, x, ⟨h, rfl⟩, rfl⟩, in_budget _ _⟩
theorem wR_in_iff (x : St) : K () x (wd () [some Rc.rr]) ↔ x.2 = true := by
constructor
· rintro ⟨⟨_, _, ⟨hr, _⟩, _⟩, _⟩
exact hr
· intro h
exact ⟨⟨x, x, ⟨h, rfl⟩, rfl⟩, in_budget _ _⟩
/-- Different raw states have different continuation profiles. -/
theorem profile_inj (x y : St) (h : K () x = K () y) : x = y := by
have h1 : x.1 = true ↔ y.1 = true := by
rw [← wA_in_iff x, ← wA_in_iff y, h]
have h2 : x.2 = true ↔ y.2 = true := by
rw [← wR_in_iff x, ← wR_in_iff y, h]
exact Prod.ext (Bool.eq_iff_iff.mpr h1) (Bool.eq_iff_iff.mpr h2)
/-! ### The distinctions and what they need -/
def dA : St → Bool := fun x => x.1
def dR : St → Bool := fun x => x.2
/-- 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
cases g
rw [profile_inj x y h]
def dAd : Dist := ⟨dA, Or.inl rfl⟩
def dRd : Dist := ⟨dR, Or.inr rfl⟩
/-- The record a distinction needs: ra for dA, rr for dR. Read off the state where dA is held true and dR
false. -/
def recOf (d : Dist) : Rc := cond (d.val (true, false)) Rc.ra Rc.rr
/-- The records a distinction needs. -/
def fam (d : Dist) : Finset Rc := {recOf d}
/-! ### Protocols: every word -/
def protocols : (g : Unit) → Set (WordFrom Frag g) := fun _ => Set.univ
abbrev Pr (g : Unit) : Type := {p : WordFrom Frag g // p ∈ protocols g}
def pOf (l : List Rc) : Pr () := ⟨wd () (l.map some), Set.mem_univ _⟩
/-- The protocol keeping both records. -/
def pAR : Pr () := pOf [Rc.ra, Rc.rr]
def keptP (p : Pr ()) : Finset Rc := kept () p.val
def maint (g : Unit) (p : {p : WordFrom Frag g // p ∈ protocols g}) : Set Rc := ↑(kept g p.val)
def suff (g : Unit) (_ : {p : WordFrom Frag g // p ∈ protocols g}) (s : Set Rc)
(d : {d : St → Bool // Delta g d}) : Prop := recOf d ∈ s
def uses (g : Unit) (_ : {p : WordFrom Frag g // p ∈ protocols g})
(_ : {d : St → Bool // Delta g d}) (_ : Set Rc) : Prop := True
def wholeRes (g : Unit) (p : {p : WordFrom Frag g // p ∈ protocols g}) : Res g := resource g p.val
/-! ### The record model, and sentence 4: an exact protocol for every family -/
/-- The family cost of the ledger on this world. -/
noncomputable abbrev fcost (S : Finset Dist) : ℝ :=
APFPaper1.Source.familyCost (wholeRes ()) (calibration ()) (maint ()) (suff ()) (uses ()) S
/-! ### B06 on the physical domain, at the extensional joint class -/
noncomputable def heldD : Finset Dist := {dAd, dRd}
/-- The occupant's alignment: it sits where both are held true and carries dA and dR. -/
noncomputable def alignR : APFB06.OriginalAlignment (K ())
(APFB06.physicalDomain (K ()) (Delta ()) (hresp ())) where
carrier := APFB01.physicalClass (K ()) (true, true)
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. -/
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 g => WordFrom Frag g)
(P := fun g => {p : WordFrom Frag g // p ∈ protocols g}) (Record := fun _ => Rc)
K Delta maint suff uses ∧
APFB03.B03TaskCost (Context := Unit) (D := fun g => {d : St → Bool // Delta g d})
(P := fun g => {p : WordFrom Frag g // p ∈ protocols g}) (R := fun _ => Finset Rc)
(Record := fun _ => Rc) 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 : WordFrom Frag g // p ∈ protocols g}) (R := fun _ => Finset Rc)
(Record := fun _ => Rc) 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 ()) (true, true)) (fun _ _ => (1 : ℝ))
(fun _ => APFB01.physicalClass (K ()) (true, true)) ∧
APFB07b.BWUniqueMinimum (Interface := Unit)
(Configuration := fun _ => APFB01.PhysicalState (K ()))
(fun _ s => s = APFB01.physicalClass (K ()) (true, true)) (fun _ _ => (1 : ℝ))
/-! ### B02 with its second sentence -/
/-! ### The held-relation reading -/
/-! ### The record sentences, of every word -/
/-! ### What the sentences give here -/
/-! ### The hold: something moves -/
/-- The hold, as a word: the one fragment that keeps no record of its own. -/
def hold : WordFrom Frag () := wd () [none]
/-! ### The two hold readings, of every word -/
/-- What a list of fragments does to the state, in order. -/
def runAll : List (Option Rc) → St → St
| [], x => x
| f :: l, x => runAll l (act f x)
/-- How a distinction reads a state. -/
abbrev reads : Dist → St → Bool := fun d x => d.val x
end APFB06.SwapWorld
Source
Theorems.Thm_APFB06_swap_world; USB pullbacks v58 batch A, SHA-256 dd950821f5f59844ca5b0b23c91e5937a87965d5224e1ae1a34fc7c1fe610a4e. Theorems.Thm_APFB06_swap_world; USB pullbacks v58 batch A; SHA-256 dd950821f5f59844ca5b0b23c91e5937a87965d5224e1ae1a34fc7c1fe610a4e