Theorems · Theorem · combinatorics
Finset.HasAntidiagonal.antidiagonal.fst_le
∀ {A : Type u_1} [inst : AddCommMonoid A] [inst_1 : PartialOrder A] [CanonicallyOrderedAdd A]
[inst_3 : Finset.HasAntidiagonal A] {n : A} {kl : A × A}, kl ∈ Finset.HasAntidiagonal.antidiagonal n → kl.1 ≤ n- Defined in
- Mathlib.Algebra.Order.Antidiag.Prod
- Cited by
- 6 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.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- PartialOrderstatement and proof · cited by 6,410
- CanonicallyOrderedAddstatement and proof · cited by 229
- Finset.HasAntidiagonal.antidiagonalstatement and proof · cited by 218
- Finset.HasAntidiagonal.mem_antidiagonalproof · cited by 51
- Finset.HasAntidiagonalstatement and proof · cited by 48
- le_iff_exists_addproof · cited by 16
Cited by6
Results whose statement or proof uses this declaration.
- PowerSeries.coeff_mul_mem_ideal_mul_ideal_of_coeff_mem_idealproof · cited by 4
- PowerSeries.trunc_trunc_mulproof · cited by 4
- PowerSeries.IsWeierstrassDivision.isUnit_of_map_ne_zeroproof · cited by 2
- Ring.add_choose_eqproof · cited by 1
- BinaryTree.treesOfNumNodesEq_card_eq_catalanproof · cited by 1
- Finset.Nat.antidiagonal.fst_ltproof · cited by 0