Theorems · Theorem · combinatorics
Multiset.Rel.countP_eq
∀ {α : Type u_1} (r : α → α → Prop) [IsTrans α r] [Std.Symm r] {s t : Multiset α} (x : α) [inst : DecidablePred (r x)],
Multiset.Rel r s t → Multiset.countP (r x) s = Multiset.countP (r x) t- Defined in
- Mathlib.Data.Multiset.Count
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 23 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- IsTransStd.SymmDecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
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.consproof · cited by 313
- IsTransstatement and proof · cited by 157
- transproof · cited by 111
- Multiset.induction_onproof · cited by 109
- symmproof · cited by 48
- Multiset.Relstatement and proof · cited by 47
- Multiset.countPstatement and proof · cited by 28
- if_congrproof · cited by 12
- Multiset.rel_cons_leftproof · cited by 3
- Multiset.countP_consproof · cited by 3
- Multiset.rel_zero_leftproof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.