Theorems · Theorem · combinatorics
Finset.nsmul_piAntidiag
∀ {ι : Type u_1} [inst : DecidableEq ι] [inst_1 : DecidableEq (ι → ℕ)] (s : Finset ι) (m : ℕ) {n : ℕ},
n ≠ 0 → n • s.piAntidiag m = {f ∈ s.piAntidiag (n * m) | ∀ i ∈ s, n ∣ f i}- Defined in
- Mathlib.Algebra.Order.Antidiag.Pi
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 90 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
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
- Finset.sum_congrproof · cited by 2,323
- Finset.filterstatement · cited by 949
- Finset.extproof · cited by 565
- mul_div_cancel_left₀proof · cited by 111
- Finset.smulFinsetstatement · cited by 101
- dvd_zeroproof · cited by 63
- not_imp_commproof · cited by 56
- Finset.piAntidiagstatement · cited by 19
- Finset.mem_smul_finsetproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- Finset.map_nsmul_piAntidiagproof · cited by 1
- Finset.nsmul_piAntidiag_univproof · cited by 0