Theorems · Theorem · combinatorics
Multiset.map_fst_le_of_subset_toEnumFinset
∀ {α : Type u_1} [inst : DecidableEq α] {m : Multiset α} {s : Finset (α × ℕ)},
s ⊆ m.toEnumFinset → Multiset.map Prod.fst s.val ≤ m- Defined in
- Mathlib.Data.Multiset.Fintype
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites19
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Multisetstatement and proof · cited by 2,627
- SProd.sprodproof · cited by 1,750
- Finset.rangeproof · cited by 1,341
- Finset.filterproof · cited by 949
- Multiset.mapstatement · cited by 876
- LE.le.trans_ltproof · cited by 795
- Finset.valstatement and proof · cited by 438
- Multiset.cardproof · cited by 375
- Multiset.countproof · cited by 302
- Finset.filter_congrproof · cited by 167
- Multiset.filterproof · cited by 102
Cited by3
Results whose statement or proof uses this declaration.
- Int.erdos_ginzburg_ziv_multisetproof · cited by 0
- Multiset.toEnumFinset_subset_iffproof · cited by 0
- ZMod.erdos_ginzburg_ziv_multisetproof · cited by 0