Theorems · Theorem · combinatorics
Finset.HasAntidiagonal.antidiagonal_subtype_ext
∀ {A : Type u_1} [inst : AddCancelMonoid A] [inst_1 : Finset.HasAntidiagonal A] {n : A}
{p q : ↥(Finset.HasAntidiagonal.antidiagonal n)}, (↑p).1 = (↑q).1 → p = qA point in the antidiagonal is determined by its first co-ordinate (subtype version of
Finset.antidiagonal_congr). This lemma is used by the ext tactic.
- Defined in
- Mathlib.Algebra.Order.Antidiag.Prod
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 56 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
- Subtype.propproof · cited by 505
- Finset.HasAntidiagonal.antidiagonalstatement and proof · cited by 218
- Finset.HasAntidiagonalstatement and proof · cited by 48
- AddCancelMonoidstatement and proof · cited by 23
- Finset.HasAntidiagonal.antidiagonal_congrproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- Finset.HasAntidiagonal.antidiagonal_subtype_ext_iffproof · cited by 0