WithBot, WithTop

Adding a bot or a top to an order.

Main declarations

• With<Top/Bot> α: Equips Option α with the order on α plus none as the top/bottom element.

instance WithBot.nontrivial {α : Type u_1} [Nonempty α] : Nontrivial (WithBot α)

theorem WithBot.coe_injective {α : Type u_1} : Function.Injective some

@[simp]

theorem WithBot.coe_inj {α : Type u_1} {a b : α} : ↑a = ↑b ↔ a = b

theorem WithBot.forall {α : Type u_1} {p : WithBot α → Prop} : (∀ (x : WithBot α), p x) ↔ p ⊥ ∧ ∀ (x : α), p ↑x

theorem WithBot.exists {α : Type u_1} {p : WithBot α → Prop} : (∃ (x : WithBot α), p x) ↔ p ⊥ ∨ ∃ (x : α), p ↑x

theorem WithBot.none_eq_bot {α : Type u_1} : none = ⊥

theorem WithBot.some_eq_coe {α : Type u_1} (a : α) : Option.some a = ↑a

@[simp]

theorem WithBot.bot_ne_coe {α : Type u_1} {a : α} : ⊥ ≠ ↑a

@[simp]

theorem WithBot.coe_ne_bot {α : Type u_1} {a : α} : ↑a ≠ ⊥

def WithBot.unbotD {α : Type u_1} (d : α) (x : WithBot α) : α

Specialization of Option.getD to values in WithBot α that respects API boundaries.

Equations

• WithBot.unbotD d x = WithBot.recBotCoe d id x

@[simp]

theorem WithBot.unbotD_bot {α : Type u_5} (d : α) : unbotD d ⊥ = d

@[simp]

theorem WithBot.unbotD_coe {α : Type u_5} (d x : α) : unbotD d ↑x = x

theorem WithBot.coe_eq_coe {α : Type u_1} {a b : α} : ↑a = ↑b ↔ a = b

theorem WithBot.unbotD_eq_iff {α : Type u_1} {d y : α} {x : WithBot α} : unbotD d x = y ↔ x = ↑y ∨ x = ⊥ ∧ y = d

@[simp]

theorem WithBot.unbotD_eq_self_iff {α : Type u_1} {d : α} {x : WithBot α} : unbotD d x = d ↔ x = ↑d ∨ x = ⊥

theorem WithBot.unbotD_eq_unbotD_iff {α : Type u_1} {d : α} {x y : WithBot α} : unbotD d x = unbotD d y ↔ x = y ∨ x = ↑d ∧ y = ⊥ ∨ x = ⊥ ∧ y = ↑d

def WithBot.map {α : Type u_1} {β : Type u_2} (f : α → β) : WithBot α → WithBot β

Lift a map f : α → β to WithBot α → WithBot β. Implemented using Option.map.

Equations

• WithBot.map f = Option.map f

@[simp]

theorem WithBot.map_bot {α : Type u_1} {β : Type u_2} (f : α → β) : map f ⊥ = ⊥

@[simp]

theorem WithBot.map_coe {α : Type u_1} {β : Type u_2} (f : α → β) (a : α) : map f ↑a = ↑(f a)

@[simp]

theorem WithBot.map_eq_bot_iff {α : Type u_1} {β : Type u_2} {f : α → β} {a : WithBot α} : map f a = ⊥ ↔ a = ⊥

theorem WithBot.map_eq_some_iff {α : Type u_1} {β : Type u_2} {f : α → β} {y : β} {v : WithBot α} : map f v = ↑y ↔ ∃ (x : α), v = ↑x ∧ f x = y

theorem WithBot.some_eq_map_iff {α : Type u_1} {β : Type u_2} {f : α → β} {y : β} {v : WithBot α} : ↑y = map f v ↔ ∃ (x : α), v = ↑x ∧ f x = y

theorem WithBot.map_id {α : Type u_1} : map id = id

@[simp]

theorem WithBot.map_map {α : Type u_1} {β : Type u_2} {γ : Type u_3} (h : β → γ) (g : α → β) (a : WithBot α) : map h (map g a) = map (h ∘ g) a

theorem WithBot.comp_map {α : Type u_1} {β : Type u_2} {γ : Type u_3} (h : β → γ) (g : α → β) (x : WithBot α) : map (h ∘ g) x = map h (map g x)

@[simp]

theorem WithBot.map_comp_map {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β) (g : β → γ) : map g ∘ map f = map (g ∘ f)

theorem WithBot.map_comm {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} {f₁ : α → β} {f₂ : α → γ} {g₁ : β → δ} {g₂ : γ → δ} (h : g₁ ∘ f₁ = g₂ ∘ f₂) (a : α) : map g₁ (map f₁ ↑a) = map g₂ (map f₂ ↑a)

theorem WithBot.map_injective {α : Type u_1} {β : Type u_2} {f : α → β} (Hf : Function.Injective f) : Function.Injective (map f)

def WithBot.map₂ {α : Type u_1} {β : Type u_2} {γ : Type u_3} : (α → β → γ) → WithBot α → WithBot β → WithBot γ

The image of a binary function f : α → β → γ as a function WithBot α → WithBot β → WithBot γ.

Mathematically this should be thought of as the image of the corresponding function α × β → γ.

Equations

• WithBot.map₂ = Option.map₂

theorem WithBot.map₂_coe_coe {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β → γ) (a : α) (b : β) : map₂ f ↑a ↑b = ↑(f a b)

@[simp]

theorem WithBot.map₂_bot_left {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β → γ) (b : WithBot β) : map₂ f ⊥ b = ⊥

@[simp]

theorem WithBot.map₂_bot_right {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β → γ) (a : WithBot α) : map₂ f a ⊥ = ⊥

@[simp]

theorem WithBot.map₂_coe_left {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β → γ) (a : α) (b : WithBot β) : map₂ f (↑a) b = map (fun (b : β) => f a b) b

@[simp]

theorem WithBot.map₂_coe_right {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β → γ) (a : WithBot α) (b : β) : map₂ f a ↑b = map (fun (x : α) => f x b) a

@[simp]

theorem WithBot.map₂_eq_bot_iff {α : Type u_1} {β : Type u_2} {γ : Type u_3} {f : α → β → γ} {a : WithBot α} {b : WithBot β} : map₂ f a b = ⊥ ↔ a = ⊥ ∨ b = ⊥

theorem WithBot.ne_bot_iff_exists {α : Type u_1} {x : WithBot α} : x ≠ ⊥ ↔ ∃ (a : α), ↑a = x

theorem WithBot.eq_bot_iff_forall_ne {α : Type u_1} {x : WithBot α} : x = ⊥ ↔ ∀ (a : α), ↑a ≠ x

@[deprecated WithBot.eq_bot_iff_forall_ne (since := "2025-03-19")]

theorem WithBot.forall_ne_iff_eq_bot {α : Type u_1} {x : WithBot α} : x = ⊥ ↔ ∀ (a : α), ↑a ≠ x

Alias of WithBot.eq_bot_iff_forall_ne.

theorem WithBot.forall_ne_bot {α : Type u_1} {p : WithBot α → Prop} : (∀ (x : WithBot α), x ≠ ⊥ → p x) ↔ ∀ (x : α), p ↑x

theorem WithBot.exists_ne_bot {α : Type u_1} {p : WithBot α → Prop} : (∃ (x : WithBot α), x ≠ ⊥ ∧ p x) ↔ ∃ (x : α), p ↑x

def WithBot.unbot {α : Type u_1} (x : WithBot α) : x ≠ ⊥ → α

Deconstruct a x : WithBot α to the underlying value in α, given a proof that x ≠ ⊥.

Equations

• WithBot.unbot (some x_2) x_3 = x_2

@[simp]

theorem WithBot.coe_unbot {α : Type u_1} (x : WithBot α) (hx : x ≠ ⊥) : ↑(x.unbot hx) = x

@[simp]

theorem WithBot.unbot_coe {α : Type u_1} (x : α) (h : ↑x ≠ ⊥ := ⋯) : (↑x).unbot h = x

instance WithBot.canLift {α : Type u_1} : CanLift (WithBot α) α some fun (r : WithBot α) => r ≠ ⊥

instance WithBot.instTop {α : Type u_1} [Top α] : Top (WithBot α)

Equations

• WithBot.instTop = { top := ↑⊤ }

@[simp]

theorem WithBot.coe_top {α : Type u_1} [Top α] : ↑⊤ = ⊤

@[simp]

theorem WithBot.coe_eq_top {α : Type u_1} [Top α] {a : α} : ↑a = ⊤ ↔ a = ⊤

@[simp]

theorem WithBot.top_eq_coe {α : Type u_1} [Top α] {a : α} : ⊤ = ↑a ↔ ⊤ = a

theorem WithBot.unbot_eq_iff {α : Type u_1} {a : WithBot α} {b : α} (h : a ≠ ⊥) : a.unbot h = b ↔ a = ↑b

theorem WithBot.eq_unbot_iff {α : Type u_1} {a : α} {b : WithBot α} (h : b ≠ ⊥) : a = b.unbot h ↔ ↑a = b

def Equiv.withBotSubtypeNe {α : Type u_1} : { y : WithBot α // y ≠ ⊥ } ≃ α

The equivalence between the non-bottom elements of WithBot α and α.

Equations

• Equiv.withBotSubtypeNe = { toFun := fun (x : { y : WithBot α // y ≠ ⊥ }) => match x with | ⟨x, h⟩ => x.unbot h, invFun := fun (x : α) => ⟨↑x, ⋯⟩, left_inv := ⋯, right_inv := ⋯ }

@[simp]

theorem Equiv.withBotSubtypeNe_apply {α : Type u_1} (x✝ : { y : WithBot α // y ≠ ⊥ }) : withBotSubtypeNe x✝ = match x✝ with | ⟨x, h⟩ => x.unbot h

@[simp]

theorem Equiv.withBotSubtypeNe_symm_apply_coe {α : Type u_1} (x : α) : ↑(withBotSubtypeNe.symm x) = ↑x

def Equiv.withBotCongr {α : Type u_1} {β : Type u_2} (e : α ≃ β) : WithBot α ≃ WithBot β

A universe-polymorphic version of EquivFunctor.mapEquiv WithBot e.

Equations

• e.withBotCongr = { toFun := WithBot.map ⇑e, invFun := WithBot.map ⇑e.symm, left_inv := ⋯, right_inv := ⋯ }

@[simp]

theorem Equiv.withBotCongr_apply {α : Type u_1} {β : Type u_2} (e : α ≃ β) (a✝ : WithBot α) : e.withBotCongr a✝ = WithBot.map (⇑e) a✝

@[simp]

theorem Equiv.withBotCongr_refl {α : Type u_1} : (Equiv.refl α).withBotCongr = Equiv.refl (WithBot α)

@[simp]

theorem Equiv.withBotCongr_symm {α : Type u_1} {β : Type u_2} (e : α ≃ β) : e.symm.withBotCongr = e.withBotCongr.symm

@[simp]

theorem Equiv.withBotCongr_trans {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e₁ : α ≃ β) (e₂ : β ≃ γ) : (e₁.trans e₂).withBotCongr = e₁.withBotCongr.trans e₂.withBotCongr

@[instance 10]

instance WithBot.le {α : Type u_1} [LE α] : LE (WithBot α)

Equations

• WithBot.le = { le := fun (o₁ o₂ : WithBot α) => ∀ (a : α), o₁ = ↑a → ∃ (b : α), o₂ = ↑b ∧ a ≤ b }

theorem WithBot.le_def {α : Type u_1} [LE α] {x y : WithBot α} : x ≤ y ↔ ∀ (a : α), x = ↑a → ∃ (b : α), y = ↑b ∧ a ≤ b

@[simp]

theorem WithBot.coe_le_coe {α : Type u_1} {a b : α} [LE α] : ↑a ≤ ↑b ↔ a ≤ b

theorem WithBot.not_coe_le_bot {α : Type u_1} [LE α] (a : α) : ¬↑a ≤ ⊥

instance WithBot.orderBot {α : Type u_1} [LE α] : OrderBot (WithBot α)

Equations

• WithBot.orderBot = { toBot := WithBot.bot, bot_le := ⋯ }

instance WithBot.orderTop {α : Type u_1} [LE α] [OrderTop α] : OrderTop (WithBot α)

Equations

• WithBot.orderTop = { toTop := WithBot.instTop, le_top := ⋯ }

instance WithBot.instBoundedOrder {α : Type u_1} [LE α] [OrderTop α] : BoundedOrder (WithBot α)

Equations

• WithBot.instBoundedOrder = { toOrderTop := WithBot.orderTop, toOrderBot := WithBot.orderBot }

@[simp]

theorem WithBot.le_bot_iff {α : Type u_1} [LE α] {a : WithBot α} : a ≤ ⊥ ↔ a = ⊥

There is a general version le_bot_iff, but this lemma does not require a PartialOrder.

theorem WithBot.coe_le {α : Type u_1} {a b : α} [LE α] {o : Option α} : b ∈ o → (↑a ≤ o ↔ a ≤ b)

theorem WithBot.coe_le_iff {α : Type u_1} {a : α} [LE α] {x : WithBot α} : ↑a ≤ x ↔ ∃ (b : α), x = ↑b ∧ a ≤ b

theorem WithBot.le_coe_iff {α : Type u_1} {b : α} [LE α] {x : WithBot α} : x ≤ ↑b ↔ ∀ (a : α), x = ↑a → a ≤ b

theorem IsMax.withBot {α : Type u_1} {a : α} [LE α] (h : IsMax a) : IsMax ↑a

theorem WithBot.le_unbot_iff {α : Type u_1} {a : α} [LE α] {y : WithBot α} (hy : y ≠ ⊥) : a ≤ y.unbot hy ↔ ↑a ≤ y

theorem WithBot.unbot_le_iff {α : Type u_1} {b : α} [LE α] {x : WithBot α} (hx : x ≠ ⊥) : x.unbot hx ≤ b ↔ x ≤ ↑b

theorem WithBot.unbotD_le_iff {α : Type u_1} {a b : α} [LE α] {x : WithBot α} (hx : x = ⊥ → a ≤ b) : unbotD a x ≤ b ↔ x ≤ ↑b

@[instance 10]

instance WithBot.lt {α : Type u_1} [LT α] : LT (WithBot α)

Equations

• WithBot.lt = { lt := fun (o₁ o₂ : WithBot α) => ∃ (b : α), o₂ = ↑b ∧ ∀ (a : α), o₁ = ↑a → a < b }

theorem WithBot.lt_def {α : Type u_1} [LT α] {x y : WithBot α} : x < y ↔ ∃ (b : α), y = ↑b ∧ ∀ (a : α), x = ↑a → a < b

@[simp]

theorem WithBot.coe_lt_coe {α : Type u_1} {a b : α} [LT α] : ↑a < ↑b ↔ a < b

@[simp]

theorem WithBot.bot_lt_coe {α : Type u_1} [LT α] (a : α) : ⊥ < ↑a

@[simp]

theorem WithBot.not_lt_bot {α : Type u_1} [LT α] (a : WithBot α) : ¬a < ⊥

theorem WithBot.lt_iff_exists_coe {α : Type u_1} [LT α] {x y : WithBot α} : x < y ↔ ∃ (b : α), y = ↑b ∧ x < ↑b

theorem WithBot.lt_coe_iff {α : Type u_1} {b : α} [LT α] {x : WithBot α} : x < ↑b ↔ ∀ (a : α), x = ↑a → a < b

theorem WithBot.bot_lt_iff_ne_bot {α : Type u_1} [LT α] {x : WithBot α} : ⊥ < x ↔ x ≠ ⊥

A version of bot_lt_iff_ne_bot for WithBot that only requires LT α, not PartialOrder α.

theorem WithBot.lt_unbot_iff {α : Type u_1} {a : α} [LT α] {y : WithBot α} (hy : y ≠ ⊥) : a < y.unbot hy ↔ ↑a < y

theorem WithBot.unbot_lt_iff {α : Type u_1} {b : α} [LT α] {x : WithBot α} (hx : x ≠ ⊥) : x.unbot hx < b ↔ x < ↑b

theorem WithBot.unbotD_lt_iff {α : Type u_1} {a b : α} [LT α] {x : WithBot α} (hx : x = ⊥ → a < b) : unbotD a x < b ↔ x < ↑b

instance WithBot.preorder {α : Type u_1} [Preorder α] : Preorder (WithBot α)

Equations

• WithBot.preorder = { toLE := WithBot.le, toLT := WithBot.lt, le_refl := ⋯, le_trans := ⋯, lt_iff_le_not_ge := ⋯ }

instance WithBot.partialOrder {α : Type u_1} [PartialOrder α] : PartialOrder (WithBot α)

Equations

• WithBot.partialOrder = { toPreorder := WithBot.preorder, le_antisymm := ⋯ }

theorem WithBot.coe_strictMono {α : Type u_1} [Preorder α] : StrictMono fun (a : α) => ↑a

theorem WithBot.coe_mono {α : Type u_1} [Preorder α] : Monotone fun (a : α) => ↑a

theorem WithBot.monotone_iff {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {f : WithBot α → β} : Monotone f ↔ (Monotone fun (a : α) => f ↑a) ∧ ∀ (x : α), f ⊥ ≤ f ↑x

@[simp]

theorem WithBot.monotone_map_iff {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {f : α → β} : Monotone (map f) ↔ Monotone f

theorem Monotone.withBot_map {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {f : α → β} : Monotone f → Monotone (WithBot.map f)

Alias of the reverse direction of WithBot.monotone_map_iff.

theorem WithBot.strictMono_iff {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {f : WithBot α → β} : StrictMono f ↔ (StrictMono fun (a : α) => f ↑a) ∧ ∀ (x : α), f ⊥ < f ↑x

theorem WithBot.strictAnti_iff {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {f : WithBot α → β} : StrictAnti f ↔ (StrictAnti fun (a : α) => f ↑a) ∧ ∀ (x : α), f ↑x < f ⊥

@[simp]

theorem WithBot.strictMono_map_iff {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {f : α → β} : StrictMono (map f) ↔ StrictMono f

theorem StrictMono.withBot_map {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {f : α → β} : StrictMono f → StrictMono (WithBot.map f)

Alias of the reverse direction of WithBot.strictMono_map_iff.

theorem WithBot.map_le_iff {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {x y : WithBot α} (f : α → β) (mono_iff : ∀ {a b : α}, f a ≤ f b ↔ a ≤ b) : map f x ≤ map f y ↔ x ≤ y

theorem WithBot.le_coe_unbotD {α : Type u_1} [Preorder α] (x : WithBot α) (b : α) : x ≤ ↑(unbotD b x)

@[simp]

theorem WithBot.lt_coe_bot {α : Type u_1} [Preorder α] {x : WithBot α} [OrderBot α] : x < ↑⊥ ↔ x = ⊥

theorem WithBot.eq_bot_iff_forall_lt {α : Type u_1} [Preorder α] {x : WithBot α} : x = ⊥ ↔ ∀ (b : α), x < ↑b

theorem WithBot.eq_bot_iff_forall_le {α : Type u_1} [Preorder α] {x : WithBot α} [NoBotOrder α] : x = ⊥ ↔ ∀ (b : α), x ≤ ↑b

@[deprecated WithBot.eq_bot_iff_forall_lt (since := "2025-03-19")]

theorem WithBot.forall_lt_iff_eq_bot {α : Type u_1} [Preorder α] {x : WithBot α} : x = ⊥ ↔ ∀ (b : α), x < ↑b

Alias of WithBot.eq_bot_iff_forall_lt.

@[deprecated WithBot.eq_bot_iff_forall_le (since := "2025-03-19")]

theorem WithBot.forall_le_iff_eq_bot {α : Type u_1} [Preorder α] {x : WithBot α} [NoBotOrder α] : x = ⊥ ↔ ∀ (b : α), x ≤ ↑b

Alias of WithBot.eq_bot_iff_forall_le.

theorem WithBot.forall_le_coe_iff_le {α : Type u_1} [Preorder α] {x y : WithBot α} [NoBotOrder α] : (∀ (a : α), y ≤ ↑a → x ≤ ↑a) ↔ x ≤ y

theorem WithBot.eq_of_forall_le_coe_iff {α : Type u_1} [PartialOrder α] [NoBotOrder α] {x y : WithBot α} (h : ∀ (a : α), x ≤ ↑a ↔ y ≤ ↑a) : x = y

instance WithBot.semilatticeSup {α : Type u_1} [SemilatticeSup α] : SemilatticeSup (WithBot α)

Equations

• One or more equations did not get rendered due to their size.

theorem WithBot.coe_sup {α : Type u_1} [SemilatticeSup α] (a b : α) : ↑(a ⊔ b) = ↑a ⊔ ↑b

instance WithBot.semilatticeInf {α : Type u_1} [SemilatticeInf α] : SemilatticeInf (WithBot α)

Equations

• WithBot.semilatticeInf = { toPartialOrder := WithBot.partialOrder, inf := WithBot.map₂ fun (x1 x2 : α) => x1 ⊓ x2, inf_le_left := ⋯, inf_le_right := ⋯, le_inf := ⋯ }

theorem WithBot.coe_inf {α : Type u_1} [SemilatticeInf α] (a b : α) : ↑(a ⊓ b) = ↑a ⊓ ↑b

instance WithBot.lattice {α : Type u_1} [Lattice α] : Lattice (WithBot α)

Equations

• WithBot.lattice = { toSemilatticeSup := WithBot.semilatticeSup, inf := SemilatticeInf.inf, inf_le_left := ⋯, inf_le_right := ⋯, le_inf := ⋯ }

instance WithBot.distribLattice {α : Type u_1} [DistribLattice α] : DistribLattice (WithBot α)

Equations

• WithBot.distribLattice = { toLattice := WithBot.lattice, le_sup_inf := ⋯ }

instance WithBot.decidableEq {α : Type u_1} [DecidableEq α] : DecidableEq (WithBot α)

Equations

• WithBot.decidableEq = inferInstanceAs (DecidableEq (Option α))

instance WithBot.decidableLE {α : Type u_1} [LE α] [DecidableLE α] : DecidableLE (WithBot α)

Equations

• WithBot.decidableLE none x✝ = isTrue ⋯
• WithBot.decidableLE (some a) none = isFalse ⋯
• WithBot.decidableLE (some a) (some b) = decidable_of_iff' (a ≤ b) ⋯

instance WithBot.decidableLT {α : Type u_1} [LT α] [DecidableLT α] : DecidableLT (WithBot α)

Equations

• x✝.decidableLT none = isFalse ⋯
• WithBot.decidableLT none (some a) = isTrue ⋯
• WithBot.decidableLT (some a) (some b) = decidable_of_iff' (a < b) ⋯

instance WithBot.isTotal_le {α : Type u_1} [LE α] [IsTotal α fun (x1 x2 : α) => x1 ≤ x2] : IsTotal (WithBot α) fun (x1 x2 : WithBot α) => x1 ≤ x2

instance WithBot.linearOrder {α : Type u_1} [LinearOrder α] : LinearOrder (WithBot α)

Equations

• WithBot.linearOrder = Lattice.toLinearOrder (WithBot α)

@[simp]

theorem WithBot.coe_min {α : Type u_1} [LinearOrder α] (a b : α) : ↑(min a b) = min ↑a ↑b

@[simp]

theorem WithBot.coe_max {α : Type u_1} [LinearOrder α] (a b : α) : ↑(max a b) = max ↑a ↑b

theorem WithBot.le_of_forall_lt_iff_le {α : Type u_1} [LinearOrder α] {x y : WithBot α} [DenselyOrdered α] [NoMinOrder α] : (∀ (z : α), x < ↑z → y ≤ ↑z) ↔ y ≤ x

theorem WithBot.ge_of_forall_gt_iff_ge {α : Type u_1} [LinearOrder α] {x y : WithBot α} [DenselyOrdered α] [NoMinOrder α] : (∀ (z : α), ↑z < x → ↑z ≤ y) ↔ x ≤ y

instance WithBot.instWellFoundedLT {α : Type u_1} [LT α] [WellFoundedLT α] : WellFoundedLT (WithBot α)

instance WithBot.instWellFoundedGT {α : Type u_1} [LT α] [WellFoundedGT α] : WellFoundedGT (WithBot α)

theorem WithBot.denselyOrdered_iff {α : Type u_1} [LT α] [NoMinOrder α] : DenselyOrdered (WithBot α) ↔ DenselyOrdered α

instance WithBot.denselyOrdered {α : Type u_1} [LT α] [DenselyOrdered α] [NoMinOrder α] : DenselyOrdered (WithBot α)

theorem WithBot.lt_iff_exists_coe_btwn {α : Type u_1} [Preorder α] [DenselyOrdered α] [NoMinOrder α] {a b : WithBot α} : a < b ↔ ∃ (x : α), a < ↑x ∧ ↑x < b

instance WithBot.noTopOrder {α : Type u_1} [LE α] [NoTopOrder α] [Nonempty α] : NoTopOrder (WithBot α)

instance WithBot.noMaxOrder {α : Type u_1} [LT α] [NoMaxOrder α] [Nonempty α] : NoMaxOrder (WithBot α)

instance WithTop.nontrivial {α : Type u_1} [Nonempty α] : Nontrivial (WithTop α)

theorem WithTop.coe_injective {α : Type u_1} : Function.Injective some

theorem WithTop.coe_inj {α : Type u_1} {a b : α} : ↑a = ↑b ↔ a = b

theorem WithTop.forall {α : Type u_1} {p : WithTop α → Prop} : (∀ (x : WithTop α), p x) ↔ p ⊤ ∧ ∀ (x : α), p ↑x

theorem WithTop.exists {α : Type u_1} {p : WithTop α → Prop} : (∃ (x : WithTop α), p x) ↔ p ⊤ ∨ ∃ (x : α), p ↑x

theorem WithTop.none_eq_top {α : Type u_1} : none = ⊤

theorem WithTop.some_eq_coe {α : Type u_1} (a : α) : Option.some a = ↑a

@[simp]

theorem WithTop.top_ne_coe {α : Type u_1} {a : α} : ⊤ ≠ ↑a

@[simp]

theorem WithTop.coe_ne_top {α : Type u_1} {a : α} : ↑a ≠ ⊤

def WithTop.toDual {α : Type u_1} : WithTop α ≃ WithBot αᵒᵈ

WithTop.toDual is the equivalence sending ⊤ to ⊥ and any a : α to toDual a : αᵒᵈ. See WithTop.toDualBotEquiv for the related order-iso.

Equations

• WithTop.toDual = Equiv.refl (WithTop α)

def WithTop.ofDual {α : Type u_1} : WithTop αᵒᵈ ≃ WithBot α

WithTop.ofDual is the equivalence sending ⊤ to ⊥ and any a : αᵒᵈ to ofDual a : α. See WithTop.toDualBotEquiv for the related order-iso.

Equations

• WithTop.ofDual = Equiv.refl (WithTop αᵒᵈ)

def WithBot.toDual {α : Type u_1} : WithBot α ≃ WithTop αᵒᵈ

WithBot.toDual is the equivalence sending ⊥ to ⊤ and any a : α to toDual a : αᵒᵈ. See WithBot.toDual_top_equiv for the related order-iso.

Equations

• WithBot.toDual = Equiv.refl (WithBot α)

def WithBot.ofDual {α : Type u_1} : WithBot αᵒᵈ ≃ WithTop α

WithBot.ofDual is the equivalence sending ⊥ to ⊤ and any a : αᵒᵈ to ofDual a : α. See WithBot.ofDual_top_equiv for the related order-iso.

Equations

• WithBot.ofDual = Equiv.refl (WithBot αᵒᵈ)

@[simp]

theorem WithTop.toDual_symm_apply {α : Type u_1} (a : WithBot αᵒᵈ) : WithTop.toDual.symm a = WithBot.ofDual a

@[simp]

theorem WithTop.ofDual_symm_apply {α : Type u_1} (a : WithBot α) : WithTop.ofDual.symm a = WithBot.toDual a

@[simp]

theorem WithTop.toDual_apply_top {α : Type u_1} : WithTop.toDual ⊤ = ⊥

@[simp]

theorem WithTop.ofDual_apply_top {α : Type u_1} : WithTop.ofDual ⊤ = ⊥

@[simp]

theorem WithTop.toDual_apply_coe {α : Type u_1} (a : α) : WithTop.toDual ↑a = ↑(OrderDual.toDual a)

@[simp]

theorem WithTop.ofDual_apply_coe {α : Type u_1} (a : αᵒᵈ) : WithTop.ofDual ↑a = ↑(OrderDual.ofDual a)

def WithTop.untopD {α : Type u_1} (d : α) (x : WithTop α) : α

Specialization of Option.getD to values in WithTop α that respects API boundaries.

Equations

• WithTop.untopD d x = WithTop.recTopCoe d id x

@[simp]

theorem WithTop.untopD_top {α : Type u_5} (d : α) : untopD d ⊤ = d

@[simp]

theorem WithTop.untopD_coe {α : Type u_5} (d x : α) : untopD d ↑x = x

@[simp]

theorem WithTop.coe_eq_coe {α : Type u_1} {a b : α} : ↑a = ↑b ↔ a = b

theorem WithTop.untopD_eq_iff {α : Type u_1} {d y : α} {x : WithTop α} : untopD d x = y ↔ x = ↑y ∨ x = ⊤ ∧ y = d

@[simp]

theorem WithTop.untopD_eq_self_iff {α : Type u_1} {d : α} {x : WithTop α} : untopD d x = d ↔ x = ↑d ∨ x = ⊤

theorem WithTop.untopD_eq_untopD_iff {α : Type u_1} {d : α} {x y : WithTop α} : untopD d x = untopD d y ↔ x = y ∨ x = ↑d ∧ y = ⊤ ∨ x = ⊤ ∧ y = ↑d

def WithTop.map {α : Type u_1} {β : Type u_2} (f : α → β) : WithTop α → WithTop β

Lift a map f : α → β to WithTop α → WithTop β. Implemented using Option.map.

Equations

• WithTop.map f = Option.map f

@[simp]

theorem WithTop.map_top {α : Type u_1} {β : Type u_2} (f : α → β) : map f ⊤ = ⊤

@[simp]

theorem WithTop.map_coe {α : Type u_1} {β : Type u_2} (f : α → β) (a : α) : map f ↑a = ↑(f a)

@[simp]

theorem WithTop.map_eq_top_iff {α : Type u_1} {β : Type u_2} {f : α → β} {a : WithTop α} : map f a = ⊤ ↔ a = ⊤

theorem WithTop.map_eq_some_iff {α : Type u_1} {β : Type u_2} {f : α → β} {y : β} {v : WithTop α} : map f v = ↑y ↔ ∃ (x : α), v = ↑x ∧ f x = y

theorem WithTop.some_eq_map_iff {α : Type u_1} {β : Type u_2} {f : α → β} {y : β} {v : WithTop α} : ↑y = map f v ↔ ∃ (x : α), v = ↑x ∧ f x = y

theorem WithTop.map_id {α : Type u_1} : map id = id

@[simp]

theorem WithTop.map_map {α : Type u_1} {β : Type u_2} {γ : Type u_3} (h : β → γ) (g : α → β) (a : WithTop α) : map h (map g a) = map (h ∘ g) a

theorem WithTop.comp_map {α : Type u_1} {β : Type u_2} {γ : Type u_3} (h : β → γ) (g : α → β) (x : WithTop α) : map (h ∘ g) x = map h (map g x)

@[simp]

theorem WithTop.map_comp_map {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β) (g : β → γ) : map g ∘ map f = map (g ∘ f)

theorem WithTop.map_comm {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} {f₁ : α → β} {f₂ : α → γ} {g₁ : β → δ} {g₂ : γ → δ} (h : g₁ ∘ f₁ = g₂ ∘ f₂) (a : α) : map g₁ (map f₁ ↑a) = map g₂ (map f₂ ↑a)

theorem WithTop.map_injective {α : Type u_1} {β : Type u_2} {f : α → β} (Hf : Function.Injective f) : Function.Injective (map f)

def WithTop.map₂ {α : Type u_1} {β : Type u_2} {γ : Type u_3} : (α → β → γ) → WithTop α → WithTop β → WithTop γ

The image of a binary function f : α → β → γ as a function WithTop α → WithTop β → WithTop γ.

Mathematically this should be thought of as the image of the corresponding function α × β → γ.

Equations

• WithTop.map₂ = Option.map₂

theorem WithTop.map₂_coe_coe {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β → γ) (a : α) (b : β) : map₂ f ↑a ↑b = ↑(f a b)

@[simp]

theorem WithTop.map₂_top_left {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β → γ) (b : WithTop β) : map₂ f ⊤ b = ⊤

@[simp]

theorem WithTop.map₂_top_right {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β → γ) (a : WithTop α) : map₂ f a ⊤ = ⊤

@[simp]

theorem WithTop.map₂_coe_left {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β → γ) (a : α) (b : WithTop β) : map₂ f (↑a) b = map (fun (b : β) => f a b) b

@[simp]

theorem WithTop.map₂_coe_right {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β → γ) (a : WithTop α) (b : β) : map₂ f a ↑b = map (fun (x : α) => f x b) a

@[simp]

theorem WithTop.map₂_eq_top_iff {α : Type u_1} {β : Type u_2} {γ : Type u_3} {f : α → β → γ} {a : WithTop α} {b : WithTop β} : map₂ f a b = ⊤ ↔ a = ⊤ ∨ b = ⊤

theorem WithTop.map_toDual {α : Type u_1} {β : Type u_2} (f : αᵒᵈ → βᵒᵈ) (a : WithBot α) : map f (WithBot.toDual a) = WithBot.map (⇑OrderDual.toDual ∘ f) a

theorem WithTop.map_ofDual {α : Type u_1} {β : Type u_2} (f : α → β) (a : WithBot αᵒᵈ) : map f (WithBot.ofDual a) = WithBot.map (⇑OrderDual.ofDual ∘ f) a

theorem WithTop.toDual_map {α : Type u_1} {β : Type u_2} (f : α → β) (a : WithTop α) : WithTop.toDual (map f a) = WithBot.map (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) (WithTop.toDual a)

theorem WithTop.ofDual_map {α : Type u_1} {β : Type u_2} (f : αᵒᵈ → βᵒᵈ) (a : WithTop αᵒᵈ) : WithTop.ofDual (map f a) = WithBot.map (⇑OrderDual.ofDual ∘ f ∘ ⇑OrderDual.toDual) (WithTop.ofDual a)

theorem WithTop.ne_top_iff_exists {α : Type u_1} {x : WithTop α} : x ≠ ⊤ ↔ ∃ (a : α), ↑a = x

theorem WithTop.eq_top_iff_forall_ne {α : Type u_1} {x : WithTop α} : x = ⊤ ↔ ∀ (a : α), ↑a ≠ x

@[deprecated WithTop.eq_top_iff_forall_ne (since := "2025-03-19")]

theorem WithTop.forall_ne_iff_eq_top {α : Type u_1} {x : WithTop α} : x = ⊤ ↔ ∀ (a : α), ↑a ≠ x

Alias of WithTop.eq_top_iff_forall_ne.

theorem WithTop.forall_ne_top {α : Type u_1} {p : WithTop α → Prop} : (∀ (x : WithTop α), x ≠ ⊤ → p x) ↔ ∀ (x : α), p ↑x

theorem WithTop.exists_ne_top {α : Type u_1} {p : WithTop α → Prop} : (∃ (x : WithTop α), x ≠ ⊤ ∧ p x) ↔ ∃ (x : α), p ↑x

def WithTop.untop {α : Type u_1} (x : WithTop α) : x ≠ ⊤ → α

Deconstruct a x : WithTop α to the underlying value in α, given a proof that x ≠ ⊤.

Equations

• WithTop.untop (some x_2) x_3 = x_2

@[simp]

theorem WithTop.coe_untop {α : Type u_1} (x : WithTop α) (hx : x ≠ ⊤) : ↑(x.untop hx) = x

@[simp]

theorem WithTop.untop_coe {α : Type u_1} (x : α) (h : ↑x ≠ ⊤ := ⋯) : (↑x).untop h = x

instance WithTop.canLift {α : Type u_1} : CanLift (WithTop α) α some fun (r : WithTop α) => r ≠ ⊤

instance WithTop.instBot {α : Type u_1} [Bot α] : Bot (WithTop α)

Equations

• WithTop.instBot = { bot := ↑⊥ }

@[simp]

theorem WithTop.coe_bot {α : Type u_1} [Bot α] : ↑⊥ = ⊥

@[simp]

theorem WithTop.coe_eq_bot {α : Type u_1} [Bot α] {a : α} : ↑a = ⊥ ↔ a = ⊥

@[simp]

theorem WithTop.bot_eq_coe {α : Type u_1} [Bot α] {a : α} : ⊥ = ↑a ↔ ⊥ = a

theorem WithTop.untop_eq_iff {α : Type u_1} {a : WithTop α} {b : α} (h : a ≠ ⊤) : a.untop h = b ↔ a = ↑b

theorem WithTop.eq_untop_iff {α : Type u_1} {a : α} {b : WithTop α} (h : b ≠ ⊤) : a = b.untop h ↔ ↑a = b

def Equiv.withTopSubtypeNe {α : Type u_1} : { y : WithTop α // y ≠ ⊤ } ≃ α

The equivalence between the non-top elements of WithTop α and α.

Equations

• Equiv.withTopSubtypeNe = { toFun := fun (x : { y : WithTop α // y ≠ ⊤ }) => match x with | ⟨x, h⟩ => x.untop h, invFun := fun (x : α) => ⟨↑x, ⋯⟩, left_inv := ⋯, right_inv := ⋯ }

@[simp]

theorem Equiv.withTopSubtypeNe_apply {α : Type u_1} (x✝ : { y : WithTop α // y ≠ ⊤ }) : withTopSubtypeNe x✝ = match x✝ with | ⟨x, h⟩ => x.untop h

@[simp]

theorem Equiv.withTopSubtypeNe_symm_apply_coe {α : Type u_1} (x : α) : ↑(withTopSubtypeNe.symm x) = ↑x

def Equiv.withTopCongr {α : Type u_1} {β : Type u_2} (e : α ≃ β) : WithTop α ≃ WithTop β

A universe-polymorphic version of EquivFunctor.mapEquiv WithTop e.

Equations

• e.withTopCongr = { toFun := WithTop.map ⇑e, invFun := WithTop.map ⇑e.symm, left_inv := ⋯, right_inv := ⋯ }

@[simp]

theorem Equiv.withTopCongr_apply {α : Type u_1} {β : Type u_2} (e : α ≃ β) (a✝ : WithTop α) : e.withTopCongr a✝ = WithTop.map (⇑e) a✝

@[simp]

theorem Equiv.withTopCongr_refl {α : Type u_1} : (Equiv.refl α).withTopCongr = Equiv.refl (WithTop α)

@[simp]

theorem Equiv.withTopCongr_symm {α : Type u_1} {β : Type u_2} (e : α ≃ β) : e.symm.withTopCongr = e.withTopCongr.symm

@[simp]

theorem Equiv.withTopCongr_trans {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e₁ : α ≃ β) (e₂ : β ≃ γ) : (e₁.trans e₂).withTopCongr = e₁.withTopCongr.trans e₂.withTopCongr

@[instance 10]

instance WithTop.le {α : Type u_1} [LE α] : LE (WithTop α)

Equations

• WithTop.le = { le := fun (o₁ o₂ : WithTop α) => ∀ (a : α), o₂ = ↑a → ∃ (b : α), o₁ = ↑b ∧ b ≤ a }

theorem WithTop.le_def {α : Type u_1} [LE α] {x y : WithTop α} : x ≤ y ↔ ∀ (b : α), y = ↑b → ∃ (a : α), x = ↑a ∧ a ≤ b

@[simp]

theorem WithTop.coe_le_coe {α : Type u_1} {a b : α} [LE α] : ↑a ≤ ↑b ↔ a ≤ b

theorem WithTop.not_top_le_coe {α : Type u_1} [LE α] (a : α) : ¬⊤ ≤ ↑a

instance WithTop.orderTop {α : Type u_1} [LE α] : OrderTop (WithTop α)

Equations

• WithTop.orderTop = { toTop := WithTop.top, le_top := ⋯ }

instance WithTop.orderBot {α : Type u_1} [LE α] [OrderBot α] : OrderBot (WithTop α)

Equations

• WithTop.orderBot = { toBot := WithTop.instBot, bot_le := ⋯ }

instance WithTop.boundedOrder {α : Type u_1} [LE α] [OrderBot α] : BoundedOrder (WithTop α)

Equations

• WithTop.boundedOrder = { toOrderTop := WithTop.orderTop, toOrderBot := WithTop.orderBot }

@[simp]

theorem WithTop.top_le_iff {α : Type u_1} [LE α] {a : WithTop α} : ⊤ ≤ a ↔ a = ⊤

There is a general version top_le_iff, but this lemma does not require a PartialOrder.

theorem WithTop.le_coe {α : Type u_1} {a b : α} [LE α] {o : Option α} : a ∈ o → (o ≤ ↑b ↔ a ≤ b)

theorem WithTop.le_coe_iff {α : Type u_1} {b : α} [LE α] {x : WithTop α} : x ≤ ↑b ↔ ∃ (a : α), x = ↑a ∧ a ≤ b

theorem WithTop.coe_le_iff {α : Type u_1} {a : α} [LE α] {x : WithTop α} : ↑a ≤ x ↔ ∀ (b : α), x = ↑b → a ≤ b

theorem IsMin.withTop {α : Type u_1} {a : α} [LE α] (h : IsMin a) : IsMin ↑a

theorem WithTop.untop_le_iff {α : Type u_1} {b : α} [LE α] {x : WithTop α} (hx : x ≠ ⊤) : x.untop hx ≤ b ↔ x ≤ ↑b

theorem WithTop.le_untop_iff {α : Type u_1} {a : α} [LE α] {y : WithTop α} (hy : y ≠ ⊤) : a ≤ y.untop hy ↔ ↑a ≤ y

theorem WithTop.le_untopD_iff {α : Type u_1} {a b : α} [LE α] {y : WithTop α} (hy : y = ⊤ → a ≤ b) : a ≤ untopD b y ↔ ↑a ≤ y

@[instance 10]

instance WithTop.lt {α : Type u_1} [LT α] : LT (WithTop α)

Equations

• WithTop.lt = { lt := fun (o₁ o₂ : Option α) => ∃ (b : α), b ∈ o₁ ∧ ∀ (a : α), a ∈ o₂ → b < a }

theorem WithTop.lt_def {α : Type u_1} [LT α] {x y : WithTop α} : x < y ↔ ∃ (a : α), x = ↑a ∧ ∀ (b : α), y = ↑b → a < b

@[simp]

theorem WithTop.coe_lt_coe {α : Type u_1} {a b : α} [LT α] : ↑a < ↑b ↔ a < b

@[simp]

theorem WithTop.coe_lt_top {α : Type u_1} [LT α] (a : α) : ↑a < ⊤

@[simp]

theorem WithTop.not_top_lt {α : Type u_1} [LT α] (a : WithTop α) : ¬⊤ < a

theorem WithTop.lt_iff_exists_coe {α : Type u_1} [LT α] {x y : WithTop α} : x < y ↔ ∃ (a : α), x = ↑a ∧ ↑a < y

theorem WithTop.coe_lt_iff {α : Type u_1} {a : α} [LT α] {y : WithTop α} : ↑a < y ↔ ∀ (b : α), y = ↑b → a < b

theorem WithTop.lt_top_iff_ne_top {α : Type u_1} [LT α] {x : WithTop α} : x < ⊤ ↔ x ≠ ⊤

A version of lt_top_iff_ne_top for WithTop that only requires LT α, not PartialOrder α.

@[simp]

theorem WithTop.lt_untop_iff {α : Type u_1} {a : α} [LT α] {y : WithTop α} (hy : y ≠ ⊤) : a < y.untop hy ↔ ↑a < y

@[simp]

theorem WithTop.untop_lt_iff {α : Type u_1} {b : α} [LT α] {x : WithTop α} (hx : x ≠ ⊤) : x.untop hx < b ↔ x < ↑b

theorem WithTop.lt_untopD_iff {α : Type u_1} {a b : α} [LT α] {y : WithTop α} (hy : y = ⊤ → a < b) : a < untopD b y ↔ ↑a < y

instance WithTop.preorder {α : Type u_1} [Preorder α] : Preorder (WithTop α)

Equations

• WithTop.preorder = { toLE := WithTop.le, toLT := WithTop.lt, le_refl := ⋯, le_trans := ⋯, lt_iff_le_not_ge := ⋯ }

instance WithTop.partialOrder {α : Type u_1} [PartialOrder α] : PartialOrder (WithTop α)

Equations

• WithTop.partialOrder = { toPreorder := WithTop.preorder, le_antisymm := ⋯ }

theorem WithTop.coe_strictMono {α : Type u_1} [Preorder α] : StrictMono fun (a : α) => ↑a

theorem WithTop.coe_mono {α : Type u_1} [Preorder α] : Monotone fun (a : α) => ↑a

theorem WithTop.monotone_iff {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {f : WithTop α → β} : Monotone f ↔ (Monotone fun (a : α) => f ↑a) ∧ ∀ (x : α), f ↑x ≤ f ⊤

@[simp]

theorem WithTop.monotone_map_iff {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {f : α → β} : Monotone (map f) ↔ Monotone f

theorem Monotone.withTop_map {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {f : α → β} : Monotone f → Monotone (WithTop.map f)

Alias of the reverse direction of WithTop.monotone_map_iff.

theorem WithTop.strictMono_iff {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {f : WithTop α → β} : StrictMono f ↔ (StrictMono fun (a : α) => f ↑a) ∧ ∀ (x : α), f ↑x < f ⊤

theorem WithTop.strictAnti_iff {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {f : WithTop α → β} : StrictAnti f ↔ (StrictAnti fun (a : α) => f ↑a) ∧ ∀ (x : α), f ⊤ < f ↑x

@[simp]

theorem WithTop.strictMono_map_iff {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {f : α → β} : StrictMono (map f) ↔ StrictMono f

theorem StrictMono.withTop_map {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {f : α → β} : StrictMono f → StrictMono (WithTop.map f)

Alias of the reverse direction of WithTop.strictMono_map_iff.

theorem WithTop.map_le_iff {α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] {x y : WithTop α} (f : α → β) (mono_iff : ∀ {a b : α}, f a ≤ f b ↔ a ≤ b) : map f x ≤ map f y ↔ x ≤ y

theorem WithTop.coe_untopD_le {α : Type u_1} [Preorder α] (y : WithTop α) (a : α) : ↑(untopD a y) ≤ y

@[simp]

theorem WithTop.coe_top_lt {α : Type u_1} [Preorder α] {x : WithTop α} [OrderTop α] : ↑⊤ < x ↔ x = ⊤

theorem WithTop.eq_top_iff_forall_gt {α : Type u_1} [Preorder α] {y : WithTop α} : y = ⊤ ↔ ∀ (a : α), ↑a < y

theorem WithTop.eq_top_iff_forall_ge {α : Type u_1} [Preorder α] {y : WithTop α} [NoTopOrder α] : y = ⊤ ↔ ∀ (a : α), ↑a ≤ y

@[deprecated WithTop.eq_top_iff_forall_gt (since := "2025-03-19")]

theorem WithTop.forall_gt_iff_eq_top {α : Type u_1} [Preorder α] {y : WithTop α} : y = ⊤ ↔ ∀ (a : α), ↑a < y

Alias of WithTop.eq_top_iff_forall_gt.

@[deprecated WithTop.eq_top_iff_forall_ge (since := "2025-03-19")]

theorem WithTop.forall_ge_iff_eq_top {α : Type u_1} [Preorder α] {y : WithTop α} [NoTopOrder α] : y = ⊤ ↔ ∀ (a : α), ↑a ≤ y

Alias of WithTop.eq_top_iff_forall_ge.

theorem WithTop.forall_coe_le_iff_le {α : Type u_1} [Preorder α] {x y : WithTop α} [NoTopOrder α] : (∀ (a : α), ↑a ≤ x → ↑a ≤ y) ↔ x ≤ y

theorem WithTop.eq_of_forall_coe_le_iff {α : Type u_1} [PartialOrder α] [NoTopOrder α] {x y : WithTop α} (h : ∀ (a : α), ↑a ≤ x ↔ ↑a ≤ y) : x = y

instance WithTop.semilatticeInf {α : Type u_1} [SemilatticeInf α] : SemilatticeInf (WithTop α)

Equations

• One or more equations did not get rendered due to their size.

theorem WithTop.coe_inf {α : Type u_1} [SemilatticeInf α] (a b : α) : ↑(a ⊓ b) = ↑a ⊓ ↑b

instance WithTop.semilatticeSup {α : Type u_1} [SemilatticeSup α] : SemilatticeSup (WithTop α)

Equations

• WithTop.semilatticeSup = { toPartialOrder := WithTop.partialOrder, sup := WithTop.map₂ fun (x1 x2 : α) => x1 ⊔ x2, le_sup_left := ⋯, le_sup_right := ⋯, sup_le := ⋯ }

theorem WithTop.coe_sup {α : Type u_1} [SemilatticeSup α] (a b : α) : ↑(a ⊔ b) = ↑a ⊔ ↑b

instance WithTop.lattice {α : Type u_1} [Lattice α] : Lattice (WithTop α)

Equations

• WithTop.lattice = { toSemilatticeSup := WithTop.semilatticeSup, inf := SemilatticeInf.inf, inf_le_left := ⋯, inf_le_right := ⋯, le_inf := ⋯ }

instance WithTop.distribLattice {α : Type u_1} [DistribLattice α] : DistribLattice (WithTop α)

Equations

• WithTop.distribLattice = { toLattice := WithTop.lattice, le_sup_inf := ⋯ }

instance WithTop.decidableEq {α : Type u_1} [DecidableEq α] : DecidableEq (WithTop α)

Equations

• WithTop.decidableEq = inferInstanceAs (DecidableEq (Option α))

instance WithTop.decidableLE {α : Type u_1} [LE α] [DecidableLE α] : DecidableLE (WithTop α)

Equations

• x✝.decidableLE none = isTrue ⋯
• WithTop.decidableLE none (some a) = isFalse ⋯
• WithTop.decidableLE (some a) (some b) = decidable_of_iff' (a ≤ b) ⋯

instance WithTop.decidableLT {α : Type u_1} [LT α] [DecidableLT α] : DecidableLT (WithTop α)

Equations

• WithTop.decidableLT none x✝ = isFalse ⋯
• WithTop.decidableLT (some a) none = isTrue ⋯
• WithTop.decidableLT (some a) (some b) = decidable_of_iff' (a < b) ⋯

instance WithTop.isTotal_le {α : Type u_1} [LE α] [IsTotal α fun (x1 x2 : α) => x1 ≤ x2] : IsTotal (WithTop α) fun (x1 x2 : WithTop α) => x1 ≤ x2

instance WithTop.linearOrder {α : Type u_1} [LinearOrder α] : LinearOrder (WithTop α)

Equations

• WithTop.linearOrder = Lattice.toLinearOrder (WithTop α)

@[simp]

theorem WithTop.coe_min {α : Type u_1} [LinearOrder α] (a b : α) : ↑(min a b) = min ↑a ↑b

@[simp]

theorem WithTop.coe_max {α : Type u_1} [LinearOrder α] (a b : α) : ↑(max a b) = max ↑a ↑b

theorem WithTop.le_of_forall_lt_iff_le {α : Type u_1} [LinearOrder α] {x y : WithTop α} [DenselyOrdered α] [NoMaxOrder α] : (∀ (b : α), x < ↑b → y ≤ ↑b) ↔ y ≤ x

theorem WithTop.ge_of_forall_gt_iff_ge {α : Type u_1} [LinearOrder α] {x y : WithTop α} [DenselyOrdered α] [NoMaxOrder α] : (∀ (a : α), ↑a < x → ↑a ≤ y) ↔ x ≤ y

instance WithTop.instWellFoundedLT {α : Type u_1} [LT α] [WellFoundedLT α] : WellFoundedLT (WithTop α)

instance WithTop.instWellFoundedGT {α : Type u_1} [LT α] [WellFoundedGT α] : WellFoundedGT (WithTop α)

instance WithTop.trichotomous.lt {α : Type u_1} [Preorder α] [IsTrichotomous α fun (x1 x2 : α) => x1 < x2] : IsTrichotomous (WithTop α) fun (x1 x2 : WithTop α) => x1 < x2

instance WithTop.IsWellOrder.lt {α : Type u_1} [Preorder α] [IsWellOrder α fun (x1 x2 : α) => x1 < x2] : IsWellOrder (WithTop α) fun (x1 x2 : WithTop α) => x1 < x2

instance WithTop.trichotomous.gt {α : Type u_1} [Preorder α] [IsTrichotomous α fun (x1 x2 : α) => x1 > x2] : IsTrichotomous (WithTop α) fun (x1 x2 : WithTop α) => x1 > x2

instance WithTop.IsWellOrder.gt {α : Type u_1} [Preorder α] [IsWellOrder α fun (x1 x2 : α) => x1 > x2] : IsWellOrder (WithTop α) fun (x1 x2 : WithTop α) => x1 > x2

instance WithBot.trichotomous.lt {α : Type u_1} [Preorder α] [h : IsTrichotomous α fun (x1 x2 : α) => x1 < x2] : IsTrichotomous (WithBot α) fun (x1 x2 : WithBot α) => x1 < x2

instance WithBot.isWellOrder.lt {α : Type u_1} [Preorder α] [IsWellOrder α fun (x1 x2 : α) => x1 < x2] : IsWellOrder (WithBot α) fun (x1 x2 : WithBot α) => x1 < x2

instance WithBot.trichotomous.gt {α : Type u_1} [Preorder α] [h : IsTrichotomous α fun (x1 x2 : α) => x1 > x2] : IsTrichotomous (WithBot α) fun (x1 x2 : WithBot α) => x1 > x2

instance WithBot.isWellOrder.gt {α : Type u_1} [Preorder α] [h : IsWellOrder α fun (x1 x2 : α) => x1 > x2] : IsWellOrder (WithBot α) fun (x1 x2 : WithBot α) => x1 > x2

theorem WithTop.denselyOrdered_iff {α : Type u_1} [LT α] [NoMaxOrder α] : DenselyOrdered (WithTop α) ↔ DenselyOrdered α

instance WithTop.instDenselyOrderedOfNoMaxOrder {α : Type u_1} [LT α] [DenselyOrdered α] [NoMaxOrder α] : DenselyOrdered (WithTop α)

theorem WithTop.lt_iff_exists_coe_btwn {α : Type u_1} [Preorder α] [DenselyOrdered α] [NoMaxOrder α] {a b : WithTop α} : a < b ↔ ∃ (x : α), a < ↑x ∧ ↑x < b

instance WithTop.noBotOrder {α : Type u_1} [LE α] [NoBotOrder α] [Nonempty α] : NoBotOrder (WithTop α)

instance WithTop.noMinOrder {α : Type u_1} [LT α] [NoMinOrder α] [Nonempty α] : NoMinOrder (WithTop α)

theorem WithBot.eq_top_iff_forall_ge {α : Type u_1} [Preorder α] [Nonempty α] [NoTopOrder α] {x : WithBot (WithTop α)} : x = ⊤ ↔ ∀ (a : α), ↑↑a ≤ x

(WithBot α)ᵒᵈ ≃ WithTop αᵒᵈ, (WithTop α)ᵒᵈ ≃ WithBot αᵒᵈ

@[simp]

theorem WithBot.toDual_symm_apply {α : Type u_1} (a : WithTop αᵒᵈ) : WithBot.toDual.symm a = WithTop.ofDual a

@[simp]

theorem WithBot.ofDual_symm_apply {α : Type u_1} (a : WithTop α) : WithBot.ofDual.symm a = WithTop.toDual a

@[simp]

theorem WithBot.toDual_apply_bot {α : Type u_1} : WithBot.toDual ⊥ = ⊤

@[simp]

theorem WithBot.ofDual_apply_bot {α : Type u_1} : WithBot.ofDual ⊥ = ⊤

@[simp]

theorem WithBot.toDual_apply_coe {α : Type u_1} (a : α) : WithBot.toDual ↑a = ↑(OrderDual.toDual a)

@[simp]

theorem WithBot.ofDual_apply_coe {α : Type u_1} (a : αᵒᵈ) : WithBot.ofDual ↑a = ↑(OrderDual.ofDual a)

theorem WithBot.map_toDual {α : Type u_1} {β : Type u_2} (f : αᵒᵈ → βᵒᵈ) (a : WithTop α) : map f (WithTop.toDual a) = WithTop.map (⇑OrderDual.toDual ∘ f) a

theorem WithBot.map_ofDual {α : Type u_1} {β : Type u_2} (f : α → β) (a : WithTop αᵒᵈ) : map f (WithTop.ofDual a) = WithTop.map (⇑OrderDual.ofDual ∘ f) a

theorem WithBot.toDual_map {α : Type u_1} {β : Type u_2} (f : α → β) (a : WithBot α) : WithBot.toDual (map f a) = map (⇑OrderDual.toDual ∘ f ∘ ⇑OrderDual.ofDual) (WithBot.toDual a)

theorem WithBot.ofDual_map {α : Type u_1} {β : Type u_2} (f : αᵒᵈ → βᵒᵈ) (a : WithBot αᵒᵈ) : WithBot.ofDual (map f a) = map (⇑OrderDual.ofDual ∘ f ∘ ⇑OrderDual.toDual) (WithBot.ofDual a)

theorem WithBot.toDual_le_iff {α : Type u_1} [LE α] {x : WithBot α} {y : WithTop αᵒᵈ} : WithBot.toDual x ≤ y ↔ WithTop.ofDual y ≤ x

theorem WithBot.le_toDual_iff {α : Type u_1} [LE α] {x : WithTop αᵒᵈ} {y : WithBot α} : x ≤ WithBot.toDual y ↔ y ≤ WithTop.ofDual x

@[simp]

theorem WithBot.toDual_le_toDual_iff {α : Type u_1} [LE α] {x y : WithBot α} : WithBot.toDual x ≤ WithBot.toDual y ↔ y ≤ x

theorem WithBot.ofDual_le_iff {α : Type u_1} [LE α] {x : WithBot αᵒᵈ} {y : WithTop α} : WithBot.ofDual x ≤ y ↔ WithTop.toDual y ≤ x

theorem WithBot.le_ofDual_iff {α : Type u_1} [LE α] {x : WithTop α} {y : WithBot αᵒᵈ} : x ≤ WithBot.ofDual y ↔ y ≤ WithTop.toDual x

@[simp]

theorem WithBot.ofDual_le_ofDual_iff {α : Type u_1} [LE α] {x y : WithBot αᵒᵈ} : WithBot.ofDual x ≤ WithBot.ofDual y ↔ y ≤ x

theorem WithTop.toDual_le_iff {α : Type u_1} [LE α] {x : WithTop α} {y : WithBot αᵒᵈ} : WithTop.toDual x ≤ y ↔ WithBot.ofDual y ≤ x

theorem WithTop.le_toDual_iff {α : Type u_1} [LE α] {x : WithBot αᵒᵈ} {y : WithTop α} : x ≤ WithTop.toDual y ↔ y ≤ WithBot.ofDual x

@[simp]

theorem WithTop.toDual_le_toDual_iff {α : Type u_1} [LE α] {x y : WithTop α} : WithTop.toDual x ≤ WithTop.toDual y ↔ y ≤ x

theorem WithTop.ofDual_le_iff {α : Type u_1} [LE α] {x : WithTop αᵒᵈ} {y : WithBot α} : WithTop.ofDual x ≤ y ↔ WithBot.toDual y ≤ x

theorem WithTop.le_ofDual_iff {α : Type u_1} [LE α] {x : WithBot α} {y : WithTop αᵒᵈ} : x ≤ WithTop.ofDual y ↔ y ≤ WithBot.toDual x

@[simp]

theorem WithTop.ofDual_le_ofDual_iff {α : Type u_1} [LE α] {x y : WithTop αᵒᵈ} : WithTop.ofDual x ≤ WithTop.ofDual y ↔ y ≤ x

theorem WithBot.toDual_lt_iff {α : Type u_1} [LT α] {x : WithBot α} {y : WithTop αᵒᵈ} : WithBot.toDual x < y ↔ WithTop.ofDual y < x

theorem WithBot.lt_toDual_iff {α : Type u_1} [LT α] {x : WithTop αᵒᵈ} {y : WithBot α} : x < WithBot.toDual y ↔ y < WithTop.ofDual x

@[simp]

theorem WithBot.toDual_lt_toDual_iff {α : Type u_1} [LT α] {x y : WithBot α} : WithBot.toDual x < WithBot.toDual y ↔ y < x

theorem WithBot.ofDual_lt_iff {α : Type u_1} [LT α] {x : WithBot αᵒᵈ} {y : WithTop α} : WithBot.ofDual x < y ↔ WithTop.toDual y < x

theorem WithBot.lt_ofDual_iff {α : Type u_1} [LT α] {x : WithTop α} {y : WithBot αᵒᵈ} : x < WithBot.ofDual y ↔ y < WithTop.toDual x

@[simp]

theorem WithBot.ofDual_lt_ofDual_iff {α : Type u_1} [LT α] {x y : WithBot αᵒᵈ} : WithBot.ofDual x < WithBot.ofDual y ↔ y < x

theorem WithTop.toDual_lt_iff {α : Type u_1} [LT α] {x : WithTop α} {y : WithBot αᵒᵈ} : WithTop.toDual x < y ↔ WithBot.ofDual y < x

theorem WithTop.lt_toDual_iff {α : Type u_1} [LT α] {x : WithBot αᵒᵈ} {y : WithTop α} : x < WithTop.toDual y ↔ y < WithBot.ofDual x

@[simp]

theorem WithTop.toDual_lt_toDual_iff {α : Type u_1} [LT α] {x y : WithTop α} : WithTop.toDual x < WithTop.toDual y ↔ y < x

theorem WithTop.ofDual_lt_iff {α : Type u_1} [LT α] {x : WithTop αᵒᵈ} {y : WithBot α} : WithTop.ofDual x < y ↔ WithBot.toDual y < x

theorem WithTop.lt_ofDual_iff {α : Type u_1} [LT α] {x : WithBot α} {y : WithTop αᵒᵈ} : x < WithTop.ofDual y ↔ y < WithBot.toDual x

@[simp]

theorem WithTop.ofDual_lt_ofDual_iff {α : Type u_1} [LT α] {x y : WithTop αᵒᵈ} : WithTop.ofDual x < WithTop.ofDual y ↔ y < x