Theorems · Theorem · combinatorics
Finset.HasMulAntidiagonal.mem_mulAntidiagonal
∀ {A : Type u_1} {inst : Monoid A} [self : Finset.HasMulAntidiagonal A] {n : A} {a : A × A},
a ∈ Finset.HasMulAntidiagonal.mulAntidiagonal n ↔ a.1 * a.2 = nA pair belongs to mulAntidiagonal n iff the product of its components is equal to n.
- Defined in
- Mathlib.Algebra.Order.Antidiag.Prod
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 54 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Finset.HasMulAntidiagonal
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- Monoidstatement and proof · cited by 3,887
- Finset.HasMulAntidiagonal.mulAntidiagonalstatement · cited by 17
- Finset.HasMulAntidiagonalstatement and proof · cited by 16
Cited by3
Results whose statement or proof uses this declaration.
- Finset.HasMulAntidiagonal.mulAntidiagonal_congrproof · cited by 2
- Finset.HasMulAntidiagonal.mulAntidiagonal.fst_leproof · cited by 0
- Finset.HasMulAntidiagonal.mulAntidiagonal.snd_leproof · cited by 0