Theorems · Theorem
Multiset.hasFiniteSupport_count
∀ {α : Type u_1} [inst : DecidableEq α] (s : Multiset α), Function.HasFiniteSupport fun x => Multiset.count x s- Defined in
- Mathlib.Algebra.FiniteSupport.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 75 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.
Cites6
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.countstatement · cited by 302
- Set.Finite.subsetproof · cited by 285
- Multiset.toFinsetproof · cited by 230
- Finset.finite_toSetproof · cited by 210
- Function.HasFiniteSupportstatement · cited by 113
Cited by1
Results whose statement or proof uses this declaration.
- UniqueFactorizationMonoid.hasFiniteMulSupport_fun_pow_multiplicityproof · cited by 1