Theorems · Theorem · combinatorics
Multiset.filter.congr_simp
∀ {α : Type u_1} (p p_1 : α → Prop),
p = p_1 →
∀ {inst : DecidablePred p} [inst_1 : DecidablePred p_1] (s s_1 : Multiset α),
s = s_1 → Multiset.filter p s = Multiset.filter p_1 s_1- Defined in
- Mathlib.Data.Multiset.Filter
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses propext, Quot.sound
- Assumes
- DecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
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.filterstatement and proof · cited by 102
Cited by5
Results whose statement or proof uses this declaration.
- Multiset.filter_attach'proof · cited by 1
- Multiset.filter_joinproof · cited by 1
- Multiset.filter_subproof · cited by 1
- Multiset.filter_nsmulproof · cited by 0
- Equiv.Perm.CycleType.count_defproof · cited by 0