Finite-form needs lie in every sufficient set
ProvedAPFPaper1.RecordLedger.needsFin_subset_of_sufficientapfapf-referencesib-v66-pullbacks-v22-2026-11
For a RecordLedger, any record set sufficient for d contains needsFin(d), including its empty fallback when needs is infinite.
Publication scope: needsFin containment also holds in its empty fallback case. Equality with needs requires a sufficient set inside an actually finite kept set. Theorems of this representation do not prove its physical universality or availability.
Preamble
import Definitions.Def_APFPaper1_RecordLedger
import Mathlib.Data.NNReal.Basic
set_option autoImplicit false
namespace APFPaper1.RecordLedger
end APFPaper1.RecordLedger
open APFPaper1
open APFPaper1.RecordLedger
variable {D P Record : Type*} (L : RecordLedger D P Record)
Formal statement
theorem APFPaper1.RecordLedger.needsFin_subset_of_sufficient (p : P) (sigma : Set Record) (d : D)
(h : L.sufficient p sigma d) : (↑(L.needsFin d) : Set Record) ⊆ sigma := by sorry
Source
['C:/Users/brook/My Drive/__APF Library/Artifacts_2026-11-15_session/astra/sib_v66_publication/source/Theorems/Thm_APFPaper1_RecordLedger_laws.lean:46 (source SHA256 2a39a7656440238ff3229c3e16cdfa9575022faf7490a9d1758f921e122dff19; APFPaper1.RecordLedger.needsFin_subset_of_sufficient)', 'C:/Users/brook/My Drive/__APF Library/Artifacts_2026-11-15_session/astra/sib_v66_publication/reviews/rv2_v66_v22_review.json (SHA256 365ce42aeeada41fa76b7443fe2b5af6017c7fdeb2bb28169266b6dbba622948; modules[Theorems.Thm_APFPaper1_RecordLedger_laws].declarations[APFPaper1.RecordLedger.needsFin_subset_of_sufficient])']