familyCost union eq of disjoint needs
ProvedAPFPaper1.Source.familyCost_union_eq_of_disjoint_needsapfapf-referencepullbacks-v39-2026-11
Result: familyCost union eq of disjoint needs. All parameters and hypotheses are retained in the declaration below.
theorem familyCost_union_eq_of_disjoint_needs
(hbill : ∀ p : P, (calibration (wholeResource p) : ℝ) = ∑ r ∈ kept p, (cost r : ℝ))
(hkept : ∀ p : P, maintained p = (↑(kept p) : Set Record))
(hneed : ∀ (p : P) (sigma : Set Record) (d : D),
sufficient p sigma d → (↑(fam d) : Set Record) ⊆ sigma)
(S T : Finset D)
(hdisj : Disjoint (S.biUnion fam) (T.biUnion fam))
(havS : ∃ p : P, kept p = S.biUnion fam ∧ ∀ d ∈ S, ∃ sigma : Set Record,
sigma ⊆ maintained p ∧ sufficient p sigma d ∧ usesToRealize p d sigma)
(havT : ∃ p : P, kept p = T.biUnion fam ∧ ∀ d ∈ T, ∃ sigma : Set Record,
sigma ⊆ maintained p ∧ sufficient p sigma d ∧ usesToRealize p d sigma)
(havST : ∃ p : P, kept p = (S ∪ T).biUnion fam ∧ ∀ d ∈ S ∪ T, ∃ sigma : Set Record,
sigma ⊆ maintained p ∧ sufficient p sigma d ∧ usesToRealize p d sigma) :
familyCost wholeResource calibration maintained sufficient usesToRealize (S ∪ T) =
familyCost wholeResource calibration maintained sufficient usesToRealize S +
familyCost wholeResource calibration maintained sufficient usesToRealize T
Module context and limits: Additivity requires the stated joining/splitting inequalities, or additive record bills plus exact availability and disjoint needs. OverheadWorld and DiscountWorld satisfy the eight encoded forms at revision 2026-11-14.1 and give costs above/below the separate sum with no shared or joint needed record. These supplied structures are not physical models or witnesses for the later occupant statement.
Source scope parameters:
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)
Public reference result; this record does not establish Foundation admission, physical K1–K4 closure, a forced transfer or Born-rule derivation.
Preamble
import Definitions.Def_APFPaper1_familyCost_additivity_and_two_worlds_Vocabulary 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 Mathlib.Tactic.NormNum import Mathlib.Tactic.Linarith set_option autoImplicit false universe apfNative_u_1 apfNative_u_2 apfNative_u_3 apfNative_u_4
Formal statement
theorem APFPaper1.Source.familyCost_union_eq_of_disjoint_needs :
∀ {D : Type apfNative_u_1} {P : Type apfNative_u_2} {R : Type apfNative_u_3} {Record : Type apfNative_u_4}
[inst : DecidableEq.{apfNative_u_1 + 1} D] (wholeResource : P → R) (calibration : R → NNReal)
(maintained : P → Set.{apfNative_u_4} Record) (sufficient : P → Set.{apfNative_u_4} Record → D → Prop)
(usesToRealize : P → D → Set.{apfNative_u_4} Record → Prop) [inst_1 : DecidableEq.{apfNative_u_4 + 1} Record]
(kept : P → Finset.{apfNative_u_4} Record) (fam : D → Finset.{apfNative_u_4} Record) (cost : Record → NNReal)
(hbill :
∀ (p : P),
@Eq.{1} Real (NNReal.toReal (calibration (wholeResource p)))
(@Finset.sum.{apfNative_u_4, 0} Record Real Real.instAddCommMonoid (kept p) fun (r : Record) =>
NNReal.toReal (cost r)))
(hkept :
∀ (p : P),
@Eq.{apfNative_u_4 + 1} (Set.{apfNative_u_4} Record) (maintained p)
(@SetLike.coe.{apfNative_u_4, apfNative_u_4} (Finset.{apfNative_u_4} Record) Record
(@Finset.instSetLike.{apfNative_u_4} Record) (kept p)))
(hneed :
∀ (p : P) (sigma : Set.{apfNative_u_4} Record) (d : D),
sufficient p sigma d →
@LE.le.{apfNative_u_4} (Set.{apfNative_u_4} Record) (@Set.instLE.{apfNative_u_4} Record)
(@SetLike.coe.{apfNative_u_4, apfNative_u_4} (Finset.{apfNative_u_4} Record) Record
(@Finset.instSetLike.{apfNative_u_4} Record) (fam d))
sigma)
(S T : Finset.{apfNative_u_1} D)
(hdisj :
@Disjoint.{apfNative_u_4} (Finset.{apfNative_u_4} Record) (@Finset.instPartialOrder.{apfNative_u_4} Record)
(@Finset.instOrderBot.{apfNative_u_4} Record)
(@Finset.biUnion.{apfNative_u_1, apfNative_u_4} D Record inst_1 S fam)
(@Finset.biUnion.{apfNative_u_1, apfNative_u_4} D Record inst_1 T fam))
(havS :
@Exists.{apfNative_u_2 + 1} P fun (p : P) =>
And
(@Eq.{apfNative_u_4 + 1} (Finset.{apfNative_u_4} Record) (kept p)
(@Finset.biUnion.{apfNative_u_1, apfNative_u_4} D Record inst_1 S fam))
(∀ (d : D),
@Membership.mem.{apfNative_u_1, apfNative_u_1} D (Finset.{apfNative_u_1} D)
(@SetLike.instMembership.{apfNative_u_1, apfNative_u_1} (Finset.{apfNative_u_1} D) D
(@Finset.instSetLike.{apfNative_u_1} D))
S d →
@Exists.{apfNative_u_4 + 1} (Set.{apfNative_u_4} Record) fun (sigma : Set.{apfNative_u_4} Record) =>
And
(@LE.le.{apfNative_u_4} (Set.{apfNative_u_4} Record) (@Set.instLE.{apfNative_u_4} Record) sigma
(maintained p))
(And (sufficient p sigma d) (usesToRealize p d sigma))))
(havT :
@Exists.{apfNative_u_2 + 1} P fun (p : P) =>
And
(@Eq.{apfNative_u_4 + 1} (Finset.{apfNative_u_4} Record) (kept p)
(@Finset.biUnion.{apfNative_u_1, apfNative_u_4} D Record inst_1 T fam))
(∀ (d : D),
@Membership.mem.{apfNative_u_1, apfNative_u_1} D (Finset.{apfNative_u_1} D)
(@SetLike.instMembership.{apfNative_u_1, apfNative_u_1} (Finset.{apfNative_u_1} D) D
(@Finset.instSetLike.{apfNative_u_1} D))
T d →
@Exists.{apfNative_u_4 + 1} (Set.{apfNative_u_4} Record) fun (sigma : Set.{apfNative_u_4} Record) =>
And
(@LE.le.{apfNative_u_4} (Set.{apfNative_u_4} Record) (@Set.instLE.{apfNative_u_4} Record) sigma
(maintained p))
(And (sufficient p sigma d) (usesToRealize p d sigma))))
(havST :
@Exists.{apfNative_u_2 + 1} P fun (p : P) =>
And
(@Eq.{apfNative_u_4 + 1} (Finset.{apfNative_u_4} Record) (kept p)
(@Finset.biUnion.{apfNative_u_1, apfNative_u_4} D Record inst_1
(@Union.union.{apfNative_u_1} (Finset.{apfNative_u_1} D) (@Finset.instUnion.{apfNative_u_1} D inst) S T)
fam))
(∀ (d : D),
@Membership.mem.{apfNative_u_1, apfNative_u_1} D (Finset.{apfNative_u_1} D)
(@SetLike.instMembership.{apfNative_u_1, apfNative_u_1} (Finset.{apfNative_u_1} D) D
(@Finset.instSetLike.{apfNative_u_1} D))
(@Union.union.{apfNative_u_1} (Finset.{apfNative_u_1} D) (@Finset.instUnion.{apfNative_u_1} D inst) S T)
d →
@Exists.{apfNative_u_4 + 1} (Set.{apfNative_u_4} Record) fun (sigma : Set.{apfNative_u_4} Record) =>
And
(@LE.le.{apfNative_u_4} (Set.{apfNative_u_4} Record) (@Set.instLE.{apfNative_u_4} Record) sigma
(maintained p))
(And (sufficient p sigma d) (usesToRealize p d sigma)))),
@Eq.{1} Real
(@APFPaper1.Source.familyCost.{apfNative_u_1, apfNative_u_2, apfNative_u_3, apfNative_u_4} D P R Record
wholeResource calibration maintained sufficient usesToRealize
(@Union.union.{apfNative_u_1} (Finset.{apfNative_u_1} D) (@Finset.instUnion.{apfNative_u_1} D inst) S T))
(@HAdd.hAdd.{0, 0, 0} Real Real Real (@instHAdd.{0} Real Real.instAdd)
(@APFPaper1.Source.familyCost.{apfNative_u_1, apfNative_u_2, apfNative_u_3, apfNative_u_4} D P R Record
wholeResource calibration maintained sufficient usesToRealize S)
(@APFPaper1.Source.familyCost.{apfNative_u_1, apfNative_u_2, apfNative_u_3, apfNative_u_4} D P R Record
wholeResource calibration maintained sufficient usesToRealize T)) := by sorry
Source
['Theorems.Thm_APFPaper1_familyCost_additivity_and_two_worlds:137; pullbacks v39; source SHA-256 c2a4a1cfc891fa32f2231b932ed45cee65a7af7115d841df2ac417ceebeca55f']