Theorems · Theorem · combinatorics
Finset.map_sym_eq_piAntidiag
∀ {ι : Type u_1} [inst : DecidableEq ι] (s : Finset ι) (n : ℕ),
Finset.map { toFun := fun m a => Multiset.count a ↑m, inj' := ⋯ } (s.sym n) = s.piAntidiag n- Defined in
- Mathlib.Algebra.Order.Antidiag.Pi
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 90 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.
Cites25
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Finset.sumproof · cited by 5,195
- mul_oneproof · cited by 3,885
- Multisetstatement and proof · cited by 2,627
- Finset.sum_congrproof · cited by 2,323
- MulZeroClass.mul_zeroproof · cited by 2,091
- Finset.mapstatement · cited by 747
- Finset.extproof · cited by 565
- Multiset.cardstatement and proof · cited by 375
- Multiset.countstatement and proof · cited by 302
- mul_iteproof · cited by 159
- Symstatement and proof · cited by 150
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.