Under an equivalence of task types, every subfamily of a mapped finite family is the image of a subfamily of the original
ProvedAPFPaper1.Source.exists_subfamily_of_subset_mapapffoundation-ledgersib-v44-2026-11
Under an equivalence of task types, every subfamily of a mapped finite family is the image of a subfamily of the original.
Preamble
import Definitions.Def_APFPaper1_FamilyCost import Mathlib.Data.Finset.Image import Mathlib.Logic.Equiv.Defs set_option autoImplicit false namespace APFPaper1.Source end APFPaper1.Source open APFPaper1.Source
Formal statement
theorem APFPaper1.Source.exists_subfamily_of_subset_map {D D' : Type*} (e : D' ≃ D) (T : Finset D') (S : Finset D)
(h : S ⊆ T.map e.toEmbedding) : ∃ T' : Finset D', T' ⊆ T ∧ T'.map e.toEmbedding = S := by sorry
Source
Paper 1 Supplement v9.28:1313-1322,1761-1766,1774-1885,2624-2625,2777-2782,7101