Theorems · Theorem · combinatorics
Finset.HasAntidiagonal.antidiagonal_congr
∀ {A : Type u_1} [inst : AddCancelMonoid A] [inst_1 : Finset.HasAntidiagonal A] {p q : A × A} {n : A},
p ∈ Finset.HasAntidiagonal.antidiagonal n → q ∈ Finset.HasAntidiagonal.antidiagonal n → (p = q ↔ p.1 = q.1)A point in the antidiagonal is determined by its first coordinate.
See also Finset.antidiagonal_congr'.
- Defined in
- Mathlib.Algebra.Order.Antidiag.Prod
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 55 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- Finset.HasAntidiagonal.antidiagonalstatement and proof · cited by 218
- add_right_injproof · cited by 71
- Finset.HasAntidiagonal.mem_antidiagonalproof · cited by 51
- Finset.HasAntidiagonalstatement and proof · cited by 48
- AddCancelMonoidstatement and proof · cited by 23
Cited by4
Results whose statement or proof uses this declaration.
- PowerSeries.IsWeierstrassDivision.isUnit_of_map_ne_zeroproof · cited by 2
- bernoulli_spec'proof · cited by 1
- Finset.HasAntidiagonal.antidiagonal_congr'proof · cited by 1
- Finset.HasAntidiagonal.antidiagonal_subtype_extproof · cited by 1