Theorems · Theorem · order theory
DFinsupp.lex_lt_of_lt_of_preorder
∀ {ι : Type u_1} {α : ι → Type u_2} [inst : (i : ι) → Zero (α i)] [inst_1 : (i : ι) → Preorder (α i)] (r : ι → ι → Prop)
[IsStrictOrder ι r] {x y : Π₀ (i : ι), α i}, x < y → ∃ i, (∀ (j : ι), r j i → x j ≤ y j ∧ y j ≤ x j) ∧ x i < y i- Defined in
- Mathlib.Data.DFinsupp.Lex
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 91 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- ZeroPreorderIsStrictOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites18
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- SetLike.coeproof · cited by 8,199
- Preorderstatement and proof · cited by 7,952
- Set.ofPredproof · cited by 6,101
- LT.lt.neproof · cited by 872
- DFinsuppstatement and proof · cited by 694
- Finset.finite_toSetproof · cited by 210
- Set.WellFoundedOnproof · cited by 53
- Subrelproof · cited by 53
- of_not_notproof · cited by 51
- IsStrictOrderstatement and proof · cited by 28
- DFinsupp.neLocusproof · cited by 26
Cited by3
Results whose statement or proof uses this declaration.
- DFinsupp.lex_lt_of_ltproof · cited by 1
- Finsupp.lex_lt_of_lt_of_preorderproof · cited by 0
- DFinsupp.wellFoundedLTproof · cited by 0