Theorems · Theorem · combinatorics
Multiset.bind_congr
∀ {α : Type u_1} {β : Type v} {f g : α → Multiset β} {m : Multiset α}, (∀ a ∈ m, f a = g a) → m.bind f = m.bind g- Defined in
- Mathlib.Data.Multiset.Bind
- Cited by
- 15 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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.map_congrproof · cited by 232
- Multiset.bindstatement · cited by 59
- Multiset.joinproof · cited by 21
Cited by15
Results whose statement or proof uses this declaration.
- Matrix.IsHermitian.roots_charpoly_eq_eigenvaluesproof · cited by 4
- LinearMap.IsSymmetric.roots_charpoly_eq_eigenvaluesproof · cited by 4
- Polynomial.roots_multiset_prod_X_sub_Cproof · cited by 3
- Polynomial.roots_prod_X_sub_Cproof · cited by 2
- Multiset.bind_powerset_lenproof · cited by 2
- Multiset.pi_coeproof · cited by 1
- Multiset.product_consproof · cited by 1
- Multiset.sections_addproof · cited by 0
- Multiset.bind_bindproof · cited by 0
- Multiset.bind_filterproof · cited by 0
- Multiset.bind_filterMapproof · cited by 0
- Multiset.bind_hcongrproof · cited by 0