Theorems · Theorem · combinatorics
Finset.count_coe_finsuppAntidiagEquiv_apply
∀ {ι : Type u_1} [inst : DecidableEq ι] {s : Finset ι} (n : ℕ) (f : ↥(s.finsuppAntidiag n)) (a : ↥s),
Multiset.count a ↑((s.finsuppAntidiagEquiv n) f) = ↑f ↑a- Cited by
- 0 results in Mathlib
- Foundations
- Depth 99 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.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Finsetstatement and proof · cited by 13,712
- Equivstatement · cited by 8,337
- Finsuppstatement and proof · cited by 5,255
- Multiset.countstatement · cited by 302
- Symstatement · cited by 150
- Sym.toMultisetstatement and proof · cited by 51
- Finsupp.toMultisetproof · cited by 44
- Finsupp.subtypeDomainproof · cited by 26
- Finset.finsuppAntidiagstatement and proof · cited by 25
- Multiset.count.congr_simpproof · cited by 22
- Finsupp.count_toMultisetproof · cited by 10
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.