Theorems · Theorem · combinatorics
Finset.mem_finsupp_iff
∀ {ι : Type u_1} {α : Type u_2} [inst : Zero α] {s : Finset ι} {f : ι →₀ α} {t : ι → Finset α},
f ∈ s.finsupp t ↔ f.support ⊆ s ∧ ∀ i ∈ s, f i ∈ t i- Defined in
- Mathlib.Data.Finset.Finsupp
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 66 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Zero
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Finsetstatement and proof · cited by 13,712
- Finsuppstatement and proof · cited by 5,255
- Finsupp.supportstatement and proof · cited by 828
- Finsupp.extproof · cited by 399
- Finsupp.notMem_support_iffproof · cited by 44
- Finset.mem_mapproof · cited by 32
- Finset.piproof · cited by 23
- Finsupp.indicatorproof · cited by 22
- Finset.mem_piproof · cited by 5
- Finsupp.support_indicator_subsetproof · cited by 5
- Finsupp.indicator_of_memproof · cited by 5
Cited by1
Results whose statement or proof uses this declaration.
- Finset.mem_finsupp_iff_of_support_subsetproof · cited by 1