Loogle!
Result
Found 1263 declarations mentioning OrderDual. Of these, only the first 200 are shown.
- OrderDual 📋 Mathlib.Order.OrderDual
(α : Type u_2) : Type u_2 - OrderDual.ofDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} : αᵒᵈ ≃ α - OrderDual.toDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} : α ≃ αᵒᵈ - OrderDual.instDecidableEq 📋 Mathlib.Order.OrderDual
(α : Type u_2) [DecidableEq α] : DecidableEq αᵒᵈ - OrderDual.instInhabited 📋 Mathlib.Order.OrderDual
{α : Type u_1} [h : Inhabited α] : Inhabited αᵒᵈ - OrderDual.instLE 📋 Mathlib.Order.OrderDual
(α : Type u_2) [h : LE α] : LE αᵒᵈ - OrderDual.instLT 📋 Mathlib.Order.OrderDual
(α : Type u_2) [h : LT α] : LT αᵒᵈ - OrderDual.instLinearOrder 📋 Mathlib.Order.OrderDual
(α : Type u_2) [LinearOrder α] : LinearOrder αᵒᵈ - OrderDual.instMaxOfMin 📋 Mathlib.Order.OrderDual
(α : Type u_2) [h : Min α] : Max αᵒᵈ - OrderDual.instMinOfMax 📋 Mathlib.Order.OrderDual
(α : Type u_2) [h : Max α] : Min αᵒᵈ - OrderDual.instNonempty 📋 Mathlib.Order.OrderDual
(α : Type u_2) [h : Nonempty α] : Nonempty αᵒᵈ - OrderDual.instNontrivial 📋 Mathlib.Order.OrderDual
{α : Type u_1} [h : Nontrivial α] : Nontrivial αᵒᵈ - OrderDual.instOrd 📋 Mathlib.Order.OrderDual
(α : Type u_2) [h : Ord α] : Ord αᵒᵈ - OrderDual.instPartialOrder 📋 Mathlib.Order.OrderDual
(α : Type u_2) [PartialOrder α] : PartialOrder αᵒᵈ - OrderDual.instPreorder 📋 Mathlib.Order.OrderDual
(α : Type u_2) [Preorder α] : Preorder αᵒᵈ - OrderDual.instSubsingleton 📋 Mathlib.Order.OrderDual
(α : Type u_2) [h : Subsingleton α] : Subsingleton αᵒᵈ - OrderDual.instUnique 📋 Mathlib.Order.OrderDual
{α : Type u_1} [h : Unique α] : Unique αᵒᵈ - OrderDual.denselyOrdered 📋 Mathlib.Order.OrderDual
(α : Type u_2) [LT α] [h : DenselyOrdered α] : DenselyOrdered αᵒᵈ - OrderDual.instDecidableLE 📋 Mathlib.Order.OrderDual
(α : Type u_2) [LE α] [h : DecidableLE α] : DecidableLE αᵒᵈ - OrderDual.instDecidableLT 📋 Mathlib.Order.OrderDual
(α : Type u_2) [LT α] [h : DecidableLT α] : DecidableLT αᵒᵈ - denselyOrdered_orderDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LT α] : DenselyOrdered αᵒᵈ ↔ DenselyOrdered α - OrderDual.ofDual_symm_eq 📋 Mathlib.Order.OrderDual
{α : Type u_1} : OrderDual.ofDual.symm = OrderDual.toDual - OrderDual.toDual_symm_eq 📋 Mathlib.Order.OrderDual
{α : Type u_1} : OrderDual.toDual.symm = OrderDual.ofDual - OrderDual.Ord.dual_dual 📋 Mathlib.Order.OrderDual
(α : Type u_2) [H : Ord α] : OrderDual.instOrd αᵒᵈ = H - OrderDual.Preorder.dual_dual 📋 Mathlib.Order.OrderDual
(α : Type u_2) [H : Preorder α] : OrderDual.instPreorder αᵒᵈ = H - OrderDual.instLinearOrder.dual_dual 📋 Mathlib.Order.OrderDual
(α : Type u_2) [H : LinearOrder α] : OrderDual.instLinearOrder αᵒᵈ = H - OrderDual.instPartialOrder.dual_dual 📋 Mathlib.Order.OrderDual
(α : Type u_2) [H : PartialOrder α] : OrderDual.instPartialOrder αᵒᵈ = H - OrderDual.toDual_trans_ofDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} : OrderDual.toDual.trans OrderDual.ofDual = Equiv.refl α - OrderDual.instIsTransLe 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LE α] [T : IsTrans α LE.le] : IsTrans αᵒᵈ LE.le - OrderDual.instIsTransLt 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LT α] [T : IsTrans α LT.lt] : IsTrans αᵒᵈ LT.lt - OrderDual.instTrichotomousLt 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LT α] [T : Std.Trichotomous LT.lt] : Std.Trichotomous LT.lt - OrderDual.ofDual_trans_toDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} : OrderDual.ofDual.trans OrderDual.toDual = Equiv.refl αᵒᵈ - OrderDual.rec 📋 Mathlib.Order.OrderDual
{α : Type u_1} {motive : αᵒᵈ → Sort u_2} (toDual : (a : α) → motive (OrderDual.toDual a)) (a : αᵒᵈ) : motive a - OrderDual.forall 📋 Mathlib.Order.OrderDual
{α : Type u_1} {p : αᵒᵈ → Prop} : (∀ (a : αᵒᵈ), p a) ↔ ∀ (a : α), p (OrderDual.toDual a) - OrderDual.exists 📋 Mathlib.Order.OrderDual
{α : Type u_1} {p : αᵒᵈ → Prop} : (∃ a, p a) ↔ ∃ a, p (OrderDual.toDual a) - OrderDual.ofDual_toDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} (a : α) : OrderDual.ofDual (OrderDual.toDual a) = a - OrderDual.toDual_ofDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} (a : αᵒᵈ) : OrderDual.toDual (OrderDual.ofDual a) = a - OrderDual.ofDual_comp_toDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} : ⇑OrderDual.ofDual ∘ ⇑OrderDual.toDual = id - OrderDual.toDual_inj 📋 Mathlib.Order.OrderDual
{α : Type u_1} {a b : α} : OrderDual.toDual a = OrderDual.toDual b ↔ a = b - OrderDual.ext 📋 Mathlib.Order.OrderDual
{α : Type u_1} {a b : αᵒᵈ} (h : OrderDual.ofDual a = OrderDual.ofDual b) : a = b - OrderDual.toDual_comp_ofDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} : ⇑OrderDual.toDual ∘ ⇑OrderDual.ofDual = id - OrderDual.ext_iff 📋 Mathlib.Order.OrderDual
{α : Type u_1} {a b : αᵒᵈ} : a = b ↔ OrderDual.ofDual a = OrderDual.ofDual b - OrderDual.ofDual_inj 📋 Mathlib.Order.OrderDual
{α : Type u_1} {a b : αᵒᵈ} : OrderDual.ofDual a = OrderDual.ofDual b ↔ a = b - LE.le.dual 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LE α] {a b : α} : b ≤ a → OrderDual.toDual a ≤ OrderDual.toDual b - LT.lt.dual 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LT α] {a b : α} : b < a → OrderDual.toDual a < OrderDual.toDual b - OrderDual.toDual_le_toDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LE α] {a b : α} : OrderDual.toDual a ≤ OrderDual.toDual b ↔ b ≤ a - OrderDual.toDual_lt_toDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LT α] {a b : α} : OrderDual.toDual a < OrderDual.toDual b ↔ b < a - OrderDual.le_toDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LE α] {a : αᵒᵈ} {b : α} : a ≤ OrderDual.toDual b ↔ b ≤ OrderDual.ofDual a - OrderDual.lt_toDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LT α] {a : αᵒᵈ} {b : α} : a < OrderDual.toDual b ↔ b < OrderDual.ofDual a - OrderDual.toDual_le 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LE α] {a : αᵒᵈ} {b : α} : OrderDual.toDual b ≤ a ↔ OrderDual.ofDual a ≤ b - OrderDual.toDual_lt 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LT α] {a : αᵒᵈ} {b : α} : OrderDual.toDual b < a ↔ OrderDual.ofDual a < b - LE.le.ofDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LE α] {a b : αᵒᵈ} : b ≤ a → OrderDual.ofDual a ≤ OrderDual.ofDual b - LT.lt.ofDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LT α] {a b : αᵒᵈ} : b < a → OrderDual.ofDual a < OrderDual.ofDual b - OrderDual.ofDual_le_ofDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LE α] {a b : αᵒᵈ} : OrderDual.ofDual a ≤ OrderDual.ofDual b ↔ b ≤ a - OrderDual.ofDual_lt_ofDual 📋 Mathlib.Order.OrderDual
{α : Type u_1} [LT α] {a b : αᵒᵈ} : OrderDual.ofDual a < OrderDual.ofDual b ↔ b < a - OrderDual.noBotOrder 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] [NoTopOrder α] : NoBotOrder αᵒᵈ - OrderDual.noMaxOrder 📋 Mathlib.Order.Max
{α : Type u_1} [LT α] [NoMinOrder α] : NoMaxOrder αᵒᵈ - OrderDual.noMinOrder 📋 Mathlib.Order.Max
{α : Type u_1} [LT α] [NoMaxOrder α] : NoMinOrder αᵒᵈ - OrderDual.noTopOrder 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] [NoBotOrder α] : NoTopOrder αᵒᵈ - IsBot.toDual 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : α} : IsBot a → IsTop (OrderDual.toDual a) - IsMax.toDual 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : α} : IsMax a → IsMin (OrderDual.toDual a) - IsMin.toDual 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : α} : IsMin a → IsMax (OrderDual.toDual a) - IsTop.toDual 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : α} : IsTop a → IsBot (OrderDual.toDual a) - isBot_toDual_iff 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : α} : IsBot (OrderDual.toDual a) ↔ IsTop a - isMax_toDual_iff 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : α} : IsMax (OrderDual.toDual a) ↔ IsMin a - isMin_toDual_iff 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : α} : IsMin (OrderDual.toDual a) ↔ IsMax a - isTop_toDual_iff 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : α} : IsTop (OrderDual.toDual a) ↔ IsBot a - IsBot.ofDual 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : αᵒᵈ} : IsBot a → IsTop (OrderDual.ofDual a) - IsMax.ofDual 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : αᵒᵈ} : IsMax a → IsMin (OrderDual.ofDual a) - IsMin.ofDual 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : αᵒᵈ} : IsMin a → IsMax (OrderDual.ofDual a) - IsTop.ofDual 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : αᵒᵈ} : IsTop a → IsBot (OrderDual.ofDual a) - isBot_ofDual_iff 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : αᵒᵈ} : IsBot (OrderDual.ofDual a) ↔ IsTop a - isMax_ofDual_iff 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : αᵒᵈ} : IsMax (OrderDual.ofDual a) ↔ IsMin a - isMin_ofDual_iff 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : αᵒᵈ} : IsMin (OrderDual.ofDual a) ↔ IsMax a - isTop_ofDual_iff 📋 Mathlib.Order.Max
{α : Type u_1} [LE α] {a : αᵒᵈ} : IsTop (OrderDual.ofDual a) ↔ IsBot a - OrderDual.instBotOfTop 📋 Mathlib.Order.BoundedOrder.Basic
(α : Type u) [h : Top α] : Bot αᵒᵈ - OrderDual.instTopOfBot 📋 Mathlib.Order.BoundedOrder.Basic
(α : Type u) [h : Bot α] : Top αᵒᵈ - OrderDual.instBoundedOrder 📋 Mathlib.Order.BoundedOrder.Basic
(α : Type u) [LE α] [BoundedOrder α] : BoundedOrder αᵒᵈ - OrderDual.instOrderBotOfOrderTop 📋 Mathlib.Order.BoundedOrder.Basic
(α : Type u) [LE α] [h : OrderTop α] : OrderBot αᵒᵈ - OrderDual.instOrderTopOfOrderBot 📋 Mathlib.Order.BoundedOrder.Basic
(α : Type u) [LE α] [h : OrderBot α] : OrderTop αᵒᵈ - OrderDual.ofDual_bot 📋 Mathlib.Order.BoundedOrder.Basic
(α : Type u) [Top α] : OrderDual.ofDual ⊥ = ⊤ - OrderDual.ofDual_top 📋 Mathlib.Order.BoundedOrder.Basic
(α : Type u) [Bot α] : OrderDual.ofDual ⊤ = ⊥ - OrderDual.toDual_bot 📋 Mathlib.Order.BoundedOrder.Basic
(α : Type u) [Bot α] : OrderDual.toDual ⊥ = ⊤ - OrderDual.toDual_top 📋 Mathlib.Order.BoundedOrder.Basic
(α : Type u) [Top α] : OrderDual.toDual ⊤ = ⊥ - OrderDual.toDual_eq_bot 📋 Mathlib.Order.BoundedOrder.Basic
(α : Type u) [Top α] {a : α} : OrderDual.toDual a = ⊥ ↔ a = ⊤ - OrderDual.toDual_eq_top 📋 Mathlib.Order.BoundedOrder.Basic
(α : Type u) [Bot α] {a : α} : OrderDual.toDual a = ⊤ ↔ a = ⊥ - OrderDual.ofDual_eq_bot 📋 Mathlib.Order.BoundedOrder.Basic
(α : Type u) [Bot α] {a : αᵒᵈ} : OrderDual.ofDual a = ⊥ ↔ a = ⊤ - OrderDual.ofDual_eq_top 📋 Mathlib.Order.BoundedOrder.Basic
(α : Type u) [Top α] {a : αᵒᵈ} : OrderDual.ofDual a = ⊤ ↔ a = ⊥ - toDual_compares_toDual 📋 Mathlib.Order.Compare
{α : Type u_1} [LT α] {a b : α} {o : Ordering} : o.Compares (OrderDual.toDual a) (OrderDual.toDual b) ↔ o.Compares b a - ofDual_compares_ofDual 📋 Mathlib.Order.Compare
{α : Type u_1} [LT α] {a b : αᵒᵈ} {o : Ordering} : o.Compares (OrderDual.ofDual a) (OrderDual.ofDual b) ↔ o.Compares b a - cmpLE_toDual 📋 Mathlib.Order.Compare
{α : Type u_1} [LE α] [DecidableLE α] (x y : α) : cmpLE (OrderDual.toDual x) (OrderDual.toDual y) = cmpLE y x - cmp_toDual 📋 Mathlib.Order.Compare
{α : Type u_1} [LT α] [DecidableLT α] (x y : α) : cmp (OrderDual.toDual x) (OrderDual.toDual y) = cmp y x - cmpLE_ofDual 📋 Mathlib.Order.Compare
{α : Type u_1} [LE α] [DecidableLE α] (x y : αᵒᵈ) : cmpLE (OrderDual.ofDual x) (OrderDual.ofDual y) = cmpLE y x - cmp_ofDual 📋 Mathlib.Order.Compare
{α : Type u_1} [LT α] [DecidableLT α] (x y : αᵒᵈ) : cmp (OrderDual.ofDual x) (OrderDual.ofDual y) = cmp y x - instWellFoundedGTOrderDualOfWellFoundedLT 📋 Mathlib.Order.RelClasses
(α : Type u_1) [LT α] [h : WellFoundedLT α] : WellFoundedGT αᵒᵈ - instWellFoundedLTOrderDualOfWellFoundedGT 📋 Mathlib.Order.RelClasses
(α : Type u_1) [LT α] [h : WellFoundedGT α] : WellFoundedLT αᵒᵈ - wellFoundedGT_dual_iff 📋 Mathlib.Order.RelClasses
(α : Type u_1) [LT α] : WellFoundedGT αᵒᵈ ↔ WellFoundedLT α - wellFoundedLT_dual_iff 📋 Mathlib.Order.RelClasses
(α : Type u_1) [LT α] : WellFoundedLT αᵒᵈ ↔ WellFoundedGT α - OrderDual.total_ge 📋 Mathlib.Order.RelClasses
{α : Type u} [LE α] [h : Std.Total fun x1 x2 => x2 ≤ x1] : Std.Total fun x1 x2 => x2 ≤ x1 - OrderDual.total_le 📋 Mathlib.Order.RelClasses
{α : Type u} [LE α] [h : Std.Total fun x1 x2 => x1 ≤ x2] : Std.Total fun x1 x2 => x1 ≤ x2 - Antitone.dual_right 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : Antitone f → Monotone (⇑OrderDual.toDual ∘ f) - Monotone.dual_right 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : Monotone f → Antitone (⇑OrderDual.toDual ∘ f) - StrictAnti.dual_right 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : StrictAnti f → StrictMono (⇑OrderDual.toDual ∘ f) - StrictMono.dual_right 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : StrictMono f → StrictAnti (⇑OrderDual.toDual ∘ f) - antitone_toDual_comp_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : Antitone (⇑OrderDual.toDual ∘ f) ↔ Monotone f - monotone_toDual_comp_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : Monotone (⇑OrderDual.toDual ∘ f) ↔ Antitone f - strictAnti_toDual_comp_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : StrictAnti (⇑OrderDual.toDual ∘ f) ↔ StrictMono f - strictMono_toDual_comp_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : StrictMono (⇑OrderDual.toDual ∘ f) ↔ StrictAnti f - Antitone.dual_left 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : Antitone f → Monotone (f ∘ ⇑OrderDual.ofDual) - Monotone.dual_left 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : Monotone f → Antitone (f ∘ ⇑OrderDual.ofDual) - StrictAnti.dual_left 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : StrictAnti f → StrictMono (f ∘ ⇑OrderDual.ofDual) - StrictMono.dual_left 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : StrictMono f → StrictAnti (f ∘ ⇑OrderDual.ofDual) - antitone_comp_ofDual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : Antitone (f ∘ ⇑OrderDual.ofDual) ↔ Monotone f - monotone_comp_ofDual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : Monotone (f ∘ ⇑OrderDual.ofDual) ↔ Antitone f - strictAnti_comp_ofDual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : StrictAnti (f ∘ ⇑OrderDual.ofDual) ↔ StrictMono f - strictMono_comp_ofDual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : StrictMono (f ∘ ⇑OrderDual.ofDual) ↔ StrictAnti f - AntitoneOn.dual_right 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : AntitoneOn f s → MonotoneOn (⇑OrderDual.toDual ∘ f) s - MonotoneOn.dual_right 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : MonotoneOn f s → AntitoneOn (⇑OrderDual.toDual ∘ f) s - StrictAntiOn.dual_right 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : StrictAntiOn f s → StrictMonoOn (⇑OrderDual.toDual ∘ f) s - StrictMonoOn.dual_right 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : StrictMonoOn f s → StrictAntiOn (⇑OrderDual.toDual ∘ f) s - antitoneOn_toDual_comp_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : AntitoneOn (⇑OrderDual.toDual ∘ f) s ↔ MonotoneOn f s - monotoneOn_toDual_comp_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : MonotoneOn (⇑OrderDual.toDual ∘ f) s ↔ AntitoneOn f s - strictAntiOn_toDual_comp_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : StrictAntiOn (⇑OrderDual.toDual ∘ f) s ↔ StrictMonoOn f s - strictMonoOn_toDual_comp_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : StrictMonoOn (⇑OrderDual.toDual ∘ f) s ↔ StrictAntiOn f s - AntitoneOn.dual_left 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : AntitoneOn f s → MonotoneOn (f ∘ ⇑OrderDual.ofDual) s - MonotoneOn.dual_left 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : MonotoneOn f s → AntitoneOn (f ∘ ⇑OrderDual.ofDual) s - StrictAntiOn.dual_left 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : StrictAntiOn f s → StrictMonoOn (f ∘ ⇑OrderDual.ofDual) s - StrictMonoOn.dual_left 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : StrictMonoOn f s → StrictAntiOn (f ∘ ⇑OrderDual.ofDual) s - antitoneOn_comp_ofDual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : AntitoneOn (f ∘ ⇑OrderDual.ofDual) s ↔ MonotoneOn f s - monotoneOn_comp_ofDual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : MonotoneOn (f ∘ ⇑OrderDual.ofDual) s ↔ AntitoneOn f s - strictAntiOn_comp_ofDual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : StrictAntiOn (f ∘ ⇑OrderDual.ofDual) s ↔ StrictMonoOn f s - strictMonoOn_comp_ofDual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : StrictMonoOn (f ∘ ⇑OrderDual.ofDual) s ↔ StrictAntiOn f s - Antitone.dual 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : Antitone f → Antitone (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) - Monotone.dual 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : Monotone f → Monotone (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) - StrictAnti.dual 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : StrictAnti f → StrictAnti (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) - StrictMono.dual 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : StrictMono f → StrictMono (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) - antitone_dual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : Antitone (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) ↔ Antitone f - monotone_dual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : Monotone (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) ↔ Monotone f - strictAnti_dual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : StrictAnti (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) ↔ StrictAnti f - strictMono_dual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} : StrictMono (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) ↔ StrictMono f - AntitoneOn.dual 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : AntitoneOn f s → AntitoneOn (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) s - MonotoneOn.dual 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : MonotoneOn f s → MonotoneOn (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) s - StrictAntiOn.dual 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : StrictAntiOn f s → StrictAntiOn (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) s - StrictMonoOn.dual 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : StrictMonoOn f s → StrictMonoOn (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) s - antitoneOn_dual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : AntitoneOn (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) s ↔ AntitoneOn f s - monotoneOn_dual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : MonotoneOn (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) s ↔ MonotoneOn f s - strictAntiOn_dual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : StrictAntiOn (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) s ↔ StrictAntiOn f s - strictMonoOn_dual_iff 📋 Mathlib.Order.Monotone.Basic
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {f : α → β} {s : Set α} : StrictMonoOn (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) s ↔ StrictMonoOn f s - OrderDual.instDistribLattice 📋 Mathlib.Order.Lattice
(α : Type u_1) [DistribLattice α] : DistribLattice αᵒᵈ - OrderDual.instLattice 📋 Mathlib.Order.Lattice
(α : Type u_1) [Lattice α] : Lattice αᵒᵈ - OrderDual.instSemilatticeInf 📋 Mathlib.Order.Lattice
(α : Type u_1) [h : SemilatticeSup α] : SemilatticeInf αᵒᵈ - OrderDual.instSemilatticeSup 📋 Mathlib.Order.Lattice
(α : Type u_1) [h : SemilatticeInf α] : SemilatticeSup αᵒᵈ - SemilatticeInf.dual_dual 📋 Mathlib.Order.Lattice
(α : Type u_1) [H : SemilatticeInf α] : OrderDual.instSemilatticeInf αᵒᵈ = H - SemilatticeSup.dual_dual 📋 Mathlib.Order.Lattice
(α : Type u_1) [H : SemilatticeSup α] : OrderDual.instSemilatticeSup αᵒᵈ = H - toDual_inf 📋 Mathlib.Order.Lattice
{α : Type u} [Min α] (a b : α) : OrderDual.toDual (a ⊓ b) = OrderDual.toDual a ⊔ OrderDual.toDual b - toDual_sup 📋 Mathlib.Order.Lattice
{α : Type u} [Max α] (a b : α) : OrderDual.toDual (a ⊔ b) = OrderDual.toDual a ⊓ OrderDual.toDual b - ofDual_inf 📋 Mathlib.Order.Lattice
{α : Type u} [Max α] (a b : αᵒᵈ) : OrderDual.ofDual (a ⊓ b) = OrderDual.ofDual a ⊔ OrderDual.ofDual b - ofDual_sup 📋 Mathlib.Order.Lattice
{α : Type u} [Min α] (a b : αᵒᵈ) : OrderDual.ofDual (a ⊔ b) = OrderDual.ofDual a ⊓ OrderDual.ofDual b - toDual_max 📋 Mathlib.Order.Lattice
{α : Type u} [LinearOrder α] (a b : α) : OrderDual.toDual (max a b) = min (OrderDual.toDual a) (OrderDual.toDual b) - toDual_min 📋 Mathlib.Order.Lattice
{α : Type u} [LinearOrder α] (a b : α) : OrderDual.toDual (min a b) = max (OrderDual.toDual a) (OrderDual.toDual b) - ofDual_max 📋 Mathlib.Order.Lattice
{α : Type u} [LinearOrder α] (a b : αᵒᵈ) : OrderDual.ofDual (max a b) = min (OrderDual.ofDual a) (OrderDual.ofDual b) - ofDual_min 📋 Mathlib.Order.Lattice
{α : Type u} [LinearOrder α] (a b : αᵒᵈ) : OrderDual.ofDual (min a b) = max (OrderDual.ofDual a) (OrderDual.ofDual b) - ComplementedLattice.instOrderDual 📋 Mathlib.Order.Disjoint
{α : Type u_1} [Lattice α] [BoundedOrder α] [ComplementedLattice α] : ComplementedLattice αᵒᵈ - Codisjoint.dual 📋 Mathlib.Order.Disjoint
{α : Type u_1} [PartialOrder α] [OrderTop α] {a b : α} : Codisjoint a b → Disjoint (OrderDual.toDual a) (OrderDual.toDual b) - Disjoint.dual 📋 Mathlib.Order.Disjoint
{α : Type u_1} [PartialOrder α] [OrderBot α] {a b : α} : Disjoint a b → Codisjoint (OrderDual.toDual a) (OrderDual.toDual b) - IsCompl.dual 📋 Mathlib.Order.Disjoint
{α : Type u_1} [PartialOrder α] [BoundedOrder α] {x y : α} (h : IsCompl x y) : IsCompl (OrderDual.toDual x) (OrderDual.toDual y) - codisjoint_toDual_iff 📋 Mathlib.Order.Disjoint
{α : Type u_1} [PartialOrder α] [OrderBot α] {a b : α} : Codisjoint (OrderDual.toDual a) (OrderDual.toDual b) ↔ Disjoint a b - disjoint_toDual_iff 📋 Mathlib.Order.Disjoint
{α : Type u_1} [PartialOrder α] [OrderTop α] {a b : α} : Disjoint (OrderDual.toDual a) (OrderDual.toDual b) ↔ Codisjoint a b - IsCompl.ofDual 📋 Mathlib.Order.Disjoint
{α : Type u_1} [PartialOrder α] [BoundedOrder α] {a b : αᵒᵈ} (h : IsCompl a b) : IsCompl (OrderDual.ofDual a) (OrderDual.ofDual b) - codisjoint_ofDual_iff 📋 Mathlib.Order.Disjoint
{α : Type u_1} [PartialOrder α] [OrderTop α] {a b : αᵒᵈ} : Codisjoint (OrderDual.ofDual a) (OrderDual.ofDual b) ↔ Disjoint a b - disjoint_ofDual_iff 📋 Mathlib.Order.Disjoint
{α : Type u_1} [PartialOrder α] [OrderBot α] {a b : αᵒᵈ} : Disjoint (OrderDual.ofDual a) (OrderDual.ofDual b) ↔ Codisjoint a b - isCompl_toDual_iff 📋 Mathlib.Order.Disjoint
{α : Type u_1} [Lattice α] [BoundedOrder α] {a b : α} : IsCompl (OrderDual.toDual a) (OrderDual.toDual b) ↔ IsCompl a b - isCompl_ofDual_iff 📋 Mathlib.Order.Disjoint
{α : Type u_1} [Lattice α] [BoundedOrder α] {a b : αᵒᵈ} : IsCompl (OrderDual.ofDual a) (OrderDual.ofDual b) ↔ IsCompl a b - GaloisCoinsertion.dual 📋 Mathlib.Order.GaloisConnection.Defs
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {l : α → β} {u : β → α} : GaloisCoinsertion l u → GaloisInsertion (⇑OrderDual.toDual ∘ u ∘ ⇑OrderDual.ofDual) (⇑OrderDual.toDual ∘ l ∘ ⇑OrderDual.ofDual) - GaloisConnection.dual 📋 Mathlib.Order.GaloisConnection.Defs
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {l : α → β} {u : β → α} (gc : GaloisConnection l u) : GaloisConnection (⇑OrderDual.toDual ∘ u ∘ ⇑OrderDual.ofDual) (⇑OrderDual.toDual ∘ l ∘ ⇑OrderDual.ofDual) - GaloisInsertion.dual 📋 Mathlib.Order.GaloisConnection.Defs
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {u : α → β} {l : β → α} : GaloisInsertion l u → GaloisCoinsertion (⇑OrderDual.toDual ∘ u ∘ ⇑OrderDual.ofDual) (⇑OrderDual.toDual ∘ l ∘ ⇑OrderDual.ofDual) - GaloisCoinsertion.ofDual 📋 Mathlib.Order.GaloisConnection.Defs
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {l : αᵒᵈ → βᵒᵈ} {u : βᵒᵈ → αᵒᵈ} : GaloisCoinsertion l u → GaloisInsertion (⇑OrderDual.ofDual ∘ u ∘ ⇑OrderDual.toDual) (⇑OrderDual.ofDual ∘ l ∘ ⇑OrderDual.toDual) - GaloisInsertion.ofDual 📋 Mathlib.Order.GaloisConnection.Defs
{α : Type u} {β : Type v} [Preorder α] [Preorder β] {u : αᵒᵈ → βᵒᵈ} {l : βᵒᵈ → αᵒᵈ} : GaloisInsertion l u → GaloisCoinsertion (⇑OrderDual.ofDual ∘ u ∘ ⇑OrderDual.toDual) (⇑OrderDual.ofDual ∘ l ∘ ⇑OrderDual.toDual) - OrderDual.instBiheytingAlgebra 📋 Mathlib.Order.Heyting.Basic
{α : Type u_2} [BiheytingAlgebra α] : BiheytingAlgebra αᵒᵈ - OrderDual.instCoheytingAlgebra 📋 Mathlib.Order.Heyting.Basic
{α : Type u_2} [HeytingAlgebra α] : CoheytingAlgebra αᵒᵈ - OrderDual.instGeneralizedCoheytingAlgebra 📋 Mathlib.Order.Heyting.Basic
{α : Type u_2} [GeneralizedHeytingAlgebra α] : GeneralizedCoheytingAlgebra αᵒᵈ - OrderDual.instGeneralizedHeytingAlgebra 📋 Mathlib.Order.Heyting.Basic
{α : Type u_2} [GeneralizedCoheytingAlgebra α] : GeneralizedHeytingAlgebra αᵒᵈ - OrderDual.instHeytingAlgebra 📋 Mathlib.Order.Heyting.Basic
{α : Type u_2} [CoheytingAlgebra α] : HeytingAlgebra αᵒᵈ - toDual_compl 📋 Mathlib.Order.Heyting.Basic
{α : Type u_2} [HeytingAlgebra α] (a : α) : OrderDual.toDual aᶜ = ¬OrderDual.toDual a - toDual_hnot 📋 Mathlib.Order.Heyting.Basic
{α : Type u_2} [CoheytingAlgebra α] (a : α) : OrderDual.toDual (¬a) = (OrderDual.toDual a)ᶜ - ofDual_compl 📋 Mathlib.Order.Heyting.Basic
{α : Type u_2} [CoheytingAlgebra α] (a : αᵒᵈ) : OrderDual.ofDual aᶜ = ¬OrderDual.ofDual a - ofDual_hnot 📋 Mathlib.Order.Heyting.Basic
{α : Type u_2} [HeytingAlgebra α] (a : αᵒᵈ) : OrderDual.ofDual (¬a) = (OrderDual.ofDual a)ᶜ - toDual_himp 📋 Mathlib.Order.Heyting.Basic
{α : Type u_2} [HeytingAlgebra α] (a b : α) : OrderDual.toDual (a ⇨ b) = OrderDual.toDual b \ OrderDual.toDual a - toDual_sdiff 📋 Mathlib.Order.Heyting.Basic
{α : Type u_2} [CoheytingAlgebra α] (a b : α) : OrderDual.toDual (b \ a) = OrderDual.toDual a ⇨ OrderDual.toDual b - ofDual_himp 📋 Mathlib.Order.Heyting.Basic
{α : Type u_2} [CoheytingAlgebra α] (a b : αᵒᵈ) : OrderDual.ofDual (b ⇨ a) = OrderDual.ofDual a \ OrderDual.ofDual b - ofDual_sdiff 📋 Mathlib.Order.Heyting.Basic
{α : Type u_2} [HeytingAlgebra α] (a b : αᵒᵈ) : OrderDual.ofDual (a \ b) = OrderDual.ofDual b ⇨ OrderDual.ofDual a - OrderDual.instBooleanAlgebra 📋 Mathlib.Order.BooleanAlgebra.Basic
{α : Type u} [BooleanAlgebra α] : BooleanAlgebra αᵒᵈ - toDual_bihimp 📋 Mathlib.Order.SymmDiff
{α : Type u_2} [GeneralizedHeytingAlgebra α] (a b : α) : OrderDual.toDual (bihimp a b) = symmDiff (OrderDual.toDual a) (OrderDual.toDual b) - toDual_symmDiff 📋 Mathlib.Order.SymmDiff
{α : Type u_2} [GeneralizedCoheytingAlgebra α] (a b : α) : OrderDual.toDual (symmDiff a b) = bihimp (OrderDual.toDual a) (OrderDual.toDual b) - ofDual_bihimp 📋 Mathlib.Order.SymmDiff
{α : Type u_2} [GeneralizedCoheytingAlgebra α] (a b : αᵒᵈ) : OrderDual.ofDual (bihimp a b) = symmDiff (OrderDual.ofDual a) (OrderDual.ofDual b) - ofDual_symmDiff 📋 Mathlib.Order.SymmDiff
{α : Type u_2} [GeneralizedHeytingAlgebra α] (a b : αᵒᵈ) : OrderDual.ofDual (symmDiff a b) = bihimp (OrderDual.ofDual a) (OrderDual.ofDual b) - OrderIso.dualDual 📋 Mathlib.Order.Hom.Basic
(α : Type u_2) [LE α] : α ≃o αᵒᵈᵒᵈ - OrderIso.dual 📋 Mathlib.Order.Hom.Basic
{α : Type u_2} {β : Type u_3} [LE α] [LE β] (f : α ≃o β) : αᵒᵈ ≃o βᵒᵈ - OrderHom.dual 📋 Mathlib.Order.Hom.Basic
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] : (α →o β) ≃ (αᵒᵈ →o βᵒᵈ) - OrderEmbedding.dual 📋 Mathlib.Order.Hom.Basic
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] (f : α ↪o β) : αᵒᵈ ↪o βᵒᵈ
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