Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Model vocabulary — Which supplied worlds meet the full occupant predicate

Definition
APFB06_worlds_against_the_occupant_statement_Vocabulary

by FiniteUniverse · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

apfapf-referencepullbacks-v46-2026-11

Data, predicates and immediate constructor helpers for this reviewed model. Its substantive results are published as separate proved theorem nodes.

OccupantStatementInFull combines unit-cost exact occupancy with parts and HoldingNothingFree. The named models are checked against that explicit conjunction; satisfying examples retain zero, positive and negative coupling residues. These are model-specific predicates at unchanged inputs revision 2026-11-14.1, not certification of a revised physical foundation.

Supplied data and hypotheses

  • Every parameter and hypothesis in the exact source declaration remains exposed; no author input is adopted.

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
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
import Definitions.Def_APFB06_held_relation_worlds_Vocabulary_r2
import Theorems.Thm_APFB06_BridgeWorld_no_held_relation_r2
import Theorems.Thm_APFB06_RelationWorldR2_servesAll
import Theorems.Thm_APFB06_RelationWorldR2_bill_pF
import Theorems.Thm_APFB06_RelationWorldR2_bill_ge_one
import Theorems.Thm_APFB06_RelationWorldR2_one_le_cost
import Theorems.Thm_APFB06_RelationWorldR2_cost_le_two
import Theorems.Thm_APFB06_RelationWorldR2_world_B06
import Theorems.Thm_APFB06_RelationWorldR2_eight_hold
import Theorems.Thm_APFB06_RelationWorldR2_alignment_holds_relation
import Theorems.Thm_APFB06_RelationWorldR2_alignments_hold_relation
import Definitions.Def_APFPaper5_K1_SharedCost
import Mathlib.Tactic.Ring
import Definitions.Def_APFPaper5_K1_bill_not_a_sum_world_Vocabulary
import Theorems.Thm_APFB06_OverheadWorld_one_le_cost
import Theorems.Thm_APFB06_OverheadWorld_cost_le_three
import Theorems.Thm_APFB06_OverheadWorld_cost_le_one_of_allA
import Theorems.Thm_APFB06_OverheadWorld_cost_le_one_of_allB
import Theorems.Thm_APFB06_OverheadWorld_three_le_cost
import Theorems.Thm_APFB06_OverheadWorld_floor_holds
import Theorems.Thm_APFB06_OverheadWorld_eight_hold
import Theorems.Thm_APFB06_OverheadWorld_keeps_iff_mem_kept
import Theorems.Thm_APFB06_OverheadWorld_maint_eq_kept
import Theorems.Thm_APFB06_OverheadWorld_no_record_costs
import Theorems.Thm_APFB06_OverheadWorld_meets_B02_r2
import Theorems.Thm_APFB06_OverheadWorld_ra_needed
import Theorems.Thm_APFB06_OverheadWorld_rb_needed
import Theorems.Thm_APFB06_OverheadWorld_ra_not_needed
import Theorems.Thm_APFB06_OverheadWorld_rb_not_needed
import Theorems.Thm_APFB06_OverheadWorld_pair_counted_first_typed
import Theorems.Thm_APFB06_OverheadWorld_pair_is_counted_leastBill
import Theorems.Thm_APFB06_OverheadWorld_world_meets_eight_without_a_book_and_counted_pair_meets_K1
import Theorems.Thm_APFPaper1_Source_familyCost_union_le_of_join
import Theorems.Thm_APFPaper1_Source_familyCost_union_le_of_join_within_capacity
import Theorems.Thm_APFPaper5_K1_sharedCost_familyCost_nonneg_of_join
import Theorems.Thm_APFPaper1_Source_sum_needed_le_bill
import Theorems.Thm_APFPaper1_Source_familyCost_eq_sum_of_available
import Theorems.Thm_APFPaper1_Source_supportNovel_of_private_record
import Theorems.Thm_APFPaper1_Source_supportNovel_of_private_record_count
import Theorems.Thm_APFPaper1_Source_marginal_ge_of_private_record
import Theorems.Thm_APFPaper1_Source_each_private_excludes_riding
import Theorems.Thm_APFPaper1_Source_supportNovel_of_each_private
import Theorems.Thm_APFPaper1_Source_marginal_zero_of_no_own_record
import Theorems.Thm_APFPaper1_Source_needs_own_record_of_supportNovel
import Theorems.Thm_APFPaper5_K1_sourceNeeds_mono
import Theorems.Thm_APFPaper5_K1_source_own_record_of_alone_not_rest
import Theorems.Thm_APFPaper5_K1_source_party_score_meets_K1
import Theorems.Thm_APFPaper5_K1_source_counted_family_meets_K1
import Theorems.Thm_APFPaper5_K1_leastBill_nonneg
import Theorems.Thm_APFPaper5_K1_leastBill_le_bill
import Theorems.Thm_APFPaper5_K1_le_leastBill
import Theorems.Thm_APFPaper5_K1_leastBill_pos_iff
import Theorems.Thm_APFPaper5_K1_source_counted_family_meets_K1_leastBill
import Theorems.Thm_APFPaper5_K1_familyNeeds_eq_sourceNeeds
import Theorems.Thm_APFPaper5_K1_cost_le_leastBill
import Theorems.Thm_APFPaper5_K1_leastBill_eq_cost_of_kept_alone
import Theorems.Thm_APFPaper5_K1_ledgerPartyScore_eq_source
import Theorems.Thm_APFPaper5_K1_counted_iff_sourceCounted
import Theorems.Thm_APFPaper5_K1_sourceCounted_leastBill_of_counted
import Theorems.Thm_APFPaper5_K1_PaidPair_source_counted_pair_meets_K1
import Definitions.Def_APFB06_subadditivity_worlds_Vocabulary_r2
import Theorems.Thm_APFB06_RelationWorldR2_cost_subadditive
import Theorems.Thm_APFB06_ResidueWorldR2_servesAll
import Theorems.Thm_APFB06_ResidueWorldR2_bill_pA
import Theorems.Thm_APFB06_ResidueWorldR2_bill_pB
import Theorems.Thm_APFB06_ResidueWorldR2_bill_pAB
import Theorems.Thm_APFB06_ResidueWorldR2_bill_ge_one
import Theorems.Thm_APFB06_ResidueWorldR2_bill_of_both
import Theorems.Thm_APFB06_ResidueWorldR2_servesA
import Theorems.Thm_APFB06_ResidueWorldR2_servesB
import Theorems.Thm_APFB06_ResidueWorldR2_keeps_ra_of_serves
import Theorems.Thm_APFB06_ResidueWorldR2_keeps_rb_of_serves
import Theorems.Thm_APFB06_ResidueWorldR2_exists_false_of_not_all_true
import Theorems.Thm_APFB06_ResidueWorldR2_exists_true_of_not_all_false
import Theorems.Thm_APFB06_ResidueWorldR2_floor_holds
import Theorems.Thm_APFB06_ResidueWorldR2_eight_hold
import Theorems.Thm_APFB06_ResidueWorldR2_dAd_b
import Theorems.Thm_APFB06_ResidueWorldR2_dBd_b
import Theorems.Thm_APFB06_ResidueWorldR2_alignment_holds_relation
import Theorems.Thm_APFB06_ResidueWorldR2_keeps_iff_mem_kept
import Theorems.Thm_APFB06_ResidueWorldR2_bill_eq_number_kept
import Theorems.Thm_APFB06_ResidueWorldR2_cost_pair
import Theorems.Thm_APFB06_ResidueWorldR2_not_subadditive
import Theorems.Thm_APFB06_ResidueWorldR2_sharedCost_eq
import Theorems.Thm_APFB06_ResidueWorldR2_no_join
import Theorems.Thm_APFPaper1_Source_card_of_union_needs
import Theorems.Thm_APFPaper1_Source_needs_union_contains
import Theorems.Thm_APFPaper1_Source_residue_is_a_count
import Theorems.Thm_APFPaper1_Source_sharedCost_is_a_count
import Theorems.Thm_APFPaper1_Source_cost_superadditive_of_no_common_record
import Theorems.Thm_APFPaper1_Source_cost_subadditive_of_no_joint_record
import Theorems.Thm_APFPaper1_Source_cost_additive_of_neither
import Theorems.Thm_APFPaper1_Source_residue_pos_iff
import Theorems.Thm_APFPaper1_Source_residue_zero_iff
import Theorems.Thm_APFPaper1_Source_residue_neg_iff
import Definitions.Def_APFB06_moving_world_Vocabulary
import Theorems.Thm_APFB06_MovingWorld_available
import Theorems.Thm_APFB06_MovingWorld_cost_eq_card
import Theorems.Thm_APFB06_MovingWorld_cost_subadditive
import Theorems.Thm_APFB06_MovingWorld_eight_hold
import Theorems.Thm_APFB06_MovingWorld_meets_B02_r2
import Theorems.Thm_APFB06_MovingWorld_alignments_hold_relation
import Theorems.Thm_APFB06_MovingWorld_sum_holds
import Theorems.Thm_APFB06_MovingWorld_keep_holds
import Theorems.Thm_APFB06_MovingWorld_after_holds
import Theorems.Thm_APFB06_MovingWorld_capacity_holds
import Theorems.Thm_APFB06_MovingWorld_empty_keeps_nothing
import Theorems.Thm_APFB06_MovingWorld_prefix_restriction_holds
import Theorems.Thm_APFB06_MovingWorld_identity_holds
import Theorems.Thm_APFB06_MovingWorld_subword_heredity_holds
import Theorems.Thm_APFB06_MovingWorld_hold_acts
import Theorems.Thm_APFB06_MovingWorld_hold_admitted
import Theorems.Thm_APFB06_MovingWorld_turn_ne
import Theorems.Thm_APFB06_MovingWorld_turn_turn_ne
import Theorems.Thm_APFB06_MovingWorld_turn_one_opposition
import Theorems.Thm_APFB06_MovingWorld_hold_erases_no_record
import Theorems.Thm_APFB06_MovingWorld_word_acts
import Theorems.Thm_APFB06_MovingWorld_nothing_drawn
import Theorems.Thm_APFB06_MovingWorld_still_held_after
import Theorems.Thm_APFB06_MovingWorld_every_word_meets_the_hold_readings
import Definitions.Def_APFB06_shared_world_Vocabulary
import Theorems.Thm_APFB06_SharedWorld_cost_single
import Theorems.Thm_APFB06_SharedWorld_cost_pair
import Theorems.Thm_APFB06_SharedWorld_shared_cost_pair
import Definitions.Def_APFB06_superadditivity_worlds_Vocabulary
import Theorems.Thm_APFB06_BusWorld_floor_holds
import Theorems.Thm_APFB06_BusWorld_eight_hold
import Theorems.Thm_APFB06_BusWorld_alignments_hold_relation
import Theorems.Thm_APFB06_BusWorld_cost_A
import Theorems.Thm_APFB06_BusWorld_cost_B
import Theorems.Thm_APFB06_BusWorld_cost_AB
import Theorems.Thm_APFB06_BusWorld_cost_whole
import Theorems.Thm_APFB06_BusWorld_sharedCost_parts
import Theorems.Thm_APFB06_BusWorld_residue_eq
import Theorems.Thm_APFB06_BusWorld_whole_gt_parts_iff
import Theorems.Thm_APFB06_BusWorld_whole_eq_parts_iff
import Theorems.Thm_APFB06_BusWorld_whole_lt_parts_iff
import Theorems.Thm_APFB06_BusWorld_bill_eq_records_plus_shared
import Definitions.Def_APFPaper1_familyCost_additivity_and_two_worlds_Vocabulary
import Theorems.Thm_APFPaper1_Source_familyCost_union_ge_of_split
import Theorems.Thm_APFPaper1_Source_familyCost_union_eq_of_join_and_split
import Theorems.Thm_APFPaper1_Source_familyCost_union_eq_of_disjoint_needs
import Theorems.Thm_APFB06_OverheadWorld_cost_single_A
import Theorems.Thm_APFB06_OverheadWorld_cost_single_B
import Theorems.Thm_APFB06_OverheadWorld_cost_pair
import Theorems.Thm_APFB06_OverheadWorld_no_shared_no_joint_record
import Theorems.Thm_APFB06_OverheadWorld_pair_costs_more
import Theorems.Thm_APFB06_OverheadWorld_eight_hold_no_common_record_and_cost_above_the_sum
import Theorems.Thm_APFB06_DiscountWorld_floor_holds
import Theorems.Thm_APFB06_DiscountWorld_eight_hold
import Theorems.Thm_APFB06_DiscountWorld_meets_B02_r2
import Theorems.Thm_APFB06_DiscountWorld_cost_single_A
import Theorems.Thm_APFB06_DiscountWorld_cost_single_B
import Theorems.Thm_APFB06_DiscountWorld_cost_pair
import Theorems.Thm_APFB06_DiscountWorld_no_shared_no_joint_record
import Theorems.Thm_APFB06_DiscountWorld_pair_costs_less
import Theorems.Thm_APFB06_DiscountWorld_eight_hold_no_common_record_and_cost_below_the_sum
import Definitions.Def_APFPaper1_Cont_load_worlds_Vocabulary
import Theorems.Thm_APFPaper1_LoadWorld_eight_hold
import Theorems.Thm_APFPaper1_LoadWorld_meets_B02_r2
import Theorems.Thm_APFPaper1_LoadWorld_identity_holds
import Theorems.Thm_APFPaper1_LoadWorld_spike_prefix_restriction_fails
import Theorems.Thm_APFPaper1_LoadWorld_spike_resource_not_monotone
import Theorems.Thm_APFPaper1_LoadWorld_spike_not_prefixMonotone
import Theorems.Thm_APFPaper1_LoadWorld_spike_whole_ne_hereditary
import Theorems.Thm_APFPaper1_LoadWorld_spike_subword_heredity_fails
import Theorems.Thm_APFPaper1_LoadWorld_warm_prefixMonotone
import Theorems.Thm_APFPaper1_LoadWorld_warm_prefix_restriction_holds
import Theorems.Thm_APFPaper1_LoadWorld_warm_subword_heredity_fails
import Theorems.Thm_APFPaper5_Worlds_eight_hold_of_two_objects
import Theorems.Thm_APFPaper5_Worlds_classes_differ
import Theorems.Thm_APFPaper5_Worlds_contU_differ
import Theorems.Thm_APFPaper5_Worlds_world_U_eight_hold
import Theorems.Thm_APFPaper5_Worlds_world_U_hold_not_undone
import Theorems.Thm_APFPaper5_Worlds_world_S_eight_hold
import Theorems.Thm_APFPaper5_Worlds_world_S_nothing_moves
import Definitions.Def_APFB06_residue_world_with_a_do_nothing_protocol_Vocabulary
import Theorems.Thm_APFB06_ResidueNullWorld_servesAll
import Theorems.Thm_APFB06_ResidueNullWorld_bill_of_both
import Theorems.Thm_APFB06_ResidueNullWorld_cost_le_three
import Theorems.Thm_APFB06_ResidueNullWorld_servesA
import Theorems.Thm_APFB06_ResidueNullWorld_servesB
import Theorems.Thm_APFB06_ResidueNullWorld_cost_le_one_of_allA
import Theorems.Thm_APFB06_ResidueNullWorld_cost_le_one_of_allB
import Theorems.Thm_APFB06_ResidueNullWorld_keeps_ra_of_serves
import Theorems.Thm_APFB06_ResidueNullWorld_keeps_rb_of_serves
import Theorems.Thm_APFB06_ResidueNullWorld_holdingNothingFree
import Theorems.Thm_APFB06_ResidueNullWorld_cost_empty
import Theorems.Thm_APFB06_ResidueNullWorld_floor_holds
import Theorems.Thm_APFB06_ResidueNullWorld_eight_hold
import Theorems.Thm_APFB06_ResidueNullWorld_meets_B02_r2
import Theorems.Thm_APFB06_ResidueNullWorld_ra_needed
import Theorems.Thm_APFB06_ResidueNullWorld_rb_needed
import Theorems.Thm_APFB06_ResidueNullWorld_rj_needed
import Theorems.Thm_APFB06_ResidueNullWorld_rj_is_joint
import Theorems.Thm_APFB06_ResidueNullWorld_every_family_occupied
import Theorems.Thm_APFB06_ResidueNullWorld_occupant_holds_with_parts_at_unit
import Theorems.Thm_APFB06_ResidueNullWorld_cost_single_A
import Theorems.Thm_APFB06_ResidueNullWorld_cost_single_B
import Theorems.Thm_APFB06_ResidueNullWorld_cost_pair
import Theorems.Thm_APFB06_ResidueNullWorld_whole_costs_more_than_its_parts
import Theorems.Thm_APFB06_ResidueNullWorld_empty_family_one_cheapest_protocol






















/-
APF Foundation Ledger — theorem node DRAFT (Claude seat, session EthanBrooke-01WrrBvv, 2026-11-14; not
 gated, not reviewed, not released, not built in the ledger repo)
name: APFB06_moving_world
title: One supplied world in which a hold moves every state, and which still meets the eight declared forms, B02 with its second sentence, the joint class, the held-relation reading, the four record sentences and the two hold readings
inputs_revision: 2026-11-14.1 (the eight declared forms as encoded, with B02 also in the builder seat's
 proposed form Def_APF_B02_DeclaredInput_r2_proposed)
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: as for Thm_APFB06_readings_world, of which this is the moving version. The hold readings: the
 author, 2026-11-14 11:33 HST (RULING_hold_readings_2026-11-14, seat 01WrrBvu); Def_APFB02_HoldOnDistinctions
 (seat 01WrrBvu, bundle v58). The quarter turn of one pair is the builder seat's object for "something
 moves, one opposition at a time, not back in two steps" (NOTE_derivation_pass_43_2026-11-14). The author,
 2026-11-14 15:43 HST: "Proceed", on this seat's proposal to build the moving hold. No paper or codebank
 file was reopened: the pass 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.MovingWorld): the readings world with one more fragment, the hold. 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, not a): dA comes to read what dR read, and dR what dA read, turned over. 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 readings world (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), and:
 (hold_acts, hold_admitted) the hold is a continuation from every state and takes it to its quarter turn;
 (turn_ne) it moves every state; (turn_one_opposition) it changes the side of exactly one distinction;
 (turn_turn_ne) two holds do not bring a state back; (hold_erases_no_record) it erases no record;
 (word_acts, nothing_drawn, still_held_after, every_word_meets_the_hold_readings) every word that runs
 induces a map on states that draws nothing and after which every combination of sides is still held.
reading: the adopted readings are consistent with something moving. The readings world met the hold
 readings only because nothing moved in it; here a hold moves every state and they still hold.
not_claimed: that the readings are true or follow from the declared forms; that the hold is free in a
 physical context (here it bills nothing because it keeps no record of its own); which words are holds;
 that a hold of the builder seat's count route is admitted at an interface with more than two distinctions.
 Families still do not overlap in the records they need. The occupant's alignment is one actual alignment
 and is not followed along the hold. A2's protocol binding and the continuity clause are not checked here.
-/























set_option autoImplicit false
open APFPaper1.Continuation

namespace APFB06.MovingWorld
























theorem mem_kept (g : Unit) (w : WordFrom Frag g) (r : Rc) :
    r ∈ kept g w ↔ some r ∈ labels w.2 := by
  show r ∈ Finset.univ.filter (fun r => some r ∈ labels w.2) ↔ _
  rw [Finset.mem_filter]
  exact ⟨fun h => h.2, fun h => ⟨Finset.mem_univ _, h⟩⟩













/-! ### Words from lists of fragments -/



theorem labels_wordOf (g : Unit) (l : List (Option Rc)) : labels (wordOf g l) = l := by
  induction l with
  | nil => rfl
  | cons f l ih =>
      show f :: labels (wordOf g l) = f :: l
      rw [ih]



theorem labels_wd (g : Unit) (l : List (Option Rc)) : labels (wd g l).2 = l := labels_wordOf g l

/-- The word made of the fragments for the listed records keeps exactly those records. -/
theorem kept_wd (g : Unit) (l : List Rc) : kept g (wd g (l.map some)) = l.toFinset := by
  ext r
  rw [mem_kept, labels_wd, List.mem_toFinset]
  constructor
  · intro h
    obtain ⟨a, ha, hEq⟩ := List.mem_map.mp h
    rw [← Option.some.inj hEq]
    exact ha
  · intro h
    exact List.mem_map.mpr ⟨r, h, rfl⟩









/-! ### The distinctions and what they need -/





















/-! ### Protocols: every word -/






















/-! ### The record model, and sentence 4: an exact protocol for every family -/



















/-! ### B06 on the physical domain, at the extensional joint class -/















/-! ### 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 two hold readings, of every word -/



















end APFB06.MovingWorld


/-
APF Foundation Ledger — theorem node DRAFT (Claude seat, session EthanBrooke-01WrrBvv, 2026-11-14; not
 gated, not reviewed, not released, not built in the ledger repo)
name: APFB06_shared_world
title: One supplied world in which two families share a record and a hold moves every state, and which still meets the eight declared forms, B02 with its second sentence, the joint class, the held-relation reading, the four record sentences and the two hold readings
inputs_revision: 2026-11-14.1 (the eight declared forms as encoded, with B02 also in the builder seat's
 proposed form Def_APF_B02_DeclaredInput_r2_proposed)
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: as for Thm_APFB06_moving_world, of which this is the version with a shared record. The author,
 2026-11-13 17:30 HST, to the builder seat: "Can families overlap? I think so....". The author, 2026-11-14
 15:43 HST: "Proceed", on this seat's proposal to build the two thin spots of pass 14. No paper or codebank
 file was reopened: the pass 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.SharedWorld): the moving world with a third record, rs, that both distinctions need. One
 context. Four raw states, two distinctions dA and dR. Records ra, rr, rs. dA needs ra and rs; dR needs rr
 and rs. Four fragments: one for each record, and the hold. The fragment for ra runs where dA is held true,
 the one for rr where dR is held true, the one for rs anywhere; each leaves the state. The hold is the
 quarter turn of the pair and keeps no record of its own. A word keeps the records its fragments keep; its
 bill is the number of records kept; capacity 3; 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, with the same theorem names, and: (cost_single) each
 distinction alone costs 2; (cost_pair) the two together cost 3; (shared_cost_pair) so the two one-member
 families share a cost of 1, the cost of the record both need.
reading: the adopted readings are consistent with families that overlap in what they need. Here the shared
 cost equals the floor: the pair costs less than the sum of its parts, and exactly one part plus the floor.
not_claimed: that the readings are true or follow from the declared forms; that physical families overlap;
 anything about how much they share. "The parts share less than the floor" is false of this world (they
 share exactly the floor) and stays a named hypothesis. The hold is free here; the occupant is not followed
 along the hold; A2's protocol binding and the continuity clause are not checked.
-/























set_option autoImplicit false
open APFPaper1.Continuation

namespace APFB06.SharedWorld
























theorem mem_kept (g : Unit) (w : WordFrom Frag g) (r : Rc) :
    r ∈ kept g w ↔ some r ∈ labels w.2 := by
  show r ∈ Finset.univ.filter (fun r => some r ∈ labels w.2) ↔ _
  rw [Finset.mem_filter]
  exact ⟨fun h => h.2, fun h => ⟨Finset.mem_univ _, h⟩⟩













/-! ### Words from lists of fragments -/



theorem labels_wordOf (g : Unit) (l : List (Option Rc)) : labels (wordOf g l) = l := by
  induction l with
  | nil => rfl
  | cons f l ih =>
      show f :: labels (wordOf g l) = f :: l
      rw [ih]



theorem labels_wd (g : Unit) (l : List (Option Rc)) : labels (wd g l).2 = l := labels_wordOf g l

/-- The word made of the fragments for the listed records keeps exactly those records. -/
theorem kept_wd (g : Unit) (l : List Rc) : kept g (wd g (l.map some)) = l.toFinset := by
  ext r
  rw [mem_kept, labels_wd, List.mem_toFinset]
  constructor
  · intro h
    obtain ⟨a, ha, hEq⟩ := List.mem_map.mp h
    rw [← Option.some.inj hEq]
    exact ha
  · intro h
    exact List.mem_map.mpr ⟨r, h, rfl⟩









/-! ### The distinctions and what they need -/























/-! ### Protocols: every word -/






















/-! ### The record model, and sentence 4: an exact protocol for every family -/























/-! ### B06 on the physical domain, at the extensional joint class -/















/-! ### 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 two hold readings, of every word -/



















end APFB06.SharedWorld



































































































































































































































/-
APF Foundation Ledger — theorem node DRAFT (Claude seat, session EthanBrooke-01WrrBvv, 2026-11-14; not
 gated, not reviewed, not released, not built in the ledger repo)
name: APFB06_moving_world
title: One supplied world in which a hold moves every state, and which still meets the eight declared forms, B02 with its second sentence, the joint class, the held-relation reading, the four record sentences and the two hold readings
inputs_revision: 2026-11-14.1 (the eight declared forms as encoded, with B02 also in the builder seat's
 proposed form Def_APF_B02_DeclaredInput_r2_proposed)
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: as for Thm_APFB06_readings_world, of which this is the moving version. The hold readings: the
 author, 2026-11-14 11:33 HST (RULING_hold_readings_2026-11-14, seat 01WrrBvu); Def_APFB02_HoldOnDistinctions
 (seat 01WrrBvu, bundle v58). The quarter turn of one pair is the builder seat's object for "something
 moves, one opposition at a time, not back in two steps" (NOTE_derivation_pass_43_2026-11-14). The author,
 2026-11-14 15:43 HST: "Proceed", on this seat's proposal to build the moving hold. No paper or codebank
 file was reopened: the pass 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.MovingWorld): the readings world with one more fragment, the hold. 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, not a): dA comes to read what dR read, and dR what dA read, turned over. 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 readings world (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), and:
 (hold_acts, hold_admitted) the hold is a continuation from every state and takes it to its quarter turn;
 (turn_ne) it moves every state; (turn_one_opposition) it changes the side of exactly one distinction;
 (turn_turn_ne) two holds do not bring a state back; (hold_erases_no_record) it erases no record;
 (word_acts, nothing_drawn, still_held_after, every_word_meets_the_hold_readings) every word that runs
 induces a map on states that draws nothing and after which every combination of sides is still held.
reading: the adopted readings are consistent with something moving. The readings world met the hold
 readings only because nothing moved in it; here a hold moves every state and they still hold.
not_claimed: that the readings are true or follow from the declared forms; that the hold is free in a
 physical context (here it bills nothing because it keeps no record of its own); which words are holds;
 that a hold of the builder seat's count route is admitted at an interface with more than two distinctions.
 Families still do not overlap in the records they need. The occupant's alignment is one actual alignment
 and is not followed along the hold. A2's protocol binding and the continuity clause are not checked here.
-/























set_option autoImplicit false
open APFPaper1.Continuation

namespace APFB06.MovingWorld






































/-! ### Words from lists of fragments -/



















/-! ### The distinctions and what they need -/





















/-! ### Protocols: every word -/
















theorem keptP_pOf (l : List Rc) : keptP (pOf l) = l.toFinset := kept_wd () l





/-! ### The record model, and sentence 4: an exact protocol for every family -/

theorem hbill (p : Pr ()) :
    ((calibration () (wholeRes () p) : NNReal) : ℝ) = ((keptP p).card : ℝ) :=
  NNReal.coe_natCast _

theorem hkept (p : Pr ()) : maint () p = (↑(keptP p) : Set Rc) := rfl

theorem hneed (p : Pr ()) (sigma : Set Rc) (d : Dist) (h : suff () p sigma d) :
    (↑(fam d) : Set Rc) ⊆ sigma := by
  intro r hr
  have hr' : r = recOf d := Finset.mem_singleton.mp (Finset.mem_coe.mp hr)
  rw [hr']
  exact h













/-! ### B06 on the physical domain, at the extensional joint class -/















/-! ### 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 two hold readings, of every word -/



















end APFB06.MovingWorld


/-
APF Foundation Ledger — theorem node DRAFT (Claude seat, session EthanBrooke-01WrrBvv, 2026-11-14; not
 gated, not reviewed, not released, not built in the ledger repo)
name: APFB06_readings_world
title: One supplied world meets the eight declared forms, B02 with its second sentence, B06 at the extensional joint class, the held-relation reading, and the four record sentences adopted on 2026-11-14, all together
inputs_revision: 2026-11-14.1 (the eight declared forms as encoded, with B02 also in the builder seat's
 proposed form Def_APF_B02_DeclaredInput_r2_proposed)
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: the author's rulings: joint class (2026-11-13 15:54 HST), held relation (2026-11-13 17:23 HST), B02's
 second sentence (2026-11-14, inputs revision 2026-11-14.1), and "Proceed as proposed" (2026-11-14 13:00
 HST), read in RULING_calls_2026-11-14 as adopting: no step erases a record; the bill of a word is the sum of
 the costs of the records it keeps; what a word keeps on its own it keeps when run after another fragment;
 for every family some admitted protocol keeps exactly the records the family needs. The author,
 2026-11-14 15:12 HST: "Build the world". Pattern: Thm_APFB06_held_relation_worlds (the relation world) and
 Thm_APFPaper1_Cont_load_worlds. Paper 1 Supplement v9.28 and the codebank were consulted for passes 8, 11
 and 12, on which this rests; nothing new was looked up for this pass, which 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.ReadingsWorld): one context. Four raw states, one for each combination of sides of two
 distinctions dA and dR. Two records, ra and rr; each is also the one fragment that keeps it. A fragment
 runs where its distinction is held true, and a step leaves the state where it was. The continuation class
 is the whole-word class. A word keeps the records of its fragments; its bill is the number of records it
 keeps (each costs 1); capacity 2; floor 1. Every word is a protocol. dA needs ra, dR needs rr. The occupant
 sits where both are held true and carries both.
statement: (eight_hold) all eight declared forms hold, B06 at the extensional joint class on the physical
 domain; (meets_B02_r2) B02 holds with its second sentence; (alignments_hold_relation) every actual joint
 alignment holds a relation; (sum_holds, keep_holds, after_holds, capacity_holds, empty_keeps_nothing) the
 record sentences hold of every word; (available) every family has a protocol keeping exactly the records
 it needs. So, by the theorems of passes 8, 12 and 13: (cost_eq_card) family cost is the number of records
 needed; (cost_subadditive); (prefix_restriction_holds) C3; (identity_holds) C1; (subword_heredity_holds)
 W-her. (word_fixes_state) every executing word ends where it began.
reading: the adopted readings of this seat do not clash with one another or with the eight declared forms.
 The instance is not thin in the way the bridge world was: words here draw records, bills take the values
 0, 1 and 2, and the relation costs its own floor.
not_claimed: that the readings are true; that they follow from the declared forms (they do not: the spike,
 warm-up and residue worlds); that this world is a physical context. The builder seat's two hold
 readings are checked in Thm_APFB06_readings_world_holds; in this world every word fixes the state, which
 is the case where nothing moves. A2's protocol binding and the continuity clause are not checked here.
-/






















set_option autoImplicit false
open APFPaper1.Continuation

namespace APFB06.ReadingsWorld


























/-! ### Execution -/







/-! ### Words from lists of records -/























/-! ### The distinctions and what they need -/





















/-! ### Protocols: every word -/






















/-! ### The record model, and sentence 4: an exact protocol for every family -/













theorem cost_single (d : Dist) : fcost {d} = 1 := by
  rw [cost_eq_card, Finset.singleton_biUnion]
  show ((({recOf d} : Finset Rc).card : ℕ) : ℝ) = 1
  rw [Finset.card_singleton]
  norm_num





/-! ### B06 on the physical domain, at the extensional joint class -/















/-! ### B02 with its second sentence -/





/-! ### The held-relation reading -/





/-! ### The record sentences, of every word -/













/-! ### What the sentences give here -/







end APFB06.ReadingsWorld


/-
APF Foundation Ledger — theorem node DRAFT (Claude seat, session EthanBrooke-01WrrBvv, 2026-11-14; not
 gated, not reviewed, not released, not built in the ledger repo)
name: APFB06_shared_world
title: One supplied world in which two families share a record and a hold moves every state, and which still meets the eight declared forms, B02 with its second sentence, the joint class, the held-relation reading, the four record sentences and the two hold readings
inputs_revision: 2026-11-14.1 (the eight declared forms as encoded, with B02 also in the builder seat's
 proposed form Def_APF_B02_DeclaredInput_r2_proposed)
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: as for Thm_APFB06_moving_world, of which this is the version with a shared record. The author,
 2026-11-13 17:30 HST, to the builder seat: "Can families overlap? I think so....". The author, 2026-11-14
 15:43 HST: "Proceed", on this seat's proposal to build the two thin spots of pass 14. No paper or codebank
 file was reopened: the pass 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.SharedWorld): the moving world with a third record, rs, that both distinctions need. One
 context. Four raw states, two distinctions dA and dR. Records ra, rr, rs. dA needs ra and rs; dR needs rr
 and rs. Four fragments: one for each record, and the hold. The fragment for ra runs where dA is held true,
 the one for rr where dR is held true, the one for rs anywhere; each leaves the state. The hold is the
 quarter turn of the pair and keeps no record of its own. A word keeps the records its fragments keep; its
 bill is the number of records kept; capacity 3; 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, with the same theorem names, and: (cost_single) each
 distinction alone costs 2; (cost_pair) the two together cost 3; (shared_cost_pair) so the two one-member
 families share a cost of 1, the cost of the record both need.
reading: the adopted readings are consistent with families that overlap in what they need. Here the shared
 cost equals the floor: the pair costs less than the sum of its parts, and exactly one part plus the floor.
not_claimed: that the readings are true or follow from the declared forms; that physical families overlap;
 anything about how much they share. "The parts share less than the floor" is false of this world (they
 share exactly the floor) and stays a named hypothesis. The hold is free here; the occupant is not followed
 along the hold; A2's protocol binding and the continuity clause are not checked.
-/























set_option autoImplicit false
open APFPaper1.Continuation

namespace APFB06.SharedWorld






































/-! ### Words from lists of fragments -/















/-- Where both distinctions are held true, the word keeping both records is a continuation. -/
theorem wAR_in : K () (true, true) (wd () [some Rc.ra, some Rc.rr, some Rc.rs]) :=
  ⟨⟨(true, true), (true, true), ⟨rfl, rfl⟩, (true, true), ⟨rfl, rfl⟩, (true, true), ⟨trivial, rfl⟩, rfl⟩,
    in_budget _ _⟩



/-! ### The distinctions and what they need -/























/-! ### Protocols: every word -/
















theorem keptP_pOf (l : List Rc) : keptP (pOf l) = l.toFinset := kept_wd () l

theorem all_in_pAR (r : Rc) : r ∈ maint () pAR := by
  show r ∈ keptP (pOf [Rc.ra, Rc.rr, Rc.rs])
  rw [keptP_pOf]
  cases r <;> decide

theorem bill_pAR : calibration () (wholeRes () pAR) = 3 := by
  show (((keptP (pOf [Rc.ra, Rc.rr, Rc.rs])).card : ℕ) : NNReal) = 3
  rw [keptP_pOf, show ([Rc.ra, Rc.rr, Rc.rs] : List Rc).toFinset.card = 3 from by decide]
  norm_num

/-! ### The record model, and sentence 4: an exact protocol for every family -/

theorem hbill (p : Pr ()) :
    ((calibration () (wholeRes () p) : NNReal) : ℝ) = ((keptP p).card : ℝ) :=
  NNReal.coe_natCast _

theorem hkept (p : Pr ()) : maint () p = (↑(keptP p) : Set Rc) := rfl

theorem hneed (p : Pr ()) (sigma : Set Rc) (d : Dist) (h : suff () p sigma d) :
    (↑(fam d) : Set Rc) ⊆ sigma := by
  intro r hr
  rcases Finset.mem_insert.mp (Finset.mem_coe.mp hr) with hr' | hr'
  · rw [hr']
    exact h.1
  · rw [Finset.mem_singleton.mp hr']
    exact h.2

/-- Sentence 4. Every family has a protocol that keeps exactly the records the family needs. -/
theorem available (S : Finset Dist) :
    ∃ p : Pr (), keptP p = S.biUnion fam ∧ ∀ d ∈ S, ∃ sigma : Set Rc,
      sigma ⊆ maint () p ∧ suff () p sigma d ∧ uses () p d sigma := by
  have hk : keptP (pOf (S.biUnion fam).toList) = S.biUnion fam := by
    rw [keptP_pOf, Finset.toList_toFinset]
  refine ⟨pOf (S.biUnion fam).toList, hk, fun d hd =>
    ⟨maint () (pOf (S.biUnion fam).toList), fun _ h => h, ?_, trivial⟩⟩
  have h1 : recOf d ∈ S.biUnion fam := Finset.mem_biUnion.mpr ⟨d, hd, Finset.mem_insert_self _ _⟩
  have h2 : Rc.rs ∈ S.biUnion fam :=
    Finset.mem_biUnion.mpr ⟨d, hd, Finset.mem_insert_of_mem (Finset.mem_singleton_self _)⟩
  show recOf d ∈ (↑(keptP (pOf (S.biUnion fam).toList)) : Set Rc) ∧
    Rc.rs ∈ (↑(keptP (pOf (S.biUnion fam).toList)) : Set Rc)
  rw [hk]
  exact ⟨Finset.mem_coe.mpr h1, Finset.mem_coe.mpr h2⟩



/-- Family cost is the number of records the family needs. -/
theorem cost_eq_card (S : Finset Dist) : fcost S = ((S.biUnion fam).card : ℝ) :=
  APFPaper1.Source.familyCost_eq_card_of_available (wholeRes ()) (calibration ()) (maint ())
    (suff ()) (uses ()) keptP fam hbill hkept hneed S (available S)





/-- B05's floor: a support-novel distinction adds a record. -/
theorem floor_holds (S : Finset Dist) (d : Dist)
    (hnov : APFPaper1.Source.supportNovel (wholeRes ()) (calibration ()) (maint ()) (suff ())
      (uses ()) S d) :
    (1 : ℝ) ≤ fcost (insert d S) - fcost S := by
  have hnot : recOf d ∉ S.biUnion fam := by
    intro hmem
    obtain ⟨eta, heta, h⟩ := hnov
    obtain ⟨p, hk, hp⟩ := available S
    refine h p hp ?_ ⟨maint () p, fun _ hr => hr, ?_⟩
    · have hcS : APFPaper1.Source.familyCost (wholeRes ()) (calibration ()) (maint ()) (suff ())
          (uses ()) S = ((S.biUnion fam).card : ℝ) := cost_eq_card S
      rw [hcS, hbill p, hk]
      linarith
    · obtain ⟨d', hd', _⟩ := Finset.mem_biUnion.mp hmem
      have hrs : Rc.rs ∈ S.biUnion fam :=
        Finset.mem_biUnion.mpr ⟨d', hd', Finset.mem_insert_of_mem (Finset.mem_singleton_self _)⟩
      show recOf d ∈ (↑(keptP p) : Set Rc) ∧ Rc.rs ∈ (↑(keptP p) : Set Rc)
      rw [hk]
      exact ⟨Finset.mem_coe.mpr hmem, Finset.mem_coe.mpr hrs⟩
  have hc : (S.biUnion fam).card + 1 ≤ ((insert d S).biUnion fam).card := by
    rw [Finset.biUnion_insert, ← Finset.card_insert_of_notMem hnot]
    apply Finset.card_le_card
    intro r hr
    rcases Finset.mem_insert.mp hr with rfl | hr'
    · exact Finset.mem_union_left _ (Finset.mem_insert_self _ _)
    · exact Finset.mem_union_right _ hr'
  rw [cost_eq_card, cost_eq_card]
  have hc' : ((S.biUnion fam).card : ℝ) + 1 ≤ (((insert d S).biUnion fam).card : ℝ) := by
    exact_mod_cast hc
  linarith





/-! ### B06 on the physical domain, at the extensional joint class -/









/-- B06 on this world, with the joint class set to the extensional one. -/
theorem world_B06 :
    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 := by
  have hserve : ∀ S : Finset (APFB06.Task (K ())
      (APFB06.physicalDomain (K ()) (Delta ()) (hresp ()))),
      pAR ∈ APFB06.extensionalJoint (maint ())
        (fun p s t => suff () p s (APFB06.taskEquiv (K ()) (Delta ()) (hresp ()) t))
        (fun p t s => uses () p (APFB06.taskEquiv (K ()) (Delta ()) (hresp ()) t) s) S :=
    fun _ _ _ => ⟨maint () pAR, fun _ hr => hr, ⟨all_in_pAR _, all_in_pAR _⟩, trivial⟩
  have hb : calibration () (wholeRes () pAR) ≤ C () := by
    rw [bill_pAR]
    exact le_refl _
  refine ⟨⟨(), alignR⟩, Set.mem_singleton _, ?_, ?_, pAR, hserve _, (true, true), wAR_in⟩
  · exact Finset.map_nonempty.mpr ⟨dAd, Finset.mem_insert_self _ _⟩
  · refine le_trans (sInf_le ⟨pAR, hserve _, rfl⟩) ?_
    exact ENNReal.coe_le_coe.mpr hb



/-- All eight declared forms hold on the supplied data. -/
theorem eight_hold : EightHold := by
  have hdesc : ∀ f : APFB01.PhysicalState (K ()) → Prop,
      APFB01.Descends (K ()) (fun x : St => f (APFB01.physicalClass (K ()) x)) :=
    fun f => ⟨f, fun x => Iff.rfl⟩
  refine ⟨⟨hdesc, hdesc, hdesc, hdesc⟩, ?_, ?_, ?_, ?_, world_B06, ?_, ?_⟩
  · rintro ⟨⟩ ⟨d, hd⟩
    refine ⟨fun x y h => by rw [profile_inj x y h], ⟨(true, true), (false, false), ?_⟩, pAR,
      maint () pAR, fun _ hr => hr, ⟨all_in_pAR _, all_in_pAR _⟩, trivial⟩
    rcases hd with rfl | rfl <;> decide
  · rintro ⟨⟩ d
    show 0 < fcost {d}
    rw [cost_single]
    norm_num
  · intro g
    show (0 : ℝ) ≤ ((3 : NNReal) : ℝ)
    exact NNReal.coe_nonneg _
  · rintro ⟨⟩
    exact ⟨one_pos, fun S d _ _ _ hnov => floor_holds S d hnov⟩
  · intro i
    exact ⟨rfl, fun G _ => le_refl _⟩
  · intro i
    exact ⟨APFB01.physicalClass (K ()) (true, true), ⟨rfl, fun H _ => le_refl _⟩, fun H hH => hH.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 two hold readings, of every word -/



















end APFB06.SharedWorld


/-
APF Foundation Ledger — theorem node DRAFT (Claude seat, session EthanBrooke-01WrrBvv, 2026-11-14; not
 gated, not reviewed, not released, not built in the ledger repo)
name: APFB06_superadditivity_worlds
title: A family of supplied worlds, one for each weight of a shared record, in which the eight declared forms and both readings hold and the whole costs more than, as much as, or less than its two parts
inputs_revision: 2026-10-04.1 for the eight declared forms as encoded. Revised 2026-11-14 (v2) so that the
 worlds also meet the sentence added to B02 at revision 2026-11-14.1: see Thm_APFB06_worlds_meet_B02_r2.
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: the eight declared-input definition nodes, unchanged. RULING_joint_class_2026-11-13 and
 RULING_held_relation_reading_2026-11-13 (the two readings). Thm_APFB05_relation_residue (the bound these
 worlds attain). Paper 1 Supplement v9.28:5919-5930 (the shared-bus example: two bit records and a bus
 that reading either bit requires), 1779-1781 (the residue), 6481, 7313. Codebank apf/delta_calculus.py
 (Delta = epsilon * (J - R); world W1, two anchors and one irreducibly joint term) and
 apf/yang_mills_md_bridge.py, check_T_contextuality_implies_superadditive_cost (shared classical bit:
 Delta <= 0; irreducibly joint distinction: Delta > 0).
consumes_inputs: none as hypotheses. Declared forms are PROVED of supplied data, which certifies nothing
 about the physical inputs.
the worlds (APFB06.BusWorld, one for each weight w ≥ 0): eight raw states with eight different continuation
 relations, one state for each combination of sides of the three distinctions dA, dB and dR; all three are
 true at the state s0. (v1 had four states and dR true exactly where dA and dB both were. Under the new
 sentence of B02 no distinction of the domain is settled by the others, so v2 makes dR a third free
 distinction. Records, protocols, bills and every cost are unchanged.) Four records: ra for
 dA, rb for dB, rr for dR, each of weight 1, and a shared record rs of weight w that every distinction
 needs and every protocol keeps. Four protocols: one keeps ra and rs, one keeps rb and rs, one keeps ra, rb
 and rs, one keeps everything. Capacity 3 + w, floor 1. The alignment sits at s0 and carries all three.
statement: (eight_hold) all eight declared forms hold, B06 at the extensional joint class on the physical
 domain. (alignments_hold_relation) every actual joint alignment holds a relation: dR over dA and dB.
 (bill_eq_records_plus_shared) each bill is one unit for each kept record of a distinction, plus w.
 (cost_A, cost_B, cost_AB, cost_whole) the costs are 1 + w, 1 + w, 2 + w and 3 + w.
 (sharedCost_parts) dA and dB share exactly w. (residue_eq) the whole less the two parts is 1 - w, which is
 the floor less what the parts share: the bound of Thm_APFB05_relation_residue is attained.
 (whole_gt_parts_iff, whole_eq_parts_iff, whole_lt_parts_iff) the whole costs more than, as much as, or
 less than its two parts exactly as w is below, at, or above 1.
reading: with the relation held and both readings in force, the sign of the residue is not fixed by the
 eight declared forms. It is the floor of the relation less what the parts share.
not_claimed: independence from the physical inputs as the author means them; that any of these worlds is a
 physical context; that dR is "the relation between" dA and dB in any sense beyond tested and
 support-novel over the pair; anything about the hold sentence or the occupant binding.
-/
















set_option autoImplicit false
open APFPaper1.Source

namespace APFB06.BusWorld




















































































section
variable (w : NNReal)









theorem bill_pA : bill w pA = 1 + (w : ℝ) := by
  show ((1 + w : NNReal) : ℝ) = 1 + (w : ℝ)
  norm_num

theorem bill_pB : bill w pB = 1 + (w : ℝ) := by
  show ((1 + w : NNReal) : ℝ) = 1 + (w : ℝ)
  norm_num

theorem bill_pAB : bill w pAB = 2 + (w : ℝ) := by
  show ((2 + w : NNReal) : ℝ) = 2 + (w : ℝ)
  norm_num

theorem bill_pABR : bill w pABR = 3 + (w : ℝ) := by
  show ((3 + w : NNReal) : ℝ) = 3 + (w : ℝ)
  norm_num

theorem one_le_bill (p : {p : Pr // p ∈ protocols ()}) : 1 + (w : ℝ) ≤ bill w p := by
  obtain ⟨q, hq⟩ := p
  cases q
  · exact le_of_eq (bill_pA w).symm
  · exact le_of_eq (bill_pB w).symm
  · show 1 + (w : ℝ) ≤ bill w pAB
    rw [bill_pAB]
    linarith
  · show 1 + (w : ℝ) ≤ bill w pABR
    rw [bill_pABR]
    linarith

























end









section
variable (w : NNReal)





























end





end APFB06.BusWorld

/-
APF Foundation Ledger — theorem node DRAFT (Claude seat, session EthanBrooke-01WrrBvv, 2026-11-15; not
 gated, not reviewed, not released, not built in the ledger repo)
name: APFPaper1_familyCost_additivity_and_two_worlds
title: The costs of two families add when protocols can be run side by side and taken apart; in two worlds where all eight declared forms hold and the two distinctions have no record in common, the pair costs more than the sum in one and less in the other
inputs_revision: 2026-11-14.1
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: the author, 2026-11-15 07:36 HST: "Yes", to this seat's "Shall I check that second route next?" The
 route: the codebank proves additivity of cost over independent parts from locality and independence
 (check_L_cost, sub-lemma C2), so perhaps less than "the bill is a sum" has to be a commitment.
 TEE_UP_ledger_completeness_option_C_2026-11-15, section 5.
 Paper 1 v5.15:796-801 (L_cost, "Pricing on an Additive Count Model": the count-only and equal-generator
 assumptions "contain the pricing restriction") and 803-805 (L_loc, "locality under a product model": the
 hypotheses include that "the joint bill is the sum of local bills", and neither a scalar capacity nor
 L_cost supplies the product hypothesis). Paper 1 Supplement v9.28:2426-2500 (factorized support and the
 additivity theorem, under its factorization hypotheses). Codebank apf/core.py: check_L_loc (1602) records
 that it compares supplied numbers and does not establish an additive joint bill or locality; check_T_M
 (4910) records that its legs exhibit the mechanism on declared instances. apf/delta_calculus.py,
 check_T_cost_count_characterization (588), clause X2.
consumes_inputs: none as hypotheses. In the two worlds declared forms are PROVED of supplied data, which
 certifies nothing about the physical inputs.
theorems, on any source data of the declared forms:
 - (familyCost_union_ge_of_split) if every protocol serving both families bills at least what some
   protocol serving the one and some protocol serving the other bill together, the cost of the union is at
   least the sum.
 - (familyCost_union_eq_of_join_and_split) with that and the join clause of
   Thm_APFPaper1_familyCost_subadditive_of_join, the costs add.
 - (familyCost_union_eq_of_disjoint_needs) where the bill is the sum of the costs of the records kept and
   availability holds at the two families and their union, families that need no record in common have
   costs that add.
the overhead world (APFB06.OverheadWorld, of Thm_APFPaper5_K1_bill_not_a_sum_world, unchanged): bills 1, 1
 and 3.
 - (no_shared_no_joint_record) the two distinctions need no record in common, and the pair needs no record
   that neither needs alone.
 - (cost_single_A, cost_single_B, cost_pair, pair_costs_more) the costs are 1, 1 and 3.
 - (eight_hold_no_common_record_and_cost_above_the_sum) the above with all eight declared forms, B02 with
   its second sentence.
the discount world (APFB06.DiscountWorld, new): the same states, distinctions, processes and two records;
 the bills are 2, 2 and 3. A copy of the residue world's block with those changes. Capacity 3, floor 1.
 - (eight_hold, meets_B02_r2) all eight declared forms hold, B02 with its second sentence.
 - (no_shared_no_joint_record, cost_single_A, cost_single_B, cost_pair, pair_costs_less) no record in
   common, no joint record, costs 2, 2 and 3.
 - (eight_hold_no_common_record_and_cost_below_the_sum) the above together.
reading: that the costs of two families with no record in common add is independent of the eight declared
 forms as encoded, in both directions. The join clause fails in the overhead world and the split clause in
 the discount world. A locality premise would have to supply both; Paper 1 v5.15 states locality under a
 product model that assumes the joint bill is the sum of the local bills, so it cannot be used to derive
 that.
not claimed: that either world is a physical context; independence for the physical inputs as the author
 means them; anything about the codebank's grades, which are the author's. 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.
-/


































set_option autoImplicit false
open APFPaper1.Source APFPaper5.K1

/-! ### When the costs of two families add -/

namespace APFPaper1.Source

section
variable {D P R Record : Type*} [DecidableEq D]
  (wholeResource : P → R) (calibration : R → NNReal)
  (maintained : P → Set Record)
  (sufficient : P → Set Record → D → Prop)
  (usesToRealize : P → D → Set Record → Prop)





variable [DecidableEq Record] (kept : P → Finset Record) (fam : D → Finset Record)
  (cost : Record → NNReal)



end

end APFPaper1.Source

/-! ### The overhead world: no record in common, and the pair costs more than the sum -/

namespace APFB06.OverheadWorld
















end APFB06.OverheadWorld

/-! ### The discount world: no record in common, and the pair costs less than the sum -/

namespace APFB06.DiscountWorld



























































theorem bill_pA : ((calibration () (wholeRes () pA) : NNReal) : ℝ) = 2 := by
  show ((2 : NNReal) : ℝ) = 2
  norm_num

theorem bill_pB : ((calibration () (wholeRes () pB) : NNReal) : ℝ) = 2 := by
  show ((2 : NNReal) : ℝ) = 2
  norm_num

theorem bill_pAB : ((calibration () (wholeRes () pAB) : NNReal) : ℝ) = 3 := by
  show ((3 : NNReal) : ℝ) = 3
  norm_num

theorem bill_ge_two (p : {p : Pr // p ∈ protocols ()}) :
    (2 : ℝ) ≤ ((calibration () (wholeRes () p) : NNReal) : ℝ) := by
  obtain ⟨q, hq⟩ := p
  cases q
  · exact le_of_eq bill_pA.symm
  · exact le_of_eq bill_pB.symm
  · have h : ((calibration () (wholeRes () (⟨Pr.pab, hq⟩ : {p : Pr // p ∈ protocols ()})) : NNReal) : ℝ)
        = 3 := bill_pAB
    rw [h]
    norm_num





































































end APFB06.DiscountWorld

/-
APF Foundation Ledger — theorem node DRAFT (Claude seat, session EthanBrooke-01WrrBvv, 2026-11-15; not
 gated, not reviewed, not released, not built in the ledger repo)
name: APFPaper5_K1_bill_not_a_sum_world
title: A world where all eight declared forms hold and no costs of records make the bill a sum over the records kept; the pair is still a counted family and K1's typed conditions hold for its score
inputs_revision: 2026-11-14.1
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: the author, 2026-11-15 06:55 HST: "1", in answer to this seat's "1. Derive the record ledger item by
 item from the eight." And 07:00 HST: "Would like the goal here to be adding the work to our p2m
 foundation… thinking it would be ideal to bolt on the Ks to that model? The goal is a P2m that takes us
 from first principals to quantum and gauge form". Read as: state the K layer on the foundation's own
 data. RULING_ledger_item_by_item_and_the_goal_2026-11-15.
 Paper 1 Supplement v9.28:1964: the calibration map and its additivity are "physical model inputs, not
 universal conclusions of the ledger formalism"; 2391-2399: the trigger conditions are not additional
 physical laws; 2197-2221: resource loads form a preordered monoid and a calibration is monotone, with no
 additivity asked. Codebank apf/core.py check_L_cost: ledger completeness (C1) is recorded there as a
 postulate and is not executed.
consumes_inputs: none as hypotheses. Declared forms are PROVED of supplied data, which certifies nothing
 about the physical inputs.
the world (APFB06.OverheadWorld): the residue world without its third record. Copied from
 Thm_APFB06_subadditivity_worlds (APFB06.ResidueWorldR2, the block from its states to eight_hold) with one
 change: the record type has ra and rb only. So the pair's protocol keeps exactly ra and rb and bills 3,
 while the protocol keeping ra bills 1 and the protocol keeping rb bills 1.
theorems:
 - (eight_hold, meets_B02_r2) all eight declared forms hold, B06 at the extensional joint class on the
   physical domain, B02 with its second sentence.
 - (keeps_iff_mem_kept, maint_eq_kept) what a protocol maintains is a finite set.
 - (no_record_costs) no assignment of costs to the records, of either sign, makes every bill the sum of
   the costs of the records kept.
 - (pair_counted_first_typed, pair_is_counted_leastBill) the pair is a counted family, ra being dA's own
   record and rb dB's, each with least bill at least 1.
 - (world_meets_eight_without_a_book_and_counted_pair_meets_K1) the above together, with K1's typed
   conditions for the pair's score.
reading: "a protocol's bill is the sum of the costs of the records it keeps" is independent of the eight
 declared forms as encoded. Consistent: every earlier world of this seat. Not entailed: this world. This
 closes guard 3 of pass 28 (MEMO_pullbacks_pass28: a world meeting all eight in which the bill is not a
 sum was owed). K1's typed conditions for a counted family do not need the sentence.
not claimed: that this world is a physical context; independence for the physical inputs as the author
 means them; that no reading of the eight gives additivity under further conditions (the Supplement's
 factorized-support theorem does, under its own hypotheses). The least bill is NOT RULED. 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.
-/













































set_option autoImplicit false
open APFPaper1.Source APFPaper5.K1

/-! ### The overhead world: the residue world without its third record -/

namespace APFB06.OverheadWorld



























































theorem bill_pA : ((calibration () (wholeRes () pA) : NNReal) : ℝ) = 1 := by
  show ((1 : NNReal) : ℝ) = 1
  exact NNReal.coe_one

theorem bill_pB : ((calibration () (wholeRes () pB) : NNReal) : ℝ) = 1 := by
  show ((1 : NNReal) : ℝ) = 1
  exact NNReal.coe_one

theorem bill_pAB : ((calibration () (wholeRes () pAB) : NNReal) : ℝ) = 3 := by
  show ((3 : NNReal) : ℝ) = 3
  norm_num

theorem bill_ge_one (p : {p : Pr // p ∈ protocols ()}) :
    (1 : ℝ) ≤ ((calibration () (wholeRes () p) : NNReal) : ℝ) := by
  obtain ⟨q, hq⟩ := p
  cases q
  · exact le_of_eq bill_pA.symm
  · exact le_of_eq bill_pB.symm
  · have h : ((calibration () (wholeRes () (⟨Pr.pab, hq⟩ : {p : Pr // p ∈ protocols ()})) : NNReal) : ℝ)
        = 3 := bill_pAB
    rw [h]
    norm_num













































/-! ### The bill is not a sum over the records kept -/











/-! ### B02 with its second sentence -/










/-! ### The pair is a counted family, and K1's typed conditions hold for its score -/





























end APFB06.OverheadWorld




































































































































set_option autoImplicit false

open APFPaper1.Source APFPaper5.K1

namespace APFPaper1.Source

section
variable {D P R Record : Type*}
variable (wholeResource : P → R) (calibration : R → NNReal) (maintained : P → Set Record)
  (sufficient : P → Set Record → D → Prop) (usesToRealize : P → D → Set Record → Prop)
  (cost : Record → ℝ)

/-- The occupant statement in full, as a property of supplied source data: `p` holds `S0` with its parts,
each record `p` keeps costs `eps`, and holding nothing is free. A candidate packaging. -/
def OccupantStatementInFull (eps : ℝ) (p : P) (S0 : Finset D) : Prop :=
  OccupantHoldsWithPartsAtUnit wholeResource calibration maintained sufficient usesToRealize cost eps
      p S0 ∧
    HoldingNothingFree wholeResource calibration maintained







end

end APFPaper1.Source

/-! ## Worlds that meet the statement in full -/

namespace APFB06.ReadingsWorld





end APFB06.ReadingsWorld

namespace APFB06.MovingWorld











end APFB06.MovingWorld

namespace APFB06.SharedWorld











end APFB06.SharedWorld

namespace APFB06.ResidueNullWorld



end APFB06.ResidueNullWorld

/-! ## Worlds that do not: in none of them does a protocol hold nothing for nothing -/

namespace APFB06.BridgeWorld





end APFB06.BridgeWorld

namespace APFB06.RelationWorldR2



end APFB06.RelationWorldR2

namespace APFB06.ResidueWorldR2.Unequal



end APFB06.ResidueWorldR2.Unequal

namespace APFB06.BusWorld



end APFB06.BusWorld

namespace APFB06.OverheadWorld



end APFB06.OverheadWorld

namespace APFB06.DiscountWorld



end APFB06.DiscountWorld

namespace APFPaper1.LoadWorld



end APFPaper1.LoadWorld

namespace APFPaper5.Worlds



end APFPaper5.Worlds

/-! ## What the worlds that meet the statement still show -/

namespace APFB06.WorldsAudit



end APFB06.WorldsAudit
Source
Theorems.Thm_APFB06_worlds_against_the_occupant_statement; Pullbacks v46, SHA-256 c29347fa6a96a3e1a42510c70260c10da72d43e81ce6e92e2679e9bcb1de88d5. Theorems.Thm_APFB06_worlds_against_the_occupant_statement; pullbacks v46; SHA-256 c29347fa6a96a3e1a42510c70260c10da72d43e81ce6e92e2679e9bcb1de88d5

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me