Loogle!
Result
Found 142 declarations mentioning OmegaCompletePartialOrder.
- OmegaCompletePartialOrder 📋 Mathlib.Order.OmegaCompletePartialOrder
(α : Type u_6) : Type u_6 - Part.omegaCompletePartialOrder 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} : OmegaCompletePartialOrder (Part α) - OmegaCompletePartialOrder.toPartialOrder 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_6} [self : OmegaCompletePartialOrder α] : PartialOrder α - OmegaCompletePartialOrder.ContinuousHom 📋 Mathlib.Order.OmegaCompletePartialOrder
(α : Type u_2) (β : Type u_3) [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] : Type (max u_2 u_3) - OmegaCompletePartialOrder.ContinuousHom.id 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] : α →𝒄 α - OmegaCompletePartialOrder.ωScottContinuous 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f : α → β) : Prop - Prod.instOmegaCompletePartialOrder 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] : OmegaCompletePartialOrder (α × β) - OmegaCompletePartialOrder.ωScottContinuous.fun_id 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] : OmegaCompletePartialOrder.ωScottContinuous fun x => x - OmegaCompletePartialOrder.ωScottContinuous.id 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] : OmegaCompletePartialOrder.ωScottContinuous id - instOmegaCompletePartialOrderForall 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : α → Type u_6} [(a : α) → OmegaCompletePartialOrder (β a)] : OmegaCompletePartialOrder ((a : α) → β a) - OmegaCompletePartialOrder.ωSup 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_6} [self : OmegaCompletePartialOrder α] : OmegaCompletePartialOrder.Chain α → α - OmegaCompletePartialOrder.instPartialOrderContinuousHom 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] : PartialOrder (α →𝒄 β) - OmegaCompletePartialOrder.ContinuousHom.const 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (x : β) : α →𝒄 β - OmegaCompletePartialOrder.ContinuousHom.inst 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] : OmegaCompletePartialOrder (α →𝒄 β) - OmegaCompletePartialOrder.ContinuousHom.Simps.apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (h : α →𝒄 β) : α → β - OmegaCompletePartialOrder.instFunLikeContinuousHom 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] : FunLike (α →𝒄 β) α β - OmegaCompletePartialOrder.ContinuousHom.instInhabited 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] [Inhabited β] : Inhabited (α →𝒄 β) - OmegaCompletePartialOrder.ωScottContinuous.fun_const 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {x : β} : OmegaCompletePartialOrder.ωScottContinuous fun x_1 => x - OmegaCompletePartialOrder.ωScottContinuous.const 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {x : β} : OmegaCompletePartialOrder.ωScottContinuous (Function.const α x) - Prod.ωScottContinuous_fst 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] : OmegaCompletePartialOrder.ωScottContinuous Prod.fst - Prod.ωScottContinuous_snd 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] : OmegaCompletePartialOrder.ωScottContinuous Prod.snd - OmegaCompletePartialOrder.OrderHom.omegaCompletePartialOrder 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] : OmegaCompletePartialOrder (α →o β) - OmegaCompletePartialOrder.ContinuousHom.map 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] {β γ : Type v} (f : β → γ) (g : α →𝒄 Part β) : α →𝒄 Part γ - OmegaCompletePartialOrder.ContinuousHom.ofFun 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f : α → β) (hf : OmegaCompletePartialOrder.ωScottContinuous f := by fun_prop) : α →𝒄 β - OmegaCompletePartialOrder.ContinuousHom.comp 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] [OmegaCompletePartialOrder γ] (f : β →𝒄 γ) (g : α →𝒄 β) : α →𝒄 γ - OmegaCompletePartialOrder.ContinuousHom.flip 📋 Mathlib.Order.OmegaCompletePartialOrder
{β : Type u_3} {γ : Type u_4} [OmegaCompletePartialOrder β] [OmegaCompletePartialOrder γ] {α : Type u_6} (f : α → β →𝒄 γ) : β →𝒄 α → γ - OmegaCompletePartialOrder.ContinuousHom.toOrderHom 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (self : α →𝒄 β) : α →o β - OmegaCompletePartialOrder.ContinuousHom.id_apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] (a : α) : OmegaCompletePartialOrder.ContinuousHom.id a = a - OmegaCompletePartialOrder.ωScottContinuous.apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : α → Type u_6} [(x : α) → OmegaCompletePartialOrder (β x)] (x : α) : OmegaCompletePartialOrder.ωScottContinuous fun f => f x - Prod.ωSupImpl 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α × β)) : α × β - ScottContinuous.ωScottContinuous 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {f : α → β} (hf : ScottContinuous f) : OmegaCompletePartialOrder.ωScottContinuous f - OmegaCompletePartialOrder.ContinuousHom.seq 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] {β γ : Type v} (f : α →𝒄 Part (β → γ)) (g : α →𝒄 Part β) : α →𝒄 Part γ - OmegaCompletePartialOrder.ContinuousHom.ωSup 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α →𝒄 β)) : α →𝒄 β - OmegaCompletePartialOrder.ωScottContinuous.monotone 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {f : α → β} (h : OmegaCompletePartialOrder.ωScottContinuous f) : Monotone f - OmegaCompletePartialOrder.ContinuousHom.comp_id 📋 Mathlib.Order.OmegaCompletePartialOrder
{β : Type u_3} {γ : Type u_4} [OmegaCompletePartialOrder β] [OmegaCompletePartialOrder γ] (f : β →𝒄 γ) : f.comp OmegaCompletePartialOrder.ContinuousHom.id = f - OmegaCompletePartialOrder.ContinuousHom.id_comp 📋 Mathlib.Order.OmegaCompletePartialOrder
{β : Type u_3} {γ : Type u_4} [OmegaCompletePartialOrder β] [OmegaCompletePartialOrder γ] (f : β →𝒄 γ) : OmegaCompletePartialOrder.ContinuousHom.id.comp f = f - OmegaCompletePartialOrder.ContinuousHom.Prod.apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] : (α →𝒄 β) × α →𝒄 β - OmegaCompletePartialOrder.ContinuousHom.ωScottContinuous 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f : α →𝒄 β) : OmegaCompletePartialOrder.ωScottContinuous ⇑f - OmegaCompletePartialOrder.ContinuousHom.const_apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (x : β) (a✝ : α) : (OmegaCompletePartialOrder.ContinuousHom.const x) a✝ = x - OmegaCompletePartialOrder.instOrderHomClassContinuousHom 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] : OrderHomClass (α →𝒄 β) α β - OmegaCompletePartialOrder.ContinuousHom.bind 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] {β γ : Type v} (f : α →𝒄 Part β) (g : α →𝒄 β → Part γ) : α →𝒄 Part γ - OmegaCompletePartialOrder.ωScottContinuous.fun_comp 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] [OmegaCompletePartialOrder γ] {f : α → β} {g : β → γ} (hg : OmegaCompletePartialOrder.ωScottContinuous g) (hf : OmegaCompletePartialOrder.ωScottContinuous f) : OmegaCompletePartialOrder.ωScottContinuous fun x => g (f x) - OmegaCompletePartialOrder.ωScottContinuous.comp 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] [OmegaCompletePartialOrder γ] {f : α → β} {g : β → γ} (hg : OmegaCompletePartialOrder.ωScottContinuous g) (hf : OmegaCompletePartialOrder.ωScottContinuous f) : OmegaCompletePartialOrder.ωScottContinuous (g ∘ f) - OmegaCompletePartialOrder.ContinuousHom.copy 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f : α → β) (g : α →𝒄 β) (h : f = ⇑g) : α →𝒄 β - OmegaCompletePartialOrder.ωScottContinuous.apply₂ 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {γ : Type u_4} {β : α → Type u_6} [(x : α) → OmegaCompletePartialOrder (β x)] [OmegaCompletePartialOrder γ] {f : γ → (x : α) → β x} (hf : OmegaCompletePartialOrder.ωScottContinuous f) (a : α) : OmegaCompletePartialOrder.ωScottContinuous fun x => f x a - OmegaCompletePartialOrder.ωScottContinuous.of_apply₂ 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {γ : Type u_4} {β : α → Type u_6} [(x : α) → OmegaCompletePartialOrder (β x)] [OmegaCompletePartialOrder γ] {f : γ → (x : α) → β x} (hf : ∀ (a : α), OmegaCompletePartialOrder.ωScottContinuous fun x => f x a) : OmegaCompletePartialOrder.ωScottContinuous f - OmegaCompletePartialOrder.ωScottContinuous_iff_apply₂ 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {γ : Type u_4} {β : α → Type u_6} [(x : α) → OmegaCompletePartialOrder (β x)] [OmegaCompletePartialOrder γ] {f : γ → (x : α) → β x} : OmegaCompletePartialOrder.ωScottContinuous f ↔ ∀ (a : α), OmegaCompletePartialOrder.ωScottContinuous fun x => f x a - OmegaCompletePartialOrder.ContinuousHom.ωScottContinuous.map 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] {β γ : Type u_6} {f : β → γ} {g : α → Part β} (hg : OmegaCompletePartialOrder.ωScottContinuous g) : OmegaCompletePartialOrder.ωScottContinuous fun x => f <$> g x - OmegaCompletePartialOrder.ContinuousHom.monotone 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f : α →𝒄 β) : Monotone ⇑f - OmegaCompletePartialOrder.subtype 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_6} [OmegaCompletePartialOrder α] (p : α → Prop) (hp : ∀ (c : OmegaCompletePartialOrder.Chain α), (∀ i ∈ c, p i) → p (OmegaCompletePartialOrder.ωSup c)) : OmegaCompletePartialOrder (Subtype p) - OmegaCompletePartialOrder.ContinuousHom.ofFun_apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f : α → β) (hf : OmegaCompletePartialOrder.ωScottContinuous f := by fun_prop) (a✝ : α) : (OmegaCompletePartialOrder.ContinuousHom.ofFun f hf) a✝ = f a✝ - OmegaCompletePartialOrder.le_ωSup 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_6} [self : OmegaCompletePartialOrder α] (c : OmegaCompletePartialOrder.Chain α) (i : ℕ) : c i ≤ OmegaCompletePartialOrder.ωSup c - Prod.ωScottContinuous.prodMk 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] [OmegaCompletePartialOrder γ] {f : α → β} (hf : OmegaCompletePartialOrder.ωScottContinuous f) {g : α → γ} (hg : OmegaCompletePartialOrder.ωScottContinuous g) : OmegaCompletePartialOrder.ωScottContinuous fun x => (f x, g x) - OmegaCompletePartialOrder.isLUB_range_ωSup 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] (c : OmegaCompletePartialOrder.Chain α) : IsLUB (Set.range ⇑c) (OmegaCompletePartialOrder.ωSup c) - OmegaCompletePartialOrder.OrderHom.ωSup 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α →o β)) : α →o β - OmegaCompletePartialOrder.ContinuousHom.ωSup_def 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α →𝒄 β)) : OmegaCompletePartialOrder.ωSup c = OmegaCompletePartialOrder.ContinuousHom.ωSup c - OmegaCompletePartialOrder.ContinuousHom.toMono 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] : (α →𝒄 β) →o α →o β - OmegaCompletePartialOrder.ωSup_eq_of_isLUB 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] {c : OmegaCompletePartialOrder.Chain α} {a : α} (h : IsLUB (Set.range ⇑c) a) : a = OmegaCompletePartialOrder.ωSup c - OmegaCompletePartialOrder.ωSup_le_ωSup_of_le 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] {c₀ c₁ : OmegaCompletePartialOrder.Chain α} (h : c₀ ≤ c₁) : OmegaCompletePartialOrder.ωSup c₀ ≤ OmegaCompletePartialOrder.ωSup c₁ - OmegaCompletePartialOrder.ContinuousHom.congr_arg 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f : α →𝒄 β) {x y : α} (h : x = y) : f x = f y - OmegaCompletePartialOrder.ContinuousHom.ωScottContinuous.seq 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] {β γ : Type u_6} {f : α → Part (β → γ)} {g : α → Part β} (hf : OmegaCompletePartialOrder.ωScottContinuous f) (hg : OmegaCompletePartialOrder.ωScottContinuous g) : OmegaCompletePartialOrder.ωScottContinuous fun x => f x <*> g x - OmegaCompletePartialOrder.ContinuousHom.ωScottContinuous.bind 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] {β γ : Type u_6} {f : α → Part β} {g : α → β → Part γ} (hf : OmegaCompletePartialOrder.ωScottContinuous f) (hg : OmegaCompletePartialOrder.ωScottContinuous g) : OmegaCompletePartialOrder.ωScottContinuous fun x => f x >>= g x - OmegaCompletePartialOrder.le_ωSup_of_le 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] {c : OmegaCompletePartialOrder.Chain α} {x : α} (i : ℕ) (h : x ≤ c i) : x ≤ OmegaCompletePartialOrder.ωSup c - OmegaCompletePartialOrder.ωSup_le 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_6} [self : OmegaCompletePartialOrder α] (c : OmegaCompletePartialOrder.Chain α) (x : α) : (∀ (i : ℕ), c i ≤ x) → OmegaCompletePartialOrder.ωSup c ≤ x - OmegaCompletePartialOrder.ωSup_le_iff 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] {c : OmegaCompletePartialOrder.Chain α} {x : α} : OmegaCompletePartialOrder.ωSup c ≤ x ↔ ∀ (i : ℕ), c i ≤ x - OmegaCompletePartialOrder.ContinuousHom.coe_inj 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f g : α →𝒄 β) (h : ⇑f = ⇑g) : f = g - Prod.ωSup_zip 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c₀ : OmegaCompletePartialOrder.Chain α) (c₁ : OmegaCompletePartialOrder.Chain β) : OmegaCompletePartialOrder.ωSup (c₀.zip c₁) = (OmegaCompletePartialOrder.ωSup c₀, OmegaCompletePartialOrder.ωSup c₁) - OmegaCompletePartialOrder.ContinuousHom.congr_fun 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {f g : α →𝒄 β} (h : f = g) (x : α) : f x = g x - OmegaCompletePartialOrder.ContinuousHom.ext 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f g : α →𝒄 β) (h : ∀ (x : α), f x = g x) : f = g - OmegaCompletePartialOrder.ContinuousHom.copy_apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f : α → β) (g : α →𝒄 β) (h : f = ⇑g) (a✝ : α) : (OmegaCompletePartialOrder.ContinuousHom.copy f g h) a✝ = f a✝ - OmegaCompletePartialOrder.ContinuousHom.ext_iff 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {f g : α →𝒄 β} : f = g ↔ ∀ (x : α), f x = g x - OmegaCompletePartialOrder.ContinuousHom.toOrderHom_eq_coe 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f : α →𝒄 β) : f.toOrderHom = ↑f - OmegaCompletePartialOrder.ContinuousHom.ωScottContinuous_apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] [OmegaCompletePartialOrder γ] {f : α → β →𝒄 γ} (hf : OmegaCompletePartialOrder.ωScottContinuous f) {g : α → β} (hg : OmegaCompletePartialOrder.ωScottContinuous g) : OmegaCompletePartialOrder.ωScottContinuous fun x => (f x) (g x) - OmegaCompletePartialOrder.ContinuousHom.coe_toOrderHom 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f : α →𝒄 β) : ⇑f.toOrderHom = ⇑f - OmegaCompletePartialOrder.ContinuousHom.map_ωSup' 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (self : α →𝒄 β) (c : OmegaCompletePartialOrder.Chain α) : self.toFun (OmegaCompletePartialOrder.ωSup c) = OmegaCompletePartialOrder.ωSup (c.map self.toOrderHom) - OmegaCompletePartialOrder.fixedPoints.iterateChain 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] (f : α →o α) (x : α) (h : x ≤ f x) : OmegaCompletePartialOrder.Chain α - OmegaCompletePartialOrder.ωScottContinuous.map_ωSup 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {f : α → β} (hf : OmegaCompletePartialOrder.ωScottContinuous f) (c : OmegaCompletePartialOrder.Chain α) : f (OmegaCompletePartialOrder.ωSup c) = OmegaCompletePartialOrder.ωSup (c.map { toFun := f, monotone' := ⋯ }) - OmegaCompletePartialOrder.ContinuousHom.comp_assoc 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} {γ : Type u_4} {δ : Type u_5} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] [OmegaCompletePartialOrder γ] [OmegaCompletePartialOrder δ] (f : γ →𝒄 δ) (g : β →𝒄 γ) (h : α →𝒄 β) : f.comp (g.comp h) = (f.comp g).comp h - OmegaCompletePartialOrder.ContinuousHom.mk 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (toOrderHom : α →o β) (map_ωSup' : ∀ (c : OmegaCompletePartialOrder.Chain α), toOrderHom.toFun (OmegaCompletePartialOrder.ωSup c) = OmegaCompletePartialOrder.ωSup (c.map toOrderHom)) : α →𝒄 β - OmegaCompletePartialOrder.ContinuousHom.flip_apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{β : Type u_3} {γ : Type u_4} [OmegaCompletePartialOrder β] [OmegaCompletePartialOrder γ] {α : Type u_6} (f : α → β →𝒄 γ) (x : β) (y : α) : (OmegaCompletePartialOrder.ContinuousHom.flip f) x y = (f y) x - OmegaCompletePartialOrder.ContinuousHom.map_apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] {β γ : Type v} (f : β → γ) (g : α →𝒄 Part β) (x : α) : (OmegaCompletePartialOrder.ContinuousHom.map f g) x = Part.map f (g x) - Prod.ωSupImpl_fst 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α × β)) : (Prod.ωSupImpl c).1 = OmegaCompletePartialOrder.ωSup (c.map OrderHom.fst) - Prod.ωSupImpl_snd 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α × β)) : (Prod.ωSupImpl c).2 = OmegaCompletePartialOrder.ωSup (c.map OrderHom.snd) - OmegaCompletePartialOrder.ContinuousHom.comp_apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] [OmegaCompletePartialOrder γ] (f : β →𝒄 γ) (g : α →𝒄 β) (a✝ : α) : (f.comp g) a✝ = f (g a✝) - Prod.ωSup_fst 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α × β)) : (OmegaCompletePartialOrder.ωSup c).1 = OmegaCompletePartialOrder.ωSup (c.map OrderHom.fst) - Prod.ωSup_snd 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α × β)) : (OmegaCompletePartialOrder.ωSup c).2 = OmegaCompletePartialOrder.ωSup (c.map OrderHom.snd) - OmegaCompletePartialOrder.mk 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_6} [toPartialOrder : PartialOrder α] (ωSup : OmegaCompletePartialOrder.Chain α → α) (le_ωSup : ∀ (c : OmegaCompletePartialOrder.Chain α) (i : ℕ), c i ≤ ωSup c) (ωSup_le : ∀ (c : OmegaCompletePartialOrder.Chain α) (x : α), (∀ (i : ℕ), c i ≤ x) → ωSup c ≤ x) : OmegaCompletePartialOrder α - OmegaCompletePartialOrder.ContinuousHom.continuous 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (F : α →𝒄 β) (C : OmegaCompletePartialOrder.Chain α) : F (OmegaCompletePartialOrder.ωSup C) = OmegaCompletePartialOrder.ωSup (C.map ↑F) - OmegaCompletePartialOrder.ωScottContinuous.monotone_map_ωSup 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {f : α → β} : OmegaCompletePartialOrder.ωScottContinuous f → ∃ (hf : Monotone f), ∀ (c : OmegaCompletePartialOrder.Chain α), f (OmegaCompletePartialOrder.ωSup c) = OmegaCompletePartialOrder.ωSup (c.map { toFun := f, monotone' := hf }) - OmegaCompletePartialOrder.ωScottContinuous.of_monotone_map_ωSup 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {f : α → β} : (∃ (hf : Monotone f), ∀ (c : OmegaCompletePartialOrder.Chain α), f (OmegaCompletePartialOrder.ωSup c) = OmegaCompletePartialOrder.ωSup (c.map { toFun := f, monotone' := hf })) → OmegaCompletePartialOrder.ωScottContinuous f - OmegaCompletePartialOrder.ωScottContinuous_iff_monotone_map_ωSup 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {f : α → β} : OmegaCompletePartialOrder.ωScottContinuous f ↔ ∃ (hf : Monotone f), ∀ (c : OmegaCompletePartialOrder.Chain α), f (OmegaCompletePartialOrder.ωSup c) = OmegaCompletePartialOrder.ωSup (c.map { toFun := f, monotone' := hf }) - OmegaCompletePartialOrder.ContinuousHom.coe_apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (a : α) (f : α →𝒄 β) : ↑f a = f a - OmegaCompletePartialOrder.ωScottContinuous.isLUB 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {f : α → β} {c : OmegaCompletePartialOrder.Chain α} (hf : OmegaCompletePartialOrder.ωScottContinuous f) : IsLUB (Set.range ⇑(c.map { toFun := f, monotone' := ⋯ })) (f (OmegaCompletePartialOrder.ωSup c)) - OmegaCompletePartialOrder.ContinuousHom.apply_mono 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {f g : α →𝒄 β} {x y : α} (h₁ : f ≤ g) (h₂ : x ≤ y) : f x ≤ g y - OmegaCompletePartialOrder.fixedPoints.ωSup_iterate_mem_fixedPoint 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] (f : α →𝒄 α) (x : α) (h : x ≤ f x) : OmegaCompletePartialOrder.ωSup (OmegaCompletePartialOrder.fixedPoints.iterateChain (↑f) x h) ∈ Function.fixedPoints ⇑f - OmegaCompletePartialOrder.ωSup_total 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] {c : OmegaCompletePartialOrder.Chain α} {x : α} (h : ∀ (i : ℕ), c i ≤ x ∨ x ≤ c i) : OmegaCompletePartialOrder.ωSup c ≤ x ∨ x ≤ OmegaCompletePartialOrder.ωSup c - OmegaCompletePartialOrder.ContinuousHom.seq_apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] {β γ : Type v} (f : α →𝒄 Part (β → γ)) (g : α →𝒄 Part β) (x : α) : (f.seq g) x = f x <*> g x - OmegaCompletePartialOrder.ContinuousHom.Prod.apply_apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f : (α →𝒄 β) × α) : OmegaCompletePartialOrder.ContinuousHom.Prod.apply f = f.1 f.2 - OmegaCompletePartialOrder.ContinuousHom.bind_apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] {β γ : Type v} (f : α →𝒄 Part β) (g : α →𝒄 β → Part γ) (x : α) : (f.bind g) x = (f x).bind (g x) - OmegaCompletePartialOrder.ωScottContinuous.map_ωSup_of_orderHom 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {f : α →o β} : OmegaCompletePartialOrder.ωScottContinuous ⇑f → ∀ (c : OmegaCompletePartialOrder.Chain α), f (OmegaCompletePartialOrder.ωSup c) = OmegaCompletePartialOrder.ωSup (c.map f) - OmegaCompletePartialOrder.ωScottContinuous.of_map_ωSup_of_orderHom 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {f : α →o β} : (∀ (c : OmegaCompletePartialOrder.Chain α), f (OmegaCompletePartialOrder.ωSup c) = OmegaCompletePartialOrder.ωSup (c.map f)) → OmegaCompletePartialOrder.ωScottContinuous ⇑f - OmegaCompletePartialOrder.ωScottContinuous_iff_map_ωSup_of_orderHom 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {f : α →o β} : OmegaCompletePartialOrder.ωScottContinuous ⇑f ↔ ∀ (c : OmegaCompletePartialOrder.Chain α), f (OmegaCompletePartialOrder.ωSup c) = OmegaCompletePartialOrder.ωSup (c.map f) - OmegaCompletePartialOrder.fixedPoints.ωSup_iterate_le_fixedPoint 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] (f : α →𝒄 α) (x : α) (h : x ≤ f x) {a : α} (h_a : a ∈ Function.fixedPoints ⇑f) (h_x_le_a : x ≤ a) : OmegaCompletePartialOrder.ωSup (OmegaCompletePartialOrder.fixedPoints.iterateChain (↑f) x h) ≤ a - OmegaCompletePartialOrder.ContinuousHom.coe_mk 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f : α →o β) (hf : ∀ (c : OmegaCompletePartialOrder.Chain α), f.toFun (OmegaCompletePartialOrder.ωSup c) = OmegaCompletePartialOrder.ωSup (c.map f)) : ⇑{ toOrderHom := f, map_ωSup' := hf } = ⇑f - OmegaCompletePartialOrder.fixedPoints.ωSup_iterate_le_prefixedPoint 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] (f : α →𝒄 α) (x : α) (h : x ≤ f x) {a : α} (h_a : f a ≤ a) (h_x_le_a : x ≤ a) : OmegaCompletePartialOrder.ωSup (OmegaCompletePartialOrder.fixedPoints.iterateChain (↑f) x h) ≤ a - OmegaCompletePartialOrder.OrderHom.ωSup_coe 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α →o β)) (a : α) : (OmegaCompletePartialOrder.OrderHom.ωSup c) a = OmegaCompletePartialOrder.ωSup (c.map (OrderHom.apply a)) - OmegaCompletePartialOrder.OrderHom.omegaCompletePartialOrder_ωSup_coe 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α →o β)) (a : α) : (OmegaCompletePartialOrder.ωSup c) a = OmegaCompletePartialOrder.ωSup (c.map (OrderHom.apply a)) - OmegaCompletePartialOrder.lift 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [PartialOrder β] (f : β →o α) (ωSup₀ : OmegaCompletePartialOrder.Chain β → β) (h : ∀ (x y : β), f x ≤ f y → x ≤ y) (h' : ∀ (c : OmegaCompletePartialOrder.Chain β), f (ωSup₀ c) = OmegaCompletePartialOrder.ωSup (c.map f)) : OmegaCompletePartialOrder β - OmegaCompletePartialOrder.ContinuousHom.ωSup_bind 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} [OmegaCompletePartialOrder α] {β γ : Type v} (c : OmegaCompletePartialOrder.Chain α) (f : α →o Part β) (g : α →o β → Part γ) : OmegaCompletePartialOrder.ωSup (c.map (f.partBind g)) = OmegaCompletePartialOrder.ωSup (c.map f) >>= OmegaCompletePartialOrder.ωSup (c.map g) - OmegaCompletePartialOrder.ContinuousHom.ωSup_apply 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α →𝒄 β)) (a : α) : (OmegaCompletePartialOrder.ContinuousHom.ωSup c) a = OmegaCompletePartialOrder.ωSup ((c.map OmegaCompletePartialOrder.ContinuousHom.toMono).map (OrderHom.apply a)) - OmegaCompletePartialOrder.ContinuousHom.toMono_coe 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f : α →𝒄 β) : OmegaCompletePartialOrder.ContinuousHom.toMono f = ↑f - OmegaCompletePartialOrder.ContinuousHom.ωSup_apply_ωSup 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c₀ : OmegaCompletePartialOrder.Chain (α →𝒄 β)) (c₁ : OmegaCompletePartialOrder.Chain α) : (OmegaCompletePartialOrder.ωSup c₀) (OmegaCompletePartialOrder.ωSup c₁) = OmegaCompletePartialOrder.ContinuousHom.Prod.apply (OmegaCompletePartialOrder.ωSup (c₀.zip c₁)) - OmegaCompletePartialOrder.ContinuousHom.forall_forall_merge 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c₀ : OmegaCompletePartialOrder.Chain (α →𝒄 β)) (c₁ : OmegaCompletePartialOrder.Chain α) (z : β) : (∀ (i j : ℕ), (c₀ i) (c₁ j) ≤ z) ↔ ∀ (i : ℕ), (c₀ i) (c₁ i) ≤ z - OmegaCompletePartialOrder.ContinuousHom.forall_forall_merge' 📋 Mathlib.Order.OmegaCompletePartialOrder
{α : Type u_2} {β : Type u_3} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c₀ : OmegaCompletePartialOrder.Chain (α →𝒄 β)) (c₁ : OmegaCompletePartialOrder.Chain α) (z : β) : (∀ (j i : ℕ), (c₀ i) (c₁ j) ≤ z) ↔ ∀ (i : ℕ), (c₀ i) (c₁ i) ≤ z - ChainCompletePartialOrder.instOmegaCompletePartialOrder 📋 Mathlib.Order.BourbakiWitt
{α : Type u_1} [ChainCompletePartialOrder α] : OmegaCompletePartialOrder α - CompleteLattice.ωScottContinuous.iSup 📋 Mathlib.Order.BourbakiWitt
{α : Type u_1} {β : Type u_2} {ι : Sort u_3} [OmegaCompletePartialOrder α] [CompleteLattice β] {f : ι → α → β} (hf : ∀ (i : ι), OmegaCompletePartialOrder.ωScottContinuous (f i)) : OmegaCompletePartialOrder.ωScottContinuous (⨆ i, f i) - CompleteLattice.ωScottContinuous.bot 📋 Mathlib.Order.BourbakiWitt
{α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [CompleteLattice β] : OmegaCompletePartialOrder.ωScottContinuous ⊥ - CompleteLattice.ωScottContinuous.top 📋 Mathlib.Order.BourbakiWitt
{α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [CompleteLattice β] : OmegaCompletePartialOrder.ωScottContinuous ⊤ - CompleteLattice.ωScottContinuous.sSup 📋 Mathlib.Order.BourbakiWitt
{α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [CompleteLattice β] {s : Set (α → β)} (hs : ∀ f ∈ s, OmegaCompletePartialOrder.ωScottContinuous f) : OmegaCompletePartialOrder.ωScottContinuous (sSup s) - CompleteLattice.ωScottContinuous.sup 📋 Mathlib.Order.BourbakiWitt
{α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [CompleteLattice β] {f g : α → β} (hf : OmegaCompletePartialOrder.ωScottContinuous f) (hg : OmegaCompletePartialOrder.ωScottContinuous g) : OmegaCompletePartialOrder.ωScottContinuous (f ⊔ g) - CompleteLattice.ωScottContinuous.inf 📋 Mathlib.Order.BourbakiWitt
{α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [CompleteLinearOrder β] {f g : α → β} (hf : OmegaCompletePartialOrder.ωScottContinuous f) (hg : OmegaCompletePartialOrder.ωScottContinuous g) : OmegaCompletePartialOrder.ωScottContinuous (f ⊓ g) - LawfulFix 📋 Mathlib.Control.LawfulFix
(α : Type u_3) [OmegaCompletePartialOrder α] : Type u_3 - LawfulFix.toFix 📋 Mathlib.Control.LawfulFix
{α : Type u_3} {inst✝ : OmegaCompletePartialOrder α} [self : LawfulFix α] : Fix α - LawfulFix.mk 📋 Mathlib.Control.LawfulFix
{α : Type u_3} [OmegaCompletePartialOrder α] [toFix : Fix α] (fix_eq : ∀ {f : α → α}, OmegaCompletePartialOrder.ωScottContinuous f → Fix.fix f = f (Fix.fix f)) : LawfulFix α - LawfulFix.fix_eq 📋 Mathlib.Control.LawfulFix
{α : Type u_3} {inst✝ : OmegaCompletePartialOrder α} [self : LawfulFix α] {f : α → α} : OmegaCompletePartialOrder.ωScottContinuous f → Fix.fix f = f (Fix.fix f) - Pi.lawfulFix' 📋 Mathlib.Control.LawfulFix
{α : Type u_1} {β : α → Type u_2} {γ : (a : α) → β a → Type u_3} [(x : α) → (y : β x) → OmegaCompletePartialOrder (γ x y)] [LawfulFix ((x : Sigma β) → γ x.fst x.snd)] : LawfulFix ((x : α) → (y : β x) → γ x y) - Pi.ωScottContinuous_uncurry 📋 Mathlib.Control.LawfulFix
(α : Type u_1) (β : α → Type u_2) (γ : (a : α) → β a → Type u_3) [(x : α) → (y : β x) → OmegaCompletePartialOrder (γ x y)] : OmegaCompletePartialOrder.ωScottContinuous ⇑(Pi.monotoneUncurry α β γ) - Pi.ωScottContinuous_curry 📋 Mathlib.Control.LawfulFix
(α : Type u_1) (β : α → Type u_2) (γ : (a : α) → β a → Type u_3) [(x : α) → (y : β x) → OmegaCompletePartialOrder (γ x y)] : OmegaCompletePartialOrder.ωScottContinuous ⇑(Pi.monotoneCurry α β γ) - Pi.uncurry_curry_ωScottContinuous 📋 Mathlib.Control.LawfulFix
{α : Type u_1} {β : α → Type u_2} {γ : (a : α) → β a → Type u_3} [(x : α) → (y : β x) → OmegaCompletePartialOrder (γ x y)] {f : ((a : α) → (b : β a) → γ a b) → (a : α) → (b : β a) → γ a b} (hc : OmegaCompletePartialOrder.ωScottContinuous f) : OmegaCompletePartialOrder.ωScottContinuous ⇑((Pi.monotoneUncurry α β γ).comp ({ toFun := f, monotone' := ⋯ }.comp (Pi.monotoneCurry α β γ))) - ωCPO.of 📋 Mathlib.Order.Category.OmegaCompletePartialOrder
(carrier : Type u) [str : OmegaCompletePartialOrder carrier] : ωCPO - ωCPO.str 📋 Mathlib.Order.Category.OmegaCompletePartialOrder
(self : ωCPO) : OmegaCompletePartialOrder self.carrier - ωCPO.coe_of 📋 Mathlib.Order.Category.OmegaCompletePartialOrder
(α : Type u_1) [OmegaCompletePartialOrder α] : { carrier := α, str := inst✝ }.carrier = α - ωCPO.omegaCompletePartialOrderEqualizer 📋 Mathlib.Order.Category.OmegaCompletePartialOrder
{α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f g : α →𝒄 β) : OmegaCompletePartialOrder { a // f a = g a } - ωCPO.HasEqualizers.equalizerι 📋 Mathlib.Order.Category.OmegaCompletePartialOrder
{α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (f g : α →𝒄 β) : { a // f a = g a } →𝒄 α - CompletePartialOrder.toOmegaCompletePartialOrder 📋 Mathlib.Order.CompletePartialOrder
{α : Type u_2} [CompletePartialOrder α] : OmegaCompletePartialOrder α - Scott.IsOpen 📋 Mathlib.Topology.OmegaCompletePartialOrder
(α : Type u) [OmegaCompletePartialOrder α] (s : Set α) : Prop - Scott.isOpen_univ 📋 Mathlib.Topology.OmegaCompletePartialOrder
(α : Type u) [OmegaCompletePartialOrder α] : Scott.IsOpen α Set.univ - Scott.IsOpen.isUpperSet 📋 Mathlib.Topology.OmegaCompletePartialOrder
(α : Type u) [OmegaCompletePartialOrder α] {s : Set α} (hs : Scott.IsOpen α s) : IsUpperSet s - isωSup_ωSup 📋 Mathlib.Topology.OmegaCompletePartialOrder
{α : Type u_1} [OmegaCompletePartialOrder α] (c : OmegaCompletePartialOrder.Chain α) : Scott.IsωSup c (OmegaCompletePartialOrder.ωSup c) - Scott.IsOpen.inter 📋 Mathlib.Topology.OmegaCompletePartialOrder
(α : Type u) [OmegaCompletePartialOrder α] (s t : Set α) : Scott.IsOpen α s → Scott.IsOpen α t → Scott.IsOpen α (s ∩ t) - Scott.isOpen_sUnion 📋 Mathlib.Topology.OmegaCompletePartialOrder
(α : Type u) [OmegaCompletePartialOrder α] (s : Set (Set α)) (hs : ∀ t ∈ s, Scott.IsOpen α t) : Scott.IsOpen α (⋃₀ s) - Topology.IsScott.ωScottContinuous_iff_continuous 📋 Mathlib.Topology.OmegaCompletePartialOrder
{α : Type u_1} [OmegaCompletePartialOrder α] [TopologicalSpace α] [Topology.IsScott α (Set.range fun c => Set.range ⇑c)] {f : α → Prop} : OmegaCompletePartialOrder.ωScottContinuous f ↔ Continuous f
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