Loogle!
Result
Found 177 declarations mentioning toLex.
- toLex 📋 Mathlib.Order.Lex
{α : Type u_1} : α ≃ Lex α - ofLex_symm_eq 📋 Mathlib.Order.Lex
{α : Type u_1} : ofLex.symm = toLex - toLex_symm_eq 📋 Mathlib.Order.Lex
{α : Type u_1} : toLex.symm = ofLex - Lex.rec 📋 Mathlib.Order.Lex
{α : Type u_1} {β : Lex α → Sort u_2} (h : (a : α) → β (toLex a)) (a : Lex α) : β a - Lex.forall 📋 Mathlib.Order.Lex
{α : Type u_1} {p : Lex α → Prop} : (∀ (a : Lex α), p a) ↔ ∀ (a : α), p (toLex a) - Lex.exists 📋 Mathlib.Order.Lex
{α : Type u_1} {p : Lex α → Prop} : (∃ a, p a) ↔ ∃ a, p (toLex a) - ofLex_toLex 📋 Mathlib.Order.Lex
{α : Type u_1} (a : α) : ofLex (toLex a) = a - toLex_ofLex 📋 Mathlib.Order.Lex
{α : Type u_1} (a : Lex α) : toLex (ofLex a) = a - toLex_inj 📋 Mathlib.Order.Lex
{α : Type u_1} {a b : α} : toLex a = toLex b ↔ a = b - toLex_one 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [One α] : toLex 1 = 1 - toLex_zero 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [Zero α] : toLex 0 = 0 - isAddLeftRegular_toLex 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [AddMonoid α] {a : α} : IsAddLeftRegular (toLex a) ↔ IsAddLeftRegular a - isAddRegular_toLex 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [AddMonoid α] {a : α} : IsAddRegular (toLex a) ↔ IsAddRegular a - isAddRightRegular_toLex 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [AddMonoid α] {a : α} : IsAddRightRegular (toLex a) ↔ IsAddRightRegular a - isLeftRegular_toLex 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [Monoid α] {a : α} : IsLeftRegular (toLex a) ↔ IsLeftRegular a - isRegular_toLex 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [Monoid α] {a : α} : IsRegular (toLex a) ↔ IsRegular a - isRightRegular_toLex 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [Monoid α] {a : α} : IsRightRegular (toLex a) ↔ IsRightRegular a - toLex_eq_one 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [One α] {a : α} : toLex a = 1 ↔ a = 1 - toLex_eq_zero 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [Zero α] {a : α} : toLex a = 0 ↔ a = 0 - pow_toLex 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} {β : Type u_2} [Pow α β] (a : α) (b : β) : a ^ toLex b = a ^ b - toLex_smul' 📋 Mathlib.Algebra.Order.Group.Synonym
{β : Type u_2} {α : Type u_1} [SMul β α] (b : β) (a : α) : toLex b • a = b • a - toLex_vadd' 📋 Mathlib.Algebra.Order.Group.Synonym
{β : Type u_2} {α : Type u_1} [VAdd β α] (b : β) (a : α) : toLex b +ᵥ a = b +ᵥ a - toLex_inv 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [Inv α] (a : α) : toLex a⁻¹ = (toLex a)⁻¹ - toLex_neg 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [Neg α] (a : α) : toLex (-a) = -toLex a - toLex_pow 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} {β : Type u_2} [Pow α β] (a : α) (b : β) : toLex (a ^ b) = toLex a ^ b - toLex_smul 📋 Mathlib.Algebra.Order.Group.Synonym
{β : Type u_2} {α : Type u_1} [SMul β α] (b : β) (a : α) : toLex (b • a) = b • toLex a - toLex_vadd 📋 Mathlib.Algebra.Order.Group.Synonym
{β : Type u_2} {α : Type u_1} [VAdd β α] (b : β) (a : α) : toLex (b +ᵥ a) = b +ᵥ toLex a - toLex_add 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [Add α] (a b : α) : toLex (a + b) = toLex a + toLex b - toLex_div 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [Div α] (a b : α) : toLex (a / b) = toLex a / toLex b - toLex_mul 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [Mul α] (a b : α) : toLex (a * b) = toLex a * toLex b - toLex_sub 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [Sub α] (a b : α) : toLex (a - b) = toLex a - toLex b - toLex_intCast 📋 Mathlib.Algebra.Order.Ring.Synonym
{R : Type u_1} [IntCast R] (n : ℤ) : toLex ↑n = ↑n - toLex_natCast 📋 Mathlib.Algebra.Order.Ring.Synonym
{R : Type u_1} [NatCast R] (n : ℕ) : toLex ↑n = ↑n - toLex_ofNat 📋 Mathlib.Algebra.Order.Ring.Synonym
{R : Type u_1} [NatCast R] (n : ℕ) [n.AtLeastTwo] : toLex (OfNat.ofNat n) = OfNat.ofNat n - toLex_ratCast 📋 Mathlib.Algebra.Field.Basic
{K : Type u_1} [RatCast K] (n : ℚ) : toLex ↑n = ↑n - Prod.Lex.toLex_mono 📋 Mathlib.Data.Prod.Lex
{α : Type u_1} {β : Type u_2} [PartialOrder α] [Preorder β] : Monotone ⇑toLex - Prod.Lex.toLex_strictMono 📋 Mathlib.Data.Prod.Lex
{α : Type u_1} {β : Type u_2} [PartialOrder α] [Preorder β] : StrictMono ⇑toLex - Prod.Lex.toLex_ge_toLex 📋 Mathlib.Data.Prod.Lex
{α : Type u_1} {β : Type u_2} [LT α] [LE β] {x y : α × β} : toLex y ≤ toLex x ↔ y.1 < x.1 ∨ x.1 = y.1 ∧ y.2 ≤ x.2 - Prod.Lex.toLex_gt_toLex 📋 Mathlib.Data.Prod.Lex
{α : Type u_1} {β : Type u_2} [LT α] [LT β] {x y : α × β} : toLex y < toLex x ↔ y.1 < x.1 ∨ x.1 = y.1 ∧ y.2 < x.2 - Prod.Lex.toLex_le_toLex 📋 Mathlib.Data.Prod.Lex
{α : Type u_1} {β : Type u_2} [LT α] [LE β] {x y : α × β} : toLex x ≤ toLex y ↔ x.1 < y.1 ∨ x.1 = y.1 ∧ x.2 ≤ y.2 - Prod.Lex.toLex_lt_toLex 📋 Mathlib.Data.Prod.Lex
{α : Type u_1} {β : Type u_2} [LT α] [LT β] {x y : α × β} : toLex x < toLex y ↔ x.1 < y.1 ∨ x.1 = y.1 ∧ x.2 < y.2 - Prod.Lex.toLex_covBy_toLex_iff 📋 Mathlib.Data.Prod.Lex
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {a₁ a₂ : α} {b₁ b₂ : β} : toLex (a₁, b₁) ⋖ toLex (a₂, b₂) ↔ a₁ = a₂ ∧ b₁ ⋖ b₂ ∨ a₁ ⋖ a₂ ∧ IsMax b₁ ∧ IsMin b₂ - Prod.Lex.toLex_le_toLex' 📋 Mathlib.Data.Prod.Lex
{α : Type u_1} {β : Type u_2} [PartialOrder α] [Preorder β] {x y : α × β} : toLex x ≤ toLex y ↔ x.1 ≤ y.1 ∧ (x.1 = y.1 → x.2 ≤ y.2) - Prod.Lex.toLex_lt_toLex' 📋 Mathlib.Data.Prod.Lex
{α : Type u_1} {β : Type u_2} [PartialOrder α] [Preorder β] {x y : α × β} : toLex x < toLex y ↔ x.1 ≤ y.1 ∧ (x.1 = y.1 → x.2 < y.2) - Set.PartiallyWellOrderedOn.fiberProdLex 📋 Mathlib.Order.WellFoundedSet
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] {s : Set (Lex (α × β))} (hαβ : s.IsPWO) (a : α) : {y | toLex (a, y) ∈ s}.IsPWO - Set.PartiallyWellOrderedOn.subsetProdLex 📋 Mathlib.Order.WellFoundedSet
{α : Type u_2} {β : Type u_3} [PartialOrder α] [Preorder β] {s : Set (Lex (α × β))} (hα : ((fun x => (ofLex x).1) '' s).IsPWO) (hβ : ∀ (a : α), {y | toLex (a, y) ∈ s}.IsPWO) : s.IsPWO - Set.PartiallyWellOrderedOn.ProdLex_iff 📋 Mathlib.Order.WellFoundedSet
{α : Type u_2} {β : Type u_3} [PartialOrder α] [Preorder β] {s : Set (Lex (α × β))} : s.IsPWO ↔ ((fun x => (ofLex x).1) '' s).IsPWO ∧ ∀ (a : α), {y | toLex (a, y) ∈ s}.IsPWO - Sum.Lex.toLex_mono 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] : Monotone ⇑toLex - Sum.Lex.toLex_strictMono 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] : StrictMono ⇑toLex - Sum.Lex.inl_mono 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] : Monotone (⇑toLex ∘ Sum.inl) - Sum.Lex.inl_strictMono 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] : StrictMono (⇑toLex ∘ Sum.inl) - Sum.Lex.inr_mono 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] : Monotone (⇑toLex ∘ Sum.inr) - Sum.Lex.inr_strictMono 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] : StrictMono (⇑toLex ∘ Sum.inr) - Sum.Lex.inl_bot 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LE α] [OrderBot α] [LE β] : toLex (Sum.inl ⊥) = ⊥ - Sum.Lex.inr_top 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LE α] [LE β] [OrderTop β] : toLex (Sum.inr ⊤) = ⊤ - OrderIso.emptySumLex_apply_inr 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LE α] [LE β] [IsEmpty β] (x : α) : OrderIso.emptySumLex (toLex (Sum.inr x)) = x - OrderIso.sumLexEmpty_apply_inl 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LE α] [LE β] [IsEmpty β] (x : α) : OrderIso.sumLexEmpty (toLex (Sum.inl x)) = x - Sum.Lex.inl_le_inr 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LE α] [LE β] (a : α) (b : β) : toLex (Sum.inl a) ≤ toLex (Sum.inr b) - Sum.Lex.inl_lt_inr 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LT α] [LT β] (a : α) (b : β) : toLex (Sum.inl a) < toLex (Sum.inr b) - Sum.Lex.not_inr_le_inl 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LE α] [LE β] {a : α} {b : β} : ¬toLex (Sum.inr b) ≤ toLex (Sum.inl a) - Sum.Lex.not_inr_lt_inl 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LT α] [LT β] {a : α} {b : β} : ¬toLex (Sum.inr b) < toLex (Sum.inl a) - Sum.Lex.inl_le_inl_iff 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LE α] [LE β] {a b : α} : toLex (Sum.inl a) ≤ toLex (Sum.inl b) ↔ a ≤ b - Sum.Lex.inl_lt_inl_iff 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LT α] [LT β] {a b : α} : toLex (Sum.inl a) < toLex (Sum.inl b) ↔ a < b - Sum.Lex.inr_le_inr_iff 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LE α] [LE β] {a b : β} : toLex (Sum.inr a) ≤ toLex (Sum.inr b) ↔ a ≤ b - Sum.Lex.inr_lt_inr_iff 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LT α] [LT β] {a b : β} : toLex (Sum.inr a) < toLex (Sum.inr b) ↔ a < b - WithBot.orderIsoPUnitSumLex_toLex 📋 Mathlib.Data.Sum.Order
{α : Type u_1} [LE α] (a : α) : WithBot.orderIsoPUnitSumLex ↑a = toLex (Sum.inr a) - WithTop.orderIsoSumLexPUnit_toLex 📋 Mathlib.Data.Sum.Order
{α : Type u_1} [LE α] (a : α) : WithTop.orderIsoSumLexPUnit ↑a = toLex (Sum.inl a) - WithBot.orderIsoPUnitSumLex_bot 📋 Mathlib.Data.Sum.Order
{α : Type u_1} [LE α] : WithBot.orderIsoPUnitSumLex ⊥ = toLex (Sum.inl PUnit.unit) - WithTop.orderIsoSumLexPUnit_top 📋 Mathlib.Data.Sum.Order
{α : Type u_1} [LE α] : WithTop.orderIsoSumLexPUnit ⊤ = toLex (Sum.inr PUnit.unit) - Sum.Lex.toLex_le_toLex 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LE α] [LE β] {a b : α ⊕ β} : toLex a ≤ toLex b ↔ Sum.Lex (fun x1 x2 => x1 ≤ x2) (fun x1 x2 => x1 ≤ x2) a b - Sum.Lex.toLex_lt_toLex 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LT α] [LT β] {a b : α ⊕ β} : toLex a < toLex b ↔ Sum.Lex (fun x1 x2 => x1 < x2) (fun x1 x2 => x1 < x2) a b - WithBot.orderIsoPUnitSumLex_symm_inr 📋 Mathlib.Data.Sum.Order
{α : Type u_1} [LE α] (a : α) : WithBot.orderIsoPUnitSumLex.symm (toLex (Sum.inr a)) = ↑a - WithTop.orderIsoSumLexPUnit_symm_inl 📋 Mathlib.Data.Sum.Order
{α : Type u_1} [LE α] (a : α) : WithTop.orderIsoSumLexPUnit.symm (toLex (Sum.inl a)) = ↑a - WithBot.orderIsoPUnitSumLex_symm_inl 📋 Mathlib.Data.Sum.Order
{α : Type u_1} [LE α] (x : PUnit.{u_4 + 1}) : WithBot.orderIsoPUnitSumLex.symm (toLex (Sum.inl x)) = ⊥ - WithTop.orderIsoSumLexPUnit_symm_inr 📋 Mathlib.Data.Sum.Order
{α : Type u_1} [LE α] (x : PUnit.{u_4 + 1}) : WithTop.orderIsoSumLexPUnit.symm (toLex (Sum.inr x)) = ⊤ - Sum.Lex.toLexRelIsoLE_coe 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LE α] [LE β] : ⇑Sum.Lex.toLexRelIsoLE = ⇑toLex - Sum.Lex.toLexRelIsoLT_coe 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} [LT α] [LT β] : ⇑Sum.Lex.toLexRelIsoLT = ⇑toLex - OrderIso.sumLexCongr_apply 📋 Mathlib.Data.Sum.Order
{α₁ : Type u_4} {α₂ : Type u_5} {β₁ : Type u_6} {β₂ : Type u_7} [LE α₁] [LE α₂] [LE β₁] [LE β₂] (ea : α₁ ≃o α₂) (eb : β₁ ≃o β₂) (a✝ : α₁ ⊕ₗ β₁) : (ea.sumLexCongr eb) a✝ = toLex (Sum.map (⇑ea) (⇑eb) (ofLex a✝)) - OrderIso.sumLexAssoc_apply_inl_inl 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [LE α] [LE β] [LE γ] (a : α) : (OrderIso.sumLexAssoc α β γ) (toLex (Sum.inl (toLex (Sum.inl a)))) = toLex (Sum.inl a) - OrderIso.sumLexAssoc_apply_inr 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [LE α] [LE β] [LE γ] (c : γ) : (OrderIso.sumLexAssoc α β γ) (toLex (Sum.inr c)) = toLex (Sum.inr (toLex (Sum.inr c))) - OrderIso.sumLexAssoc_apply_inl_inr 📋 Mathlib.Data.Sum.Order
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [LE α] [LE β] [LE γ] (b : β) : (OrderIso.sumLexAssoc α β γ) (toLex (Sum.inl (toLex (Sum.inr b)))) = toLex (Sum.inr (toLex (Sum.inl b))) - Prod.Lex.prodLexCongr_apply 📋 Mathlib.Order.Hom.Lex
{α : Type u_4} {β : Type u_5} {γ : Type u_6} {δ : Type u_7} [Preorder α] [Preorder β] [Preorder γ] [Preorder δ] (ea : α ≃o β) (eb : γ ≃o δ) (a✝ : Lex (α × γ)) : (Prod.Lex.prodLexCongr ea eb) a✝ = toLex (Prod.map (⇑ea) (⇑eb) (ofLex a✝)) - Prod.Lex.sumLexProdLexDistrib_apply 📋 Mathlib.Order.Hom.Lex
(α : Type u_4) (β : Type u_5) (γ : Type u_6) [Preorder α] [Preorder β] [Preorder γ] (a✝ : Lex ((α ⊕ₗ β) × γ)) : (Prod.Lex.sumLexProdLexDistrib α β γ) a✝ = toLex (Sum.map (⇑toLex) (⇑toLex) ((Equiv.sumProdDistrib α β γ) (Prod.map (⇑ofLex) id (ofLex a✝)))) - Prod.Lex.prodLexAssoc_apply 📋 Mathlib.Order.Hom.Lex
(α : Type u_4) (β : Type u_5) (γ : Type u_6) [Preorder α] [Preorder β] [Preorder γ] (a✝ : Lex (Lex (α × β) × γ)) : (Prod.Lex.prodLexAssoc α β γ) a✝ = toLex ((ofLex (ofLex a✝).1).1, toLex ((ofLex (ofLex a✝).1).2, (ofLex a✝).2)) - Prod.Lex.prodLexAssoc_symm_apply 📋 Mathlib.Order.Hom.Lex
(α : Type u_4) (β : Type u_5) (γ : Type u_6) [Preorder α] [Preorder β] [Preorder γ] (a✝ : Lex (α × Lex (β × γ))) : (RelIso.symm (Prod.Lex.prodLexAssoc α β γ)) a✝ = toLex (toLex ((ofLex a✝).1, (ofLex (ofLex a✝).2).1), (ofLex (ofLex a✝).2).2) - OrderIso.sumLexIicIoi_apply_inl 📋 Mathlib.Order.Hom.Lex
{α : Type u_1} [LinearOrder α] {x : α} (a : ↑(Set.Iic x)) : (OrderIso.sumLexIicIoi x) (toLex (Sum.inl a)) = ↑a - OrderIso.sumLexIicIoi_apply_inr 📋 Mathlib.Order.Hom.Lex
{α : Type u_1} [LinearOrder α] {x : α} (a : ↑(Set.Ioi x)) : (OrderIso.sumLexIicIoi x) (toLex (Sum.inr a)) = ↑a - OrderIso.sumLexIioIci_apply_inl 📋 Mathlib.Order.Hom.Lex
{α : Type u_1} [LinearOrder α] {x : α} (a : ↑(Set.Iio x)) : (OrderIso.sumLexIioIci x) (toLex (Sum.inl a)) = ↑a - OrderIso.sumLexIioIci_apply_inr 📋 Mathlib.Order.Hom.Lex
{α : Type u_1} [LinearOrder α] {x : α} (a : ↑(Set.Ici x)) : (OrderIso.sumLexIioIci x) (toLex (Sum.inr a)) = ↑a - Prod.Lex.sumLexProdLexDistrib_symm_apply 📋 Mathlib.Order.Hom.Lex
(α : Type u_4) (β : Type u_5) (γ : Type u_6) [Preorder α] [Preorder β] [Preorder γ] (a✝ : Lex (α × γ) ⊕ₗ Lex (β × γ)) : (RelIso.symm (Prod.Lex.sumLexProdLexDistrib α β γ)) a✝ = toLex (Prod.map (⇑toLex) id ((Equiv.sumProdDistrib α β γ).symm (Sum.map (⇑ofLex) (⇑ofLex) (ofLex a✝)))) - OrderIso.sumLexIioIci_symm_apply_Ici 📋 Mathlib.Order.Hom.Lex
{α : Type u_1} [LinearOrder α] {x : α} (a : ↑(Set.Ici x)) : (OrderIso.sumLexIioIci x).symm ↑a = toLex (Sum.inr a) - OrderIso.sumLexIioIci_symm_apply_Iio 📋 Mathlib.Order.Hom.Lex
{α : Type u_1} [LinearOrder α] {x : α} (a : ↑(Set.Iio x)) : (OrderIso.sumLexIioIci x).symm ↑a = toLex (Sum.inl a) - OrderIso.sumLexIicIoi_symm_apply_of_le 📋 Mathlib.Order.Hom.Lex
{α : Type u_1} [LinearOrder α] {x y : α} (h : y ≤ x) : (OrderIso.sumLexIicIoi x).symm y = toLex (Sum.inl ⟨y, h⟩) - OrderIso.sumLexIicIoi_symm_apply_of_lt 📋 Mathlib.Order.Hom.Lex
{α : Type u_1} [LinearOrder α] {x y : α} (h : x < y) : (OrderIso.sumLexIicIoi x).symm y = toLex (Sum.inr ⟨y, h⟩) - OrderIso.sumLexIioIci_symm_apply_of_ge 📋 Mathlib.Order.Hom.Lex
{α : Type u_1} [LinearOrder α] {x y : α} (h : x ≤ y) : (OrderIso.sumLexIioIci x).symm y = toLex (Sum.inr ⟨y, h⟩) - OrderIso.sumLexIioIci_symm_apply_of_lt 📋 Mathlib.Order.Hom.Lex
{α : Type u_1} [LinearOrder α] {x y : α} (h : y < x) : (OrderIso.sumLexIioIci x).symm y = toLex (Sum.inl ⟨y, h⟩) - Pi.toLex_apply 📋 Mathlib.Order.PiLex
{ι : Type u_1} {β : ι → Type u_2} (x : (i : ι) → β i) (i : ι) : toLex x i = x i - Pi.toLex_monotone 📋 Mathlib.Order.PiLex
{ι : Type u_1} {β : ι → Type u_2} [LinearOrder ι] [(i : ι) → PartialOrder (β i)] [WellFoundedLT ι] : Monotone ⇑toLex - Pi.toLex_strictMono 📋 Mathlib.Order.PiLex
{ι : Type u_1} {β : ι → Type u_2} [LinearOrder ι] [(i : ι) → PartialOrder (β i)] [WellFoundedLT ι] : StrictMono ⇑toLex - Pi.lex_desc 📋 Mathlib.Order.PiLex
{ι : Type u_1} {α : Type u_3} [Preorder ι] [DecidableEq ι] [LT α] {f : ι → α} {i j : ι} (h₁ : i ≤ j) (h₂ : f j < f i) : toLex (f ∘ ⇑(Equiv.swap i j)) < toLex f - Pi.le_toLex_update_self_iff 📋 Mathlib.Order.PiLex
{ι : Type u_1} {β : ι → Type u_2} [LinearOrder ι] {x : (i : ι) → β i} {i : ι} {a : β i} [(i : ι) → PartialOrder (β i)] [WellFoundedLT ι] : toLex x ≤ toLex (Function.update x i a) ↔ x i ≤ a - Pi.toLex_update_le_self_iff 📋 Mathlib.Order.PiLex
{ι : Type u_1} {β : ι → Type u_2} [LinearOrder ι] {x : (i : ι) → β i} {i : ι} {a : β i} [(i : ι) → PartialOrder (β i)] [WellFoundedLT ι] : toLex (Function.update x i a) ≤ toLex x ↔ a ≤ x i - Pi.lt_toLex_update_self_iff 📋 Mathlib.Order.PiLex
{ι : Type u_1} {β : ι → Type u_2} [LinearOrder ι] {x : (i : ι) → β i} {i : ι} {a : β i} [(i : ι) → PartialOrder (β i)] [WellFoundedLT ι] : toLex x < toLex (Function.update x i a) ↔ x i < a - Pi.toLex_update_lt_self_iff 📋 Mathlib.Order.PiLex
{ι : Type u_1} {β : ι → Type u_2} [LinearOrder ι] {x : (i : ι) → β i} {i : ι} {a : β i} [(i : ι) → PartialOrder (β i)] [WellFoundedLT ι] : toLex (Function.update x i a) < toLex x ↔ a < x i - Pi.apply_le_of_toLex 📋 Mathlib.Order.PiLex
{ι : Type u_1} {β : ι → Type u_2} [LinearOrder ι] {x y : (i : ι) → β i} {i : ι} [(i : ι) → LinearOrder (β i)] (hxy : toLex x ≤ toLex y) (h : ∀ j < i, x j = y j) : x i ≤ y i - DFinsupp.toLex_monotone 📋 Mathlib.Data.DFinsupp.Lex
{ι : Type u_1} {α : ι → Type u_2} [(i : ι) → Zero (α i)] [LinearOrder ι] [(i : ι) → PartialOrder (α i)] : Monotone ⇑toLex - Finsupp.toLex_monotone 📋 Mathlib.Data.Finsupp.Lex
{α : Type u_1} {N : Type u_2} [Zero N] [LinearOrder α] [PartialOrder N] : Monotone ⇑toLex - Finsupp.Lex.single_strictAnti 📋 Mathlib.Data.Finsupp.Lex
{α : Type u_1} [LinearOrder α] : StrictAnti fun a => toLex fun₀ | a => 1 - Finsupp.Lex.single_lt_iff 📋 Mathlib.Data.Finsupp.Lex
{α : Type u_1} [LinearOrder α] {a b : α} : ((toLex fun₀ | b => 1) < toLex fun₀ | a => 1) ↔ a < b - Finsupp.Lex.single_le_iff 📋 Mathlib.Data.Finsupp.Lex
{α : Type u_1} [LinearOrder α] {a b : α} : ((toLex fun₀ | b => 1) ≤ toLex fun₀ | a => 1) ↔ a ≤ b - MvPolynomial.leadingCoeff_toLex_C 📋 Mathlib.Algebra.MvPolynomial.Variables
{R : Type u} {σ : Type u_1} [CommSemiring R] [LinearOrder σ] (r : R) : AddMonoidAlgebra.leadingCoeff (⇑toLex) (MvPolynomial.C r) = r - MvPolynomial.supDegree_toLex_C 📋 Mathlib.Algebra.MvPolynomial.Variables
{R : Type u} {σ : Type u_1} [CommSemiring R] [LinearOrder σ] (r : R) : AddMonoidAlgebra.supDegree (⇑toLex) (MvPolynomial.C r) = 0 - MvPolynomial.leadingCoeff_toLex 📋 Mathlib.Algebra.MvPolynomial.Variables
{R : Type u} {σ : Type u_1} [CommSemiring R] {p : MvPolynomial σ R} [LinearOrder σ] : AddMonoidAlgebra.leadingCoeff (⇑toLex) p = p.coeff (ofLex (AddMonoidAlgebra.supDegree (⇑toLex) p)) - MonomialOrder.lex_lt_iff 📋 Mathlib.Data.Finsupp.MonomialOrder
{σ : Type u_1} [LinearOrder σ] [WellFoundedGT σ] {c d : σ →₀ ℕ} : MonomialOrder.lex.toSyn c < MonomialOrder.lex.toSyn d ↔ toLex c < toLex d - MonomialOrder.lex_le_iff 📋 Mathlib.Data.Finsupp.MonomialOrder
{σ : Type u_1} [LinearOrder σ] [WellFoundedGT σ] {c d : σ →₀ ℕ} : MonomialOrder.lex.toSyn c ≤ MonomialOrder.lex.toSyn d ↔ toLex c ≤ toLex d - Finsupp.DegLex.lt_def 📋 Mathlib.Data.Finsupp.MonomialOrder.DegLex
{α : Type u_1} [LT α] {a b : DegLex (α →₀ ℕ)} : a < b ↔ toLex (Finsupp.degree (ofDegLex a), toLex (ofDegLex a)) < toLex (Finsupp.degree (ofDegLex b), toLex (ofDegLex b)) - Finsupp.DegLex.lt_iff 📋 Mathlib.Data.Finsupp.MonomialOrder.DegLex
{α : Type u_1} [LT α] {a b : DegLex (α →₀ ℕ)} : a < b ↔ Finsupp.degree (ofDegLex a) < Finsupp.degree (ofDegLex b) ∨ Finsupp.degree (ofDegLex a) = Finsupp.degree (ofDegLex b) ∧ toLex (ofDegLex a) < toLex (ofDegLex b) - Finsupp.DegLex.le_iff 📋 Mathlib.Data.Finsupp.MonomialOrder.DegLex
{α : Type u_1} [LinearOrder α] {x y : DegLex (α →₀ ℕ)} : x ≤ y ↔ Finsupp.degree (ofDegLex x) < Finsupp.degree (ofDegLex y) ∨ Finsupp.degree (ofDegLex x) = Finsupp.degree (ofDegLex y) ∧ toLex (ofDegLex x) ≤ toLex (ofDegLex y) - toEquiv_toLexAddEquiv 📋 Mathlib.Algebra.Order.Group.Equiv
(α : Type u_1) [Add α] : ↑(toLexAddEquiv α) = toLex - toEquiv_toLexMulEquiv 📋 Mathlib.Algebra.Order.Group.Equiv
(α : Type u_1) [Mul α] : ↑(toLexMulEquiv α) = toLex - coe_toLexAddEquiv 📋 Mathlib.Algebra.Order.Group.Equiv
(α : Type u_1) [Add α] : ⇑(toLexAddEquiv α) = ⇑toLex - coe_toLexMulEquiv 📋 Mathlib.Algebra.Order.Group.Equiv
(α : Type u_1) [Mul α] : ⇑(toLexMulEquiv α) = ⇑toLex - Prod.Lex.toLexOrderHom_coe 📋 Mathlib.Order.Prod.Lex.Hom
{α : Type u_1} {β : Type u_2} [PartialOrder α] [Preorder β] (a : α × β) : Prod.Lex.toLexOrderHom a = toLex a - OrderAddMonoidHom.inrₗ_apply 📋 Mathlib.Algebra.Order.Monoid.Lex
(α : Type u_1) (β : Type u_2) [AddMonoid α] [PartialOrder α] [AddMonoid β] [Preorder β] (a✝ : β) : (OrderAddMonoidHom.inrₗ α β) a✝ = toLex (0, a✝) - OrderMonoidHom.inrₗ_apply 📋 Mathlib.Algebra.Order.Monoid.Lex
(α : Type u_1) (β : Type u_2) [Monoid α] [PartialOrder α] [Monoid β] [Preorder β] (a✝ : β) : (OrderMonoidHom.inrₗ α β) a✝ = toLex (1, a✝) - OrderAddMonoidHom.inlₗ_apply 📋 Mathlib.Algebra.Order.Monoid.Lex
(α : Type u_1) (β : Type u_2) [AddMonoid α] [PartialOrder α] [AddMonoid β] [Preorder β] (a✝ : α) : (OrderAddMonoidHom.inlₗ α β) a✝ = toLex (a✝, 0) - OrderMonoidHom.inlₗ_apply 📋 Mathlib.Algebra.Order.Monoid.Lex
(α : Type u_1) (β : Type u_2) [Monoid α] [PartialOrder α] [Monoid β] [Preorder β] (a✝ : α) : (OrderMonoidHom.inlₗ α β) a✝ = toLex (a✝, 1) - OrderAddMonoidHom.inlₗ_add_inrₗ_eq_toLex 📋 Mathlib.Algebra.Order.Monoid.Lex
(α : Type u_1) (β : Type u_2) [AddMonoid α] [PartialOrder α] [AddMonoid β] [Preorder β] (m : α) (n : β) : (OrderAddMonoidHom.inlₗ α β) m + (OrderAddMonoidHom.inrₗ α β) n = toLex (m, n) - OrderMonoidHom.inlₗ_mul_inrₗ_eq_toLex 📋 Mathlib.Algebra.Order.Monoid.Lex
(α : Type u_1) (β : Type u_2) [Monoid α] [PartialOrder α] [Monoid β] [Preorder β] (m : α) (n : β) : (OrderMonoidHom.inlₗ α β) m * (OrderMonoidHom.inrₗ α β) n = toLex (m, n) - LinearOrderedCommGroupWithZero.inl_mul_inr_eq_coe_toLex 📋 Mathlib.Algebra.Order.GroupWithZero.Lex
{α : Type u_1} {β : Type u_2} [LinearOrderedCommGroupWithZero α] [LinearOrderedCommGroupWithZero β] {m : α} {n : β} (hm : m ≠ 0) (hn : n ≠ 0) : (LinearOrderedCommGroupWithZero.inl α β) m * (LinearOrderedCommGroupWithZero.inr α β) n = ↑(toLex (Units.mk0 m hm, Units.mk0 n hn)) - coe_toLexLinearEquiv 📋 Mathlib.Algebra.Order.Module.Equiv
(α : Type u_1) (β : Type u_2) [Semiring α] [AddCommMonoid β] [Module α β] : ⇑(toLexLinearEquiv α β) = ⇑toLex - HahnSeries.embDomainOrderEmbedding_apply 📋 Mathlib.RingTheory.HahnSeries.Lex
{Γ : Type u_1} {R : Type u_2} [LinearOrder Γ] [PartialOrder R] {Γ' : Type u_3} [LinearOrder Γ'] (f : Γ ↪o Γ') [Zero R] (a : Lex (HahnSeries Γ R)) : (HahnSeries.embDomainOrderEmbedding f) a = toLex (HahnSeries.embDomain f (ofLex a)) - HahnEmbedding.Partial.apply_of_mem_stratum 📋 Mathlib.Algebra.Order.Module.HahnEmbedding
{K : Type u_1} [DivisionRing K] [LinearOrder K] [IsOrderedRing K] [Archimedean K] {M : Type u_2} [AddCommGroup M] [LinearOrder M] [IsOrderedAddMonoid M] [Module K M] [IsOrderedModule K M] {R : Type u_3} [AddCommGroup R] [LinearOrder R] [Module K R] {seed : HahnEmbedding.Seed K M R} (f : HahnEmbedding.Partial seed) {x : ↥(↑f).domain} {c : FiniteArchimedeanClass M} (hx : ↑x ∈ seed.stratum c) : ↑↑f x = toLex ((HahnSeries.single c) ((seed.coeff c) ⟨↑x, hx⟩)) - HahnEmbedding.Seed.truncLT_mem_range_baseEmbedding 📋 Mathlib.Algebra.Order.Module.HahnEmbedding
{K : Type u_1} [DivisionRing K] [LinearOrder K] [IsOrderedRing K] [Archimedean K] {M : Type u_2} [AddCommGroup M] [LinearOrder M] [IsOrderedAddMonoid M] [Module K M] [IsOrderedModule K M] {R : Type u_3} [AddCommGroup R] [LinearOrder R] [Module K R] (seed : HahnEmbedding.Seed K M R) (x : ↥seed.baseEmbedding.domain) (c : FiniteArchimedeanClass M) : toLex ((HahnSeries.truncLTLinearMap K c) (ofLex (↑seed.baseEmbedding x))) ∈ seed.baseEmbedding.toFun.range - HahnEmbedding.IsPartial.truncLT_mem_range 📋 Mathlib.Algebra.Order.Module.HahnEmbedding
{K : Type u_1} [DivisionRing K] [LinearOrder K] [IsOrderedRing K] [Archimedean K] {M : Type u_2} [AddCommGroup M] [LinearOrder M] [IsOrderedAddMonoid M] [Module K M] [IsOrderedModule K M] {R : Type u_3} [AddCommGroup R] [LinearOrder R] [Module K R] {seed : HahnEmbedding.Seed K M R} {f : M →ₗ.[K] Lex (HahnSeries (FiniteArchimedeanClass M) R)} (self : HahnEmbedding.IsPartial seed f) (x : ↥f.domain) (c : FiniteArchimedeanClass M) : toLex ((HahnSeries.truncLTLinearMap K c) (ofLex (↑f x))) ∈ f.toFun.range - HahnEmbedding.Partial.truncLT_eval_mem_range_extendFun 📋 Mathlib.Algebra.Order.Module.HahnEmbedding
{K : Type u_1} [DivisionRing K] [LinearOrder K] [IsOrderedRing K] [Archimedean K] {M : Type u_2} [AddCommGroup M] [LinearOrder M] [IsOrderedAddMonoid M] [Module K M] [IsOrderedModule K M] {R : Type u_3} [AddCommGroup R] [LinearOrder R] [Module K R] {seed : HahnEmbedding.Seed K M R} (f : HahnEmbedding.Partial seed) [IsOrderedAddMonoid R] [Archimedean R] {x : M} (hx : x ∉ (↑f).domain) (c : FiniteArchimedeanClass M) : toLex ((HahnSeries.truncLTLinearMap K c) (ofLex (f.eval x))) ∈ (f.extendFun hx).toFun.range - HahnEmbedding.Partial.truncLT_mem_range_extendFun 📋 Mathlib.Algebra.Order.Module.HahnEmbedding
{K : Type u_1} [DivisionRing K] [LinearOrder K] [IsOrderedRing K] [Archimedean K] {M : Type u_2} [AddCommGroup M] [LinearOrder M] [IsOrderedAddMonoid M] [Module K M] [IsOrderedModule K M] {R : Type u_3} [AddCommGroup R] [LinearOrder R] [Module K R] {seed : HahnEmbedding.Seed K M R} (f : HahnEmbedding.Partial seed) [IsOrderedAddMonoid R] [Archimedean R] {x : M} (hx : x ∉ (↑f).domain) (y : ↥(f.extendFun hx).domain) (c : FiniteArchimedeanClass M) : toLex ((HahnSeries.truncLTLinearMap K c) (ofLex (↑(f.extendFun hx) y))) ∈ (f.extendFun hx).toFun.range - HahnEmbedding.Partial.truncLT_mem_range_sSupFun 📋 Mathlib.Algebra.Order.Module.HahnEmbedding
{K : Type u_1} [DivisionRing K] [LinearOrder K] [IsOrderedRing K] [Archimedean K] {M : Type u_2} [AddCommGroup M] [LinearOrder M] [IsOrderedAddMonoid M] [Module K M] [IsOrderedModule K M] {R : Type u_3} [AddCommGroup R] [LinearOrder R] [Module K R] {seed : HahnEmbedding.Seed K M R} {c : Set (HahnEmbedding.Partial seed)} (hnonempty : c.Nonempty) (hc : DirectedOn (fun x1 x2 => x1 ≤ x2) c) (x : ↥(HahnEmbedding.Partial.sSupFun hc).domain) (c✝ : FiniteArchimedeanClass M) : toLex ((HahnSeries.truncLTLinearMap K c✝) (ofLex (↑(HahnEmbedding.Partial.sSupFun hc) x))) ∈ (HahnEmbedding.Partial.sSupFun hc).toFun.range - HahnEmbedding.Partial.eval_eq_truncLT 📋 Mathlib.Algebra.Order.Module.HahnEmbedding
{K : Type u_1} [DivisionRing K] [LinearOrder K] [IsOrderedRing K] [Archimedean K] {M : Type u_2} [AddCommGroup M] [LinearOrder M] [IsOrderedAddMonoid M] [Module K M] [IsOrderedModule K M] {R : Type u_3} [AddCommGroup R] [LinearOrder R] [Module K R] {seed : HahnEmbedding.Seed K M R} (f : HahnEmbedding.Partial seed) [IsOrderedAddMonoid R] [Archimedean R] {x : M} {c : FiniteArchimedeanClass M} {y : ↥(↑f).domain} (hy : ArchimedeanClass.mk (↑y - x) = ↑c) (h : ∀ (z : ↥(↑f).domain), ↑z - x ∉ FiniteArchimedeanClass.ball K c) : f.eval x = toLex ((HahnSeries.truncLTLinearMap K c) (ofLex (↑↑f y))) - HahnEmbedding.IsPartial.mk 📋 Mathlib.Algebra.Order.Module.HahnEmbedding
{K : Type u_1} [DivisionRing K] [LinearOrder K] [IsOrderedRing K] [Archimedean K] {M : Type u_2} [AddCommGroup M] [LinearOrder M] [IsOrderedAddMonoid M] [Module K M] [IsOrderedModule K M] {R : Type u_3} [AddCommGroup R] [LinearOrder R] [Module K R] {seed : HahnEmbedding.Seed K M R} {f : M →ₗ.[K] Lex (HahnSeries (FiniteArchimedeanClass M) R)} (strictMono : StrictMono ↑f) (baseEmbedding_le : seed.baseEmbedding ≤ f) (truncLT_mem_range : ∀ (x : ↥f.domain) (c : FiniteArchimedeanClass M), toLex ((HahnSeries.truncLTLinearMap K c) (ofLex (↑f x))) ∈ f.toFun.range) : HahnEmbedding.IsPartial seed f - MvPowerSeries.exists_finsupp_eq_lexOrder_of_ne_zero 📋 Mathlib.RingTheory.MvPowerSeries.LexOrder
{σ : Type u_1} {R : Type u_2} [Semiring R] [LinearOrder σ] [WellFoundedGT σ] {φ : MvPowerSeries σ R} (hφ : φ ≠ 0) : ∃ d, φ.lexOrder = ↑(toLex d) - MvPowerSeries.coeff_ne_zero_of_lexOrder 📋 Mathlib.RingTheory.MvPowerSeries.LexOrder
{σ : Type u_1} {R : Type u_2} [Semiring R] [LinearOrder σ] [WellFoundedGT σ] {φ : MvPowerSeries σ R} {d : σ →₀ ℕ} (h : ↑(toLex d) = φ.lexOrder) : (MvPowerSeries.coeff d) φ ≠ 0 - MvPowerSeries.coeff_eq_zero_of_lt_lexOrder 📋 Mathlib.RingTheory.MvPowerSeries.LexOrder
{σ : Type u_1} {R : Type u_2} [Semiring R] [LinearOrder σ] [WellFoundedGT σ] {φ : MvPowerSeries σ R} {d : σ →₀ ℕ} (h : ↑(toLex d) < φ.lexOrder) : (MvPowerSeries.coeff d) φ = 0 - MvPowerSeries.lexOrder_le_of_coeff_ne_zero 📋 Mathlib.RingTheory.MvPowerSeries.LexOrder
{σ : Type u_1} {R : Type u_2} [Semiring R] [LinearOrder σ] [WellFoundedGT σ] {φ : MvPowerSeries σ R} {d : σ →₀ ℕ} (h : (MvPowerSeries.coeff d) φ ≠ 0) : φ.lexOrder ≤ ↑(toLex d) - MvPowerSeries.le_lexOrder_iff 📋 Mathlib.RingTheory.MvPowerSeries.LexOrder
{σ : Type u_1} {R : Type u_2} [Semiring R] [LinearOrder σ] [WellFoundedGT σ] {φ : MvPowerSeries σ R} {w : WithTop (Lex (σ →₀ ℕ))} : w ≤ φ.lexOrder ↔ ∀ (d : σ →₀ ℕ), ↑(toLex d) < w → (MvPowerSeries.coeff d) φ = 0 - MvPowerSeries.lexOrder_def_of_ne_zero 📋 Mathlib.RingTheory.MvPowerSeries.LexOrder
{σ : Type u_1} {R : Type u_2} [Semiring R] [LinearOrder σ] [WellFoundedGT σ] {φ : MvPowerSeries σ R} (hφ : φ ≠ 0) : ∃ (ne : (⇑toLex '' Function.support φ).Nonempty), φ.lexOrder = ↑(⋯.min (⇑toLex '' Function.support φ) ne) - MvPowerSeries.coeff_mul_of_add_lexOrder 📋 Mathlib.RingTheory.MvPowerSeries.LexOrder
{σ : Type u_1} {R : Type u_2} [Semiring R] [LinearOrder σ] [WellFoundedGT σ] {φ ψ : MvPowerSeries σ R} {p q : σ →₀ ℕ} (hp : φ.lexOrder = ↑(toLex p)) (hq : ψ.lexOrder = ↑(toLex q)) : (MvPowerSeries.coeff (p + q)) (φ * ψ) = (MvPowerSeries.coeff p) φ * (MvPowerSeries.coeff q) ψ - ContDiffPointwiseHolderAt.of_toLex_le 📋 Mathlib.Analysis.Calculus.ContDiffHolder.Pointwise
{E : Type u_1} {F : Type u_2} [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] {k l : ℕ} {α β : ↑unitInterval} {f : E → F} {a : E} (hf : ContDiffPointwiseHolderAt k α f a) (hle : toLex (l, β) ≤ toLex (k, α)) : ContDiffPointwiseHolderAt l β f a - Sum.Lex.Ici_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrderTop α] [Fintype β] [LocallyFiniteOrderTop β] (a : α) : Finset.Ici (Sum.inlₗ a) = Finset.map toLex.toEmbedding ((Finset.Ici a).disjSum Finset.univ) - Sum.Lex.Iic_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [Fintype α] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] (b : β) : Finset.Iic (Sum.inrₗ b) = Finset.map toLex.toEmbedding (Finset.univ.disjSum (Finset.Iic b)) - Sum.Lex.Iio_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [Fintype α] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] (b : β) : Finset.Iio (Sum.inrₗ b) = Finset.map toLex.toEmbedding (Finset.univ.disjSum (Finset.Iio b)) - Sum.Lex.Ioi_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrderTop α] [Fintype β] [LocallyFiniteOrderTop β] (a : α) : Finset.Ioi (Sum.inlₗ a) = Finset.map toLex.toEmbedding ((Finset.Ioi a).disjSum Finset.univ) - Sum.Lex.Ici_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrderTop α] [Fintype β] [LocallyFiniteOrderTop β] (b : β) : Finset.Ici (Sum.inrₗ b) = Finset.map (Function.Embedding.inr.trans toLex.toEmbedding) (Finset.Ici b) - Sum.Lex.Iic_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [Fintype α] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] (a : α) : Finset.Iic (Sum.inlₗ a) = Finset.map (Function.Embedding.inl.trans toLex.toEmbedding) (Finset.Iic a) - Sum.Lex.Iio_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [Fintype α] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] (a : α) : Finset.Iio (Sum.inlₗ a) = Finset.map (Function.Embedding.inl.trans toLex.toEmbedding) (Finset.Iio a) - Sum.Lex.Ioi_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrderTop α] [Fintype β] [LocallyFiniteOrderTop β] (b : β) : Finset.Ioi (Sum.inrₗ b) = Finset.map (Function.Embedding.inr.trans toLex.toEmbedding) (Finset.Ioi b) - Sum.Lex.Icc_inl_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a : α) (b : β) : Finset.Icc (Sum.inlₗ a) (Sum.inrₗ b) = Finset.map toLex.toEmbedding ((Finset.Ici a).disjSum (Finset.Iic b)) - Sum.Lex.Ico_inl_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a : α) (b : β) : Finset.Ico (Sum.inlₗ a) (Sum.inrₗ b) = Finset.map toLex.toEmbedding ((Finset.Ici a).disjSum (Finset.Iio b)) - Sum.Lex.Ioc_inl_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a : α) (b : β) : Finset.Ioc (Sum.inlₗ a) (Sum.inrₗ b) = Finset.map toLex.toEmbedding ((Finset.Ioi a).disjSum (Finset.Iic b)) - Sum.Lex.Ioo_inl_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a : α) (b : β) : Finset.Ioo (Sum.inlₗ a) (Sum.inrₗ b) = Finset.map toLex.toEmbedding ((Finset.Ioi a).disjSum (Finset.Iio b)) - Sum.Lex.Icc_inl_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a₁ a₂ : α) : Finset.Icc (Sum.inlₗ a₁) (Sum.inlₗ a₂) = Finset.map (Function.Embedding.inl.trans toLex.toEmbedding) (Finset.Icc a₁ a₂) - Sum.Lex.Icc_inr_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (b₁ b₂ : β) : Finset.Icc (Sum.inrₗ b₁) (Sum.inrₗ b₂) = Finset.map (Function.Embedding.inr.trans toLex.toEmbedding) (Finset.Icc b₁ b₂) - Sum.Lex.Ico_inl_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a₁ a₂ : α) : Finset.Ico (Sum.inlₗ a₁) (Sum.inlₗ a₂) = Finset.map (Function.Embedding.inl.trans toLex.toEmbedding) (Finset.Ico a₁ a₂) - Sum.Lex.Ico_inr_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (b₁ b₂ : β) : Finset.Ico (Sum.inrₗ b₁) (Sum.inrₗ b₂) = Finset.map (Function.Embedding.inr.trans toLex.toEmbedding) (Finset.Ico b₁ b₂) - Sum.Lex.Ioc_inl_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a₁ a₂ : α) : Finset.Ioc (Sum.inlₗ a₁) (Sum.inlₗ a₂) = Finset.map (Function.Embedding.inl.trans toLex.toEmbedding) (Finset.Ioc a₁ a₂) - Sum.Lex.Ioc_inr_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (b₁ b₂ : β) : Finset.Ioc (Sum.inrₗ b₁) (Sum.inrₗ b₂) = Finset.map (Function.Embedding.inr.trans toLex.toEmbedding) (Finset.Ioc b₁ b₂) - Sum.Lex.Ioo_inl_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a₁ a₂ : α) : Finset.Ioo (Sum.inlₗ a₁) (Sum.inlₗ a₂) = Finset.map (Function.Embedding.inl.trans toLex.toEmbedding) (Finset.Ioo a₁ a₂) - Sum.Lex.Ioo_inr_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (b₁ b₂ : β) : Finset.Ioo (Sum.inrₗ b₁) (Sum.inrₗ b₂) = Finset.map (Function.Embedding.inr.trans toLex.toEmbedding) (Finset.Ioo b₁ b₂) - NonemptyInterval.toLex_mono 📋 Mathlib.Order.Interval.Lex
{α : Type u_1} [PartialOrder α] : Monotone ⇑toLex - NonemptyInterval.toLex_strictMono 📋 Mathlib.Order.Interval.Lex
{α : Type u_1} [PartialOrder α] : StrictMono ⇑toLex - NonemptyInterval.toLex_le_toLex 📋 Mathlib.Order.Interval.Lex
{α : Type u_1} [LT α] [LE α] {x y : NonemptyInterval α} : toLex x ≤ toLex y ↔ y.toProd.1 < x.toProd.1 ∨ x.toProd.1 = y.toProd.1 ∧ x.toProd.2 ≤ y.toProd.2 - NonemptyInterval.toLex_lt_toLex 📋 Mathlib.Order.Interval.Lex
{α : Type u_1} [LT α] [LE α] {x y : NonemptyInterval α} : toLex x < toLex y ↔ y.toProd.1 < x.toProd.1 ∨ x.toProd.1 = y.toProd.1 ∧ x.toProd.2 < y.toProd.2 - MvPolynomial.monic_esymm 📋 Mathlib.RingTheory.MvPolynomial.Symmetric.FundamentalTheorem
{R : Type u_3} {m : ℕ} [CommSemiring R] {i : ℕ} (him : i ≤ m) : AddMonoidAlgebra.Monic (⇑toLex) (MvPolynomial.esymm (Fin m) R i) - MvPolynomial.leadingCoeff_esymmAlgHomMonomial 📋 Mathlib.RingTheory.MvPolynomial.Symmetric.FundamentalTheorem
{R : Type u_3} {n m : ℕ} [CommSemiring R] {r : R} (t : Fin n →₀ ℕ) (hnm : n ≤ m) : AddMonoidAlgebra.leadingCoeff (⇑toLex) (MvPolynomial.esymmAlgHomMonomial (Fin m) t r) = r - MvPolynomial.IsSymmetric.antitone_supDegree 📋 Mathlib.RingTheory.MvPolynomial.Symmetric.FundamentalTheorem
{σ : Type u_1} {R : Type u_3} [CommSemiring R] [LinearOrder σ] {p : MvPolynomial σ R} (hp : p.IsSymmetric) : Antitone ⇑(ofLex (AddMonoidAlgebra.supDegree (⇑toLex) p)) - MvPolynomial.supDegree_esymmAlgHomMonomial 📋 Mathlib.RingTheory.MvPolynomial.Symmetric.FundamentalTheorem
{R : Type u_3} {n m : ℕ} [CommSemiring R] {r : R} (hr : r ≠ 0) (t : Fin n →₀ ℕ) (hnm : n ≤ m) : ⇑(ofLex (AddMonoidAlgebra.supDegree (⇑toLex) (MvPolynomial.esymmAlgHomMonomial (Fin m) t r))) = (Fin.accumulate n m) ⇑t - MvPolynomial.supDegree_esymm 📋 Mathlib.RingTheory.MvPolynomial.Symmetric.FundamentalTheorem
{R : Type u_3} {n m : ℕ} [CommSemiring R] {i : Fin n} [Nontrivial R] (him : ↑i < m) : ⇑(ofLex (AddMonoidAlgebra.supDegree (⇑toLex) (MvPolynomial.esymm (Fin m) R (↑i + 1)))) = (Fin.accumulate n m) ⇑fun₀ | i => 1
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c