not BWOnParts of two cheapest
ProvedAPFPaper1.Source.not_BWOnParts_of_two_cheapestapfapf-referencepullbacks-v46-2026-11
Result: not BWOnParts of two cheapest. All parameters and hypotheses are retained in the declaration below.
theorem not_BWOnParts_of_two_cheapest (S0 S1 S2 : Finset D)
(h1 : S1.Nonempty ∧ S1 ⊆ S0) (h2 : S2.Nonempty ∧ S2 ⊆ S0) (hne : S1 ≠ S2)
(heq : familyCost wholeResource calibration maintained sufficient usesToRealize S1 =
familyCost wholeResource calibration maintained sufficient usesToRealize S2)
(hmin : ∀ S : Finset D, S.Nonempty ∧ S ⊆ S0 →
familyCost wholeResource calibration maintained sufficient usesToRealize S1 ≤
familyCost wholeResource calibration maintained sufficient usesToRealize S) :
¬ BWOnParts wholeResource calibration maintained sufficient usesToRealize S0
Module context and limits: BWOnParts uses nonempty subfamilies as configurations and their family cost as objective. Two distinct global minima refute it; unit cost plus the explicit one-record and positivity hypotheses supplies such ties. This chosen binding and the scope of physical genericity are not certified.
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_APFB07b_BW_on_parts_and_unit_cost_Vocabulary import Definitions.Def_APFPaper1_occupant_at_unit_cost_Vocabulary import Theorems.Thm_APFPaper1_Source_needed_by_part_costs_eps import Theorems.Thm_APFPaper1_Source_part_cost_eq_count import Theorems.Thm_APFPaper1_Source_part_cost_on_ladder import Theorems.Thm_APFPaper1_Source_equal_count_equal_cost import Theorems.Thm_APFPaper1_Source_occupant_record_count_le import Theorems.Thm_APFPaper1_Source_novel_needs_new_record import Theorems.Thm_APFPaper1_Source_floor_on_parts import Theorems.Thm_APFPaper5_K1_atomTable_of_unit import Theorems.Thm_APFPaper5_K2_recordForm_unit_perm import Theorems.Thm_APFPaper5_K2_recordForm_swap_ne import Theorems.Thm_APFB06_ResidueWorldR2_occupant_holds_pair_with_parts_at_unit import Theorems.Thm_APFB06_ResidueWorldR2_two_parts_tie import Theorems.Thm_APFB06_ResidueWorldR2_not_BW_at_protocol_binding import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_not_at_unit 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.not_BWOnParts_of_two_cheapest :
∀ {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)
(S0 S1 S2 : Finset.{apfNative_u_1} D)
(h1 :
And (@Finset.Nonempty.{apfNative_u_1} D S1)
(@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))
(h2 :
And (@Finset.Nonempty.{apfNative_u_1} D S2)
(@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))
(hne : @Ne.{apfNative_u_1 + 1} (Finset.{apfNative_u_1} D) S1 S2)
(heq :
@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))
(hmin :
∀ (S : Finset.{apfNative_u_1} D),
And (@Finset.Nonempty.{apfNative_u_1} D S)
(@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)))
S S0) →
@LE.le.{0} Real Real.instLE
(@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 S)),
Not
(@APFPaper1.Source.BWOnParts.{apfNative_u_1, apfNative_u_2, apfNative_u_3, apfNative_u_4} D P R Record wholeResource
calibration maintained sufficient usesToRealize S0) := by sorry
Source
['Theorems.Thm_APFB07b_BW_on_parts_and_unit_cost:54; pullbacks v46; source SHA-256 fef79462dfad9e31505ab0007fe7f95573032bee10162a8caaad1de73390e6f7']