Theorems · Theorem · combinatorics
Finset.mem_finsuppAntidiag
∀ {ι : Type u_1} {μ : Type u_2} [inst : DecidableEq ι] [inst_1 : AddCommMonoid μ] [inst_2 : Finset.HasAntidiagonal μ]
[inst_3 : DecidableEq μ] {s : Finset ι} {n : μ} {f : ι →₀ μ}, f ∈ s.finsuppAntidiag n ↔ s.sum ⇑f = n ∧ f.support ⊆ s- Defined in
- Mathlib.Algebra.Order.Antidiag.Finsupp
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 92 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
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
- AddCommMonoidstatement and proof · cited by 12,281
- Finsuppstatement and proof · cited by 5,255
- Finset.sumstatement and proof · cited by 5,195
- Finset.filterproof · cited by 949
- Finsupp.supportstatement · cited by 828
- Finset.mapproof · cited by 747
- Finset.attachproof · cited by 168
- Finset.filter_congrproof · cited by 167
- Finset.HasAntidiagonalstatement and proof · cited by 48
- Finset.finsuppAntidiagstatement · cited by 25
Cited by2
Results whose statement or proof uses this declaration.
- MvPowerSeries.coeff_eq_zero_of_constantCoeff_nilpotentproof · cited by 2
- MvPowerSeries.truncTotal_subst_eq_truncTotal_subst_truncTotal_of_leproof · cited by 1