equal count equal cost
ProvedAPFPaper1.Source.equal_count_equal_costapfapf-referencepullbacks-v46-2026-11
Result: equal count equal cost. All parameters and hypotheses are retained in the declaration below.
theorem equal_count_equal_cost (eps : ℝ) (p : P) (S0 S1 S2 : Finset D)
(h : OccupantHoldsWithPartsAtUnit wholeResource calibration maintained sufficient usesToRealize
cost eps p S0)
(h1 : S1 ⊆ S0) (hne1 : S1.Nonempty) (h2 : S2 ⊆ S0) (hne2 : S2.Nonempty)
(N1 N2 : Finset Record)
(hN1 : (↑N1 : Set Record) = sourceNeeds maintained sufficient usesToRealize S1)
(hN2 : (↑N2 : Set Record) = sourceNeeds maintained sufficient usesToRealize S2)
(hcard : N1.card = N2.card) :
familyCost wholeResource calibration maintained sufficient usesToRealize S1 =
familyCost wholeResource calibration maintained sufficient usesToRealize S2
Module context and limits: OccupantHoldsWithPartsAtUnit adds a strictly positive epsilon and that unit price for each maintained record. Conditional count, finite ladder, novelty-floor and permutation identities follow; unequal-price and BW counterexamples retain their exact domains. This unit-cost hypothesis and the identification of epsilon with physical B05 are not installed.
Source scope parameters:
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 → ℝ)
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_occupant_at_unit_cost_Vocabulary import Definitions.Def_APFPaper1_occupant_and_its_parts_Vocabulary import Theorems.Thm_APFPaper1_Source_part_cost_eq_sum import Theorems.Thm_APFPaper1_Source_occupantHoldsWithParts_of_everyFamilyOccupied import Theorems.Thm_APFB06_ResidueWorldR2_occupant_holds_pair_with_parts import Theorems.Thm_APFB06_OverheadWorld_no_occupant_holds_pair_with_parts import Theorems.Thm_APFB06_DiscountWorld_no_occupant_holds_pair_with_parts import Theorems.Thm_APFPaper1_Source_each_eq_floor_of_sum_le import Theorems.Thm_APFPaper1_Source_sum_eq_card_mul_of_each_eq import Theorems.Thm_APFPaper1_Source_each_eq_floor_iff import Theorems.Thm_APFPaper1_Source_needed_records_at_floor_iff import Definitions.Def_APFB06_unequal_record_costs_world_Vocabulary import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_billU_ge_one import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_one_le_costU import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_two_le_costU import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_costU_single_A import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_floorU_holds import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_eight_hold import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_A2_at_protocol_binding import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_BW_at_protocol_binding import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_realized_isOccupant import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_occupant_holds_pair_with_parts import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_record_costs_forced import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_no_unit_record_cost import Definitions.Def_APFPaper5_K2_StateClass 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.equal_count_equal_cost :
∀ {D : Type apfNative_u_1} {P : Type apfNative_u_2} {R : Type apfNative_u_3} {Record : Type apfNative_u_4}
(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)
(cost : Record → Real) (eps : Real) (p : P) (S0 S1 S2 : Finset.{apfNative_u_1} D)
(h :
@APFPaper1.Source.OccupantHoldsWithPartsAtUnit.{apfNative_u_1, apfNative_u_2, apfNative_u_3, apfNative_u_4} D P R
Record wholeResource calibration maintained sufficient usesToRealize cost eps p S0)
(h1 :
@LE.le.{apfNative_u_1} (Finset.{apfNative_u_1} D)
(@Preorder.toLE.{apfNative_u_1} (Finset.{apfNative_u_1} D)
(@PartialOrder.toPreorder.{apfNative_u_1} (Finset.{apfNative_u_1} D)
(@Finset.instPartialOrder.{apfNative_u_1} D)))
S1 S0)
(hne1 : @Finset.Nonempty.{apfNative_u_1} D S1)
(h2 :
@LE.le.{apfNative_u_1} (Finset.{apfNative_u_1} D)
(@Preorder.toLE.{apfNative_u_1} (Finset.{apfNative_u_1} D)
(@PartialOrder.toPreorder.{apfNative_u_1} (Finset.{apfNative_u_1} D)
(@Finset.instPartialOrder.{apfNative_u_1} D)))
S2 S0)
(hne2 : @Finset.Nonempty.{apfNative_u_1} D S2) (N1 N2 : Finset.{apfNative_u_4} Record)
(hN1 :
@Eq.{apfNative_u_4 + 1} (Set.{apfNative_u_4} Record)
(@SetLike.coe.{apfNative_u_4, apfNative_u_4} (Finset.{apfNative_u_4} Record) Record
(@Finset.instSetLike.{apfNative_u_4} Record) N1)
(@APFPaper5.K1.sourceNeeds.{apfNative_u_1, apfNative_u_2, apfNative_u_4} D P Record maintained sufficient
usesToRealize S1))
(hN2 :
@Eq.{apfNative_u_4 + 1} (Set.{apfNative_u_4} Record)
(@SetLike.coe.{apfNative_u_4, apfNative_u_4} (Finset.{apfNative_u_4} Record) Record
(@Finset.instSetLike.{apfNative_u_4} Record) N2)
(@APFPaper5.K1.sourceNeeds.{apfNative_u_1, apfNative_u_2, apfNative_u_4} D P Record maintained sufficient
usesToRealize S2))
(hcard : @Eq.{1} Nat (@Finset.card.{apfNative_u_4} Record N1) (@Finset.card.{apfNative_u_4} Record N2)),
@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 S1)
(@APFPaper1.Source.familyCost.{apfNative_u_1, apfNative_u_2, apfNative_u_3, apfNative_u_4} D P R Record
wholeResource calibration maintained sufficient usesToRealize S2) := by sorry
Source
['Theorems.Thm_APFPaper1_occupant_at_unit_cost:118; pullbacks v46; source SHA-256 3a2a2670634f02e0d11cf9323e61290e6f56c8f6077bc6b25d694afd945df08d']