Theorems · Theorem · combinatorics
Multiset.le_bind
∀ {α : Type u_4} {β : Type u_5} {f : α → Multiset β} (S : Multiset α) {x : α}, x ∈ S → f x ≤ S.bind f- Defined in
- Mathlib.Data.Multiset.Bind
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Multisetstatement and proof · cited by 2,627
- Multiset.mapproof · cited by 876
- Multiset.sumproof · cited by 388
- Multiset.consproof · cited by 313
- Multiset.countproof · cited by 302
- Multiset.bindstatement · cited by 59
- Multiset.sum_consproof · cited by 45
- Multiset.exists_cons_of_memproof · cited by 15
- Multiset.le_iff_countproof · cited by 14
- Multiset.mem_map_of_memproof · cited by 8
- Multiset.count_bindproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.