familyNeeds eq of exactly served
ProvedAPFPaper5.K1.familyNeeds_eq_of_exactly_servedResult: familyNeeds eq of exactly served. All parameters and hypotheses are retained in the declaration below.
theorem familyNeeds_eq_of_exactly_served [DecidableEq Record] (L : RecordLedger D P Record)
(S : Finset D)
(hS : ∃ p : P, L.kept p = S.biUnion L.needsFin ∧ ∀ d ∈ S, ∃ sigma : Set Record,
sigma ⊆ L.maintained p ∧ L.sufficient p sigma d ∧ L.usesToRealize p d sigma) :
familyNeeds L S = (↑(S.biUnion L.needsFin) : Set Record)
Module context and limits: Nonnegative weights and a positive record unique to each party suffice for a faithful finite table. The record-ledger result obtains those records from the stated B05, LedgerAvailable and earlier LedgerCounted hypotheses. They remain explicit.
Source scope parameters:
variable {ι : Type*} [Fintype ι] [DecidableEq ι] {W : Type*} [Fintype W]
variable {D P Record : Type*}
variable {ι : Type*} [Fintype ι] [DecidableEq ι] [DecidableEq D]
variable [Fintype Record]
Public reference result; this record does not establish Foundation admission, physical K1–K4 closure, a forced transfer or Born-rule derivation.
Retired after a platform target-type parsing error. The compiler-equivalent explicit statement and accepted proof are available as APFPaper5.K1.familyNeeds_eq_of_exactly_served_explicit: https://prove2.me/theorems/7e46cd17-a6b2-43aa-b72d-6fd2276751c7. The original statement and submission history remain preserved.
import Definitions.Def_APFPaper5_K1_LedgerPartyScore
import Definitions.Def_APFPaper5_K1_LedgerScore
import Theorems.Thm_APFPaper5_K1_partyTo_book_iff
import Theorems.Thm_APFPaper5_K1_partyScore_book
import Theorems.Thm_APFPaper5_K1_partyScore_book_meets_K1
import Theorems.Thm_APFPaper5_K1_partyScore_book_faithful_iff
import Theorems.Thm_APFPaper5_K1_sharedCost_eq_partyScore_of_no_joint
import Definitions.Def_APFPaper5_K1_interface_bridge_Vocabulary
import Theorems.Thm_APFPaper5_K1_interface_region_satisfies_K1_of_floor
import Theorems.Thm_APFPaper1_RecordLedger_bill_eq_sum
import Theorems.Thm_APFPaper1_RecordLedger_maintained_eq_kept
import Theorems.Thm_APFPaper1_RecordLedger_needsFin_subset_of_sufficient
import Theorems.Thm_APFB05_overfull_chain_not_admissible
import Theorems.Thm_APFB05_no_admissible_family_contains_overfull_chain
import Theorems.Thm_APFB05_no_room_for_new_record
set_option autoImplicit false
open APFPaper1 APFPaper1.Source
namespace APFPaper5.K1
end APFPaper5.K1
open APFPaper5
open APFPaper5.K1
/-! ### Any keeping rule -/
variable {ι : Type*} [Fintype ι] [DecidableEq ι] {W : Type*} [Fintype W]
/-! ### On a record ledger -/
variable {D P Record : Type*}
theorem APFPaper5.K1.familyNeeds_eq_of_exactly_served [DecidableEq Record] (L : RecordLedger D P Record)
(S : Finset D)
(hS : ∃ p : P, L.kept p = S.biUnion L.needsFin ∧ ∀ d ∈ S, ∃ sigma : Set Record,
sigma ⊆ L.maintained p ∧ L.sufficient p sigma d ∧ L.usesToRealize p d sigma) :
familyNeeds L S = (↑(S.biUnion L.needsFin) : Set Record) := by sorry