nothing is the one minimum
ProvedAPFPaper1.Source.nothing_is_the_one_minimumapfapf-referencepullbacks-v46-2026-11
Result: nothing is the one minimum. All parameters and hypotheses are retained in the declaration below.
theorem nothing_is_the_one_minimum (h : HoldingNothingFree wholeResource calibration maintained)
(hpos : ∀ S : Finset D, S.Nonempty →
0 < familyCost wholeResource calibration maintained sufficient usesToRealize S) :
APFB07b.IsMinimum (fun _ : Finset D => True)
(fun S => familyCost wholeResource calibration maintained sufficient usesToRealize S) ∅ ∧
∀ H : Finset D, APFB07b.IsMinimum (fun _ : Finset D => True)
(fun S => familyCost wholeResource calibration maintained sufficient usesToRealize S) H →
H = ∅
Module context and limits: HoldingNothingFree asserts a protocol with no maintained records and zero bill. It gives empty-family cost zero and extends conditional count formulas to empty parts; the singleton floor also requires the encoded B05, testedness, admissibility and novelty. Unique empty minimization requires positivity of every nonempty family. These are explicit hypotheses.
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)
variable {D P R Record : Type*} [DecidableEq Record]
variable (wholeResource : P → R) (calibration : R → NNReal) (maintained : P → Set Record)
(sufficient : P → Set Record → D → Prop) (usesToRealize : P → D → Set Record → Prop)
(kept : P → Finset Record) (fam : D → Finset 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_holding_nothing_costs_nothing_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 Definitions.Def_APFB06_readings_world_Vocabulary import Theorems.Thm_APFB06_ReadingsWorld_word_fixes_state import Theorems.Thm_APFB06_ReadingsWorld_available import Theorems.Thm_APFB06_ReadingsWorld_cost_eq_card import Theorems.Thm_APFB06_ReadingsWorld_cost_subadditive import Theorems.Thm_APFB06_ReadingsWorld_eight_hold import Theorems.Thm_APFB06_ReadingsWorld_every_combination_held import Theorems.Thm_APFB06_ReadingsWorld_meets_B02_r2 import Theorems.Thm_APFB06_ReadingsWorld_alignments_hold_relation import Theorems.Thm_APFB06_ReadingsWorld_sum_holds import Theorems.Thm_APFB06_ReadingsWorld_keep_holds import Theorems.Thm_APFB06_ReadingsWorld_after_holds import Theorems.Thm_APFB06_ReadingsWorld_capacity_holds import Theorems.Thm_APFB06_ReadingsWorld_empty_keeps_nothing import Theorems.Thm_APFB06_ReadingsWorld_prefix_restriction_holds import Theorems.Thm_APFB06_ReadingsWorld_identity_holds import Theorems.Thm_APFB06_ReadingsWorld_subword_heredity_holds 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 Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum set_option autoImplicit false universe apfNative_u_1 apfNative_u_2 apfNative_u_3 apfNative_u_4
Formal statement
theorem APFPaper1.Source.nothing_is_the_one_minimum :
∀ {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)
(h :
@APFPaper1.Source.HoldingNothingFree.{apfNative_u_2, apfNative_u_3, apfNative_u_4} P R Record wholeResource
calibration maintained)
(hpos :
∀ (S : Finset.{apfNative_u_1} D),
@Finset.Nonempty.{apfNative_u_1} D S →
@LT.lt.{0} Real Real.instLT (@OfNat.ofNat.{0} Real (nat_lit 0) (@Zero.toOfNat0.{0} Real Real.instZero))
(@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)),
And
(@APFB07b.IsMinimum.{apfNative_u_1} (Finset.{apfNative_u_1} D) (fun (x : Finset.{apfNative_u_1} D) => True)
(fun (S : Finset.{apfNative_u_1} D) =>
@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)
(@EmptyCollection.emptyCollection.{apfNative_u_1} (Finset.{apfNative_u_1} D)
(@Finset.instEmptyCollection.{apfNative_u_1} D)))
(∀ (H : Finset.{apfNative_u_1} D),
@APFB07b.IsMinimum.{apfNative_u_1} (Finset.{apfNative_u_1} D) (fun (x : Finset.{apfNative_u_1} D) => True)
(fun (S : Finset.{apfNative_u_1} D) =>
@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)
H →
@Eq.{apfNative_u_1 + 1} (Finset.{apfNative_u_1} D) H
(@EmptyCollection.emptyCollection.{apfNative_u_1} (Finset.{apfNative_u_1} D)
(@Finset.instEmptyCollection.{apfNative_u_1} D))) := by sorry
Source
['Theorems.Thm_APFPaper1_holding_nothing_costs_nothing:151; pullbacks v46; source SHA-256 f59998ead83868e1243626034aff88c504158bc4fe350b5e30432a5118eb9f16']