available
ProvedAPFB06.GainWorld.availableapfapf-referenceusb-v58-batch-a-2026-11
Sentence 4. Every family has a protocol that keeps exactly the records the family needs.
Scope and conditions: Finite supplied model in which the no-record fragment sends (a,r) to (a,true). This map is not injective; the retained word name hold does not make it a reversible K-layer hold. Theorems concern supplied data and historical declared forms. They neither establish physical free gain nor discharge current B06, protocol binding, continuity or K-layer obligations.
Exact source statement:
theorem available (S : Finset Dist) :
∃ p : Pr (), keptP p = S.biUnion fam ∧ ∀ d ∈ S, ∃ sigma : Set Rc,
sigma ⊆ maint () p ∧ suff () p sigma d ∧ uses () p d sigma
Preamble
import Definitions.Def_APFB06_gain_world_Vocabulary import Definitions.Def_APFPaper5_Worlds_TwoObjects import Definitions.Def_APFB06_ExtensionalJoint import Definitions.Def_APFB06_AlignmentHoldsRelation import Definitions.Def_APF_B02_DeclaredInput_r2_proposed import Definitions.Def_APFB02_HoldOnDistinctions import Definitions.Def_APF_B04_DeclaredInput import Definitions.Def_APF_B07a_DeclaredInput import Definitions.Def_APF_B07b_DeclaredInput 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 Theorems.Thm_APFPaper1_Continuation_prefixMonotone_of_sum_and_keep import Theorems.Thm_APFPaper1_Continuation_cont_prefix_of_sum_and_keep import Theorems.Thm_APFPaper1_Continuation_cont_iff_contHereditary_of_sum_and_keep import Theorems.Thm_APFPaper1_Continuation_subwordHeredity_of_subword_bill import Theorems.Thm_APFPaper1_Continuation_subwordHeredity_of_sum_and_keeps import Theorems.Thm_APFPaper1_Continuation_bill_nullWord_of_sum import Theorems.Thm_APFPaper1_Continuation_cont_identity_of_sum import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum set_option autoImplicit false
Formal statement
theorem APFB06.GainWorld.available :
∀ (S : Finset.{0} APFB06.GainWorld.Dist),
@Exists.{1} (APFB06.GainWorld.Pr Unit.unit) fun (p : APFB06.GainWorld.Pr Unit.unit) =>
And
(@Eq.{1} (Finset.{0} APFB06.GainWorld.Rc) (APFB06.GainWorld.keptP p)
(@Finset.biUnion.{0, 0} APFB06.GainWorld.Dist APFB06.GainWorld.Rc APFB06.GainWorld.instDecidableEqRc S
APFB06.GainWorld.fam))
(∀ (d : APFB06.GainWorld.Dist),
@Membership.mem.{0, 0} APFB06.GainWorld.Dist (Finset.{0} APFB06.GainWorld.Dist)
(@SetLike.instMembership.{0, 0} (Finset.{0} APFB06.GainWorld.Dist) APFB06.GainWorld.Dist
(@Finset.instSetLike.{0} APFB06.GainWorld.Dist))
S d →
@Exists.{1} (Set.{0} APFB06.GainWorld.Rc) fun (sigma : Set.{0} APFB06.GainWorld.Rc) =>
And
(@LE.le.{0} (Set.{0} APFB06.GainWorld.Rc) (@Set.instLE.{0} APFB06.GainWorld.Rc) sigma
(APFB06.GainWorld.maint Unit.unit p))
(And (APFB06.GainWorld.suff Unit.unit p sigma d) (APFB06.GainWorld.uses Unit.unit p d sigma))) := by sorry
Source
['Theorems.Thm_APFB06_gain_world:370; USB pullbacks v58 batch A; SHA-256 1cae0e0b41345b20eac454a92e1ad28c254a1894fad87bc4f8c7d4dc39a3733c']