mathlib documentation

order.bounded_order

⊤ and ⊥, bounded lattices and variants #

This file defines top and bottom elements (greatest and least elements) of a type, the bounded variants of different kinds of lattices, sets up the typeclass hierarchy between them and provides instances for Prop and fun.

Main declarations #

Common lattices #

Top, bottom element #

source
@[class]
structure has_top (α : Type u) :
Type u
  • top : α

Typeclass for the ⊤ (\top) notation

Instances of this typeclass
Instances of other typeclasses for has_top
  • has_top.has_sizeof_inst
source
@[class]
structure has_bot (α : Type u) :
Type u
  • bot : α

Typeclass for the ⊥ (\bot) notation

Instances of this typeclass
Instances of other typeclasses for has_bot
  • has_bot.has_sizeof_inst
source
@[protected, instance]
def has_top_nonempty (α : Type u) [has_top α] :
nonempty α
source
@[protected, instance]
def has_bot_nonempty (α : Type u) [has_bot α] :
nonempty α
source
@[class]
structure order_top (α : Type u) [has_le α] :
Type u
  • top : α
  • le_top : ∀ (a : α), a ≤ ⊤

An order is an order_top if it has a greatest element. We state this using a data mixin, holding the value of ⊤ and the greatest element constraint.

Instances of this typeclass
Instances of other typeclasses for order_top
  • order_top.has_sizeof_inst
source
@[instance]
def order_top.to_has_top (α : Type u) [has_le α] [self : order_top α] :
has_top α
source
noncomputable def top_order_or_no_top_order (α : Type u_1) [has_le α] :
psum (order_top α) (no_top_order α)

An order is (noncomputably) either an order_top or a no_order_top. Use as casesI bot_order_or_no_bot_order α.

Equations
source
@[simp]
theorem le_top {α : Type u} [has_le α] [order_top α] {a : α} :
a ≤ ⊤
source
@[simp]
theorem is_top_top {α : Type u} [has_le α] [order_top α] :
is_top ⊤
source
@[simp]
theorem is_max_top {α : Type u} [preorder α] [order_top α] :
is_max ⊤
source
@[simp]
theorem not_top_lt {α : Type u} [preorder α] [order_top α] {a : α} :
¬⊤ < a
source
theorem ne_top_of_lt {α : Type u} [preorder α] [order_top α] {a b : α} (h : a < b) :
a ≠ ⊤
source
theorem has_lt.lt.ne_top {α : Type u} [preorder α] [order_top α] {a b : α} (h : a < b) :
a ≠ ⊤

Alias of ne_top_of_lt.

source
@[simp]
theorem is_max_iff_eq_top {α : Type u} [partial_order α] [order_top α] {a : α} :
is_max a ↔ a = ⊤
source
@[simp]
theorem is_top_iff_eq_top {α : Type u} [partial_order α] [order_top α] {a : α} :
is_top a ↔ a = ⊤
source
theorem not_is_max_iff_ne_top {α : Type u} [partial_order α] [order_top α] {a : α} :
¬is_max a ↔ a ≠ ⊤
source
theorem not_is_top_iff_ne_top {α : Type u} [partial_order α] [order_top α] {a : α} :
¬is_top a ↔ a ≠ ⊤
source
theorem is_max.eq_top {α : Type u} [partial_order α] [order_top α] {a : α} :
is_max a → a = ⊤

Alias of the forward direction of is_max_iff_eq_top.

source
theorem is_top.eq_top {α : Type u} [partial_order α] [order_top α] {a : α} :
is_top a → a = ⊤

Alias of the forward direction of is_top_iff_eq_top.

source
@[simp]
theorem top_le_iff {α : Type u} [partial_order α] [order_top α] {a : α} :
⊤ ≤ a ↔ a = ⊤
source
theorem top_unique {α : Type u} [partial_order α] [order_top α] {a : α} (h : ⊤ ≤ a) :
a = ⊤
source
theorem eq_top_iff {α : Type u} [partial_order α] [order_top α] {a : α} :
a = ⊤ ↔ ⊤ ≤ a
source
theorem eq_top_mono {α : Type u} [partial_order α] [order_top α] {a b : α} (h : a ≤ b) (h₂ : a = ⊤) :
b = ⊤
source
theorem lt_top_iff_ne_top {α : Type u} [partial_order α] [order_top α] {a : α} :
a < ⊤ ↔ a ≠ ⊤
source
@[simp]
theorem not_lt_top_iff {α : Type u} [partial_order α] [order_top α] {a : α} :
¬a < ⊤ ↔ a = ⊤
source
theorem eq_top_or_lt_top {α : Type u} [partial_order α] [order_top α] (a : α) :
a = ⊤ ∨ a < ⊤
source
theorem ne.lt_top {α : Type u} [partial_order α] [order_top α] {a : α} (h : a ≠ ⊤) :
a < ⊤
source
theorem ne.lt_top' {α : Type u} [partial_order α] [order_top α] {a : α} (h : ⊤ ≠ a) :
a < ⊤
source
theorem ne_top_of_le_ne_top {α : Type u} [partial_order α] [order_top α] {a b : α} (hb : b ≠ ⊤) (hab : a ≤ b) :
a ≠ ⊤
source
theorem strict_mono.apply_eq_top_iff {α : Type u} {β : Type v} [partial_order α] [order_top α] [preorder β] {f : α → β} {a : α} (hf : strict_mono f) :
f a = f ⊤ ↔ a = ⊤
source
theorem strict_anti.apply_eq_top_iff {α : Type u} {β : Type v} [partial_order α] [order_top α] [preorder β] {f : α → β} {a : α} (hf : strict_anti f) :
f a = f ⊤ ↔ a = ⊤
source
theorem not_is_min_top {α : Type u} [partial_order α] [order_top α] [nontrivial α] :
¬is_min ⊤
source
theorem strict_mono.maximal_preimage_top {α : Type u} {β : Type v} [linear_order α] [preorder β] [order_top β] {f : α → β} (H : strict_mono f) {a : α} (h_top : f a = ⊤) (x : α) :
x ≤ a
source
theorem order_top.ext_top {α : Type u_1} {hA : partial_order α} (A : order_top α) {hB : partial_order α} (B : order_top α) (H : ∀ (x y : α), x ≤ y ↔ x ≤ y) :
⊤ = ⊤
source
theorem order_top.ext {α : Type u_1} [partial_order α] {A B : order_top α} :
A = B
source
@[class]
structure order_bot (α : Type u) [has_le α] :
Type u
  • bot : α
  • bot_le : ∀ (a : α), ⊥ ≤ a

An order is an order_bot if it has a least element. We state this using a data mixin, holding the value of ⊥ and the least element constraint.

Instances of this typeclass
Instances of other typeclasses for order_bot
  • order_bot.has_sizeof_inst
source
@[instance]
def order_bot.to_has_bot (α : Type u) [has_le α] [self : order_bot α] :
has_bot α
source
noncomputable def bot_order_or_no_bot_order (α : Type u_1) [has_le α] :
psum (order_bot α) (no_bot_order α)

An order is (noncomputably) either an order_bot or a no_order_bot. Use as casesI bot_order_or_no_bot_order α.

Equations
source
@[simp]
theorem bot_le {α : Type u} [has_le α] [order_bot α] {a : α} :
⊥ ≤ a
source
@[simp]
theorem is_bot_bot {α : Type u} [has_le α] [order_bot α] :
is_bot ⊥
source
@[protected, instance]
def order_dual.has_top (α : Type u) [has_bot α] :
has_top αᵒᵈ
Equations
source
@[protected, instance]
def order_dual.has_bot (α : Type u) [has_top α] :
has_bot αᵒᵈ
Equations
source
@[protected, instance]
def order_dual.order_top (α : Type u) [has_le α] [order_bot α] :
order_top αᵒᵈ
Equations
source
@[protected, instance]
def order_dual.order_bot (α : Type u) [has_le α] [order_top α] :
order_bot αᵒᵈ
Equations
source
@[simp]
theorem order_dual.of_dual_bot (α : Type u) [has_top α] :
⇑order_dual.of_dual ⊥ = ⊤
source
@[simp]
theorem order_dual.of_dual_top (α : Type u) [has_bot α] :
⇑order_dual.of_dual ⊤ = ⊥
source
@[simp]
theorem order_dual.to_dual_bot (α : Type u) [has_bot α] :
⇑order_dual.to_dual ⊥ = ⊤
source
@[simp]
theorem order_dual.to_dual_top (α : Type u) [has_top α] :
⇑order_dual.to_dual ⊤ = ⊥
source
@[simp]
theorem is_min_bot {α : Type u} [preorder α] [order_bot α] :
is_min ⊥
source
@[simp]
theorem not_lt_bot {α : Type u} [preorder α] [order_bot α] {a : α} :
¬a < ⊥
source
theorem ne_bot_of_gt {α : Type u} [preorder α] [order_bot α] {a b : α} (h : a < b) :
b ≠ ⊥
source
theorem has_lt.lt.ne_bot {α : Type u} [preorder α] [order_bot α] {a b : α} (h : a < b) :
b ≠ ⊥

Alias of ne_bot_of_gt.

source
@[simp]
theorem is_min_iff_eq_bot {α : Type u} [partial_order α] [order_bot α] {a : α} :
is_min a ↔ a = ⊥
source
@[simp]
theorem is_bot_iff_eq_bot {α : Type u} [partial_order α] [order_bot α] {a : α} :
is_bot a ↔ a = ⊥
source
theorem not_is_min_iff_ne_bot {α : Type u} [partial_order α] [order_bot α] {a : α} :
¬is_min a ↔ a ≠ ⊥
source
theorem not_is_bot_iff_ne_bot {α : Type u} [partial_order α] [order_bot α] {a : α} :
¬is_bot a ↔ a ≠ ⊥
source
theorem is_min.eq_bot {α : Type u} [partial_order α] [order_bot α] {a : α} :
is_min a → a = ⊥

Alias of the forward direction of is_min_iff_eq_bot.

source
theorem is_bot.eq_bot {α : Type u} [partial_order α] [order_bot α] {a : α} :
is_bot a → a = ⊥

Alias of the forward direction of is_bot_iff_eq_bot.

source
@[simp]
theorem le_bot_iff {α : Type u} [partial_order α] [order_bot α] {a : α} :
a ≤ ⊥ ↔ a = ⊥
source
theorem bot_unique {α : Type u} [partial_order α] [order_bot α] {a : α} (h : a ≤ ⊥) :
a = ⊥
source
theorem eq_bot_iff {α : Type u} [partial_order α] [order_bot α] {a : α} :
a = ⊥ ↔ a ≤ ⊥
source
theorem eq_bot_mono {α : Type u} [partial_order α] [order_bot α] {a b : α} (h : a ≤ b) (h₂ : b = ⊥) :
a = ⊥
source
theorem bot_lt_iff_ne_bot {α : Type u} [partial_order α] [order_bot α] {a : α} :
⊥ < a ↔ a ≠ ⊥
source
@[simp]
theorem not_bot_lt_iff {α : Type u} [partial_order α] [order_bot α] {a : α} :
¬⊥ < a ↔ a = ⊥
source
theorem eq_bot_or_bot_lt {α : Type u} [partial_order α] [order_bot α] (a : α) :
a = ⊥ ∨ ⊥ < a
source
theorem eq_bot_of_minimal {α : Type u} [partial_order α] [order_bot α] {a : α} (h : ∀ (b : α), ¬b < a) :
a = ⊥
source
theorem ne.bot_lt {α : Type u} [partial_order α] [order_bot α] {a : α} (h : a ≠ ⊥) :
⊥ < a
source
theorem ne.bot_lt' {α : Type u} [partial_order α] [order_bot α] {a : α} (h : ⊥ ≠ a) :
⊥ < a
source
theorem ne_bot_of_le_ne_bot {α : Type u} [partial_order α] [order_bot α] {a b : α} (hb : b ≠ ⊥) (hab : b ≤ a) :
a ≠ ⊥
source
theorem strict_mono.apply_eq_bot_iff {α : Type u} {β : Type v} [partial_order α] [order_bot α] [preorder β] {f : α → β} {a : α} (hf : strict_mono f) :
f a = f ⊥ ↔ a = ⊥
source
theorem strict_anti.apply_eq_bot_iff {α : Type u} {β : Type v} [partial_order α] [order_bot α] [preorder β] {f : α → β} {a : α} (hf : strict_anti f) :
f a = f ⊥ ↔ a = ⊥
source
theorem not_is_max_bot {α : Type u} [partial_order α] [order_bot α] [nontrivial α] :
¬is_max ⊥
source
theorem strict_mono.minimal_preimage_bot {α : Type u} {β : Type v} [linear_order α] [partial_order β] [order_bot β] {f : α → β} (H : strict_mono f) {a : α} (h_bot : f a = ⊥) (x : α) :
a ≤ x
source
theorem order_bot.ext_bot {α : Type u_1} {hA : partial_order α} (A : order_bot α) {hB : partial_order α} (B : order_bot α) (H : ∀ (x y : α), x ≤ y ↔ x ≤ y) :
⊥ = ⊥
source
theorem order_bot.ext {α : Type u_1} [partial_order α] {A B : order_bot α} :
A = B
source
@[simp]
theorem top_sup_eq {α : Type u} [semilattice_sup α] [order_top α] {a : α} :
⊤ ⊔ a = ⊤
source
@[simp]
theorem sup_top_eq {α : Type u} [semilattice_sup α] [order_top α] {a : α} :
a ⊔ ⊤ = ⊤
source
@[simp]
theorem bot_sup_eq {α : Type u} [semilattice_sup α] [order_bot α] {a : α} :
⊥ ⊔ a = a
source
@[simp]
theorem sup_bot_eq {α : Type u} [semilattice_sup α] [order_bot α] {a : α} :
a ⊔ ⊥ = a
source
@[simp]
theorem sup_eq_bot_iff {α : Type u} [semilattice_sup α] [order_bot α] {a b : α} :
a ⊔ b = ⊥ ↔ a = ⊥ ∧ b = ⊥
source
@[simp]
theorem top_inf_eq {α : Type u} [semilattice_inf α] [order_top α] {a : α} :
⊤ ⊓ a = a
source
@[simp]
theorem inf_top_eq {α : Type u} [semilattice_inf α] [order_top α] {a : α} :
a ⊓ ⊤ = a
source
@[simp]
theorem inf_eq_top_iff {α : Type u} [semilattice_inf α] [order_top α] {a b : α} :
a ⊓ b = ⊤ ↔ a = ⊤ ∧ b = ⊤
source
@[simp]
theorem bot_inf_eq {α : Type u} [semilattice_inf α] [order_bot α] {a : α} :
⊥ ⊓ a = ⊥
source
@[simp]
theorem inf_bot_eq {α : Type u} [semilattice_inf α] [order_bot α] {a : α} :
a ⊓ ⊥ = ⊥

Bounded order #

source
@[instance]
def bounded_order.to_order_bot (α : Type u) [has_le α] [self : bounded_order α] :
order_bot α
source
@[instance]
def bounded_order.to_order_top (α : Type u) [has_le α] [self : bounded_order α] :
order_top α
source
@[class]
structure bounded_order (α : Type u) [has_le α] :
Type u
  • top : α
  • le_top : ∀ (a : α), a ≤ ⊤
  • bot : α
  • bot_le : ∀ (a : α), ⊥ ≤ a

A bounded order describes an order (≤) with a top and bottom element, denoted ⊤ and ⊥ respectively.

Instances of this typeclass
Instances of other typeclasses for bounded_order
  • bounded_order.has_sizeof_inst
source
@[protected, instance]
def order_dual.bounded_order (α : Type u) [has_le α] [bounded_order α] :
bounded_order αᵒᵈ
Equations
source
theorem bounded_order.ext {α : Type u_1} [partial_order α] {A B : bounded_order α} :
A = B
source
@[protected, instance]
def Prop.distrib_lattice  :
distrib_lattice Prop

Propositions form a distributive lattice.

Equations
source
@[protected, instance]
def Prop.bounded_order  :
bounded_order Prop

Propositions form a bounded order.

Equations
source
@[protected, instance]
def Prop.le_is_total  :
is_total Prop has_le.le
source
@[protected, instance]
noncomputable def Prop.linear_order  :
linear_order Prop
Equations
source
@[simp]
theorem sup_Prop_eq  :
has_sup.sup = or
source
@[simp]
theorem inf_Prop_eq  :
has_inf.inf = and

In this section we prove some properties about monotone and antitone operations on Prop #

source
theorem monotone_and {α : Type u} [preorder α] {p q : α → Prop} (m_p : monotone p) (m_q : monotone q) :
monotone (λ (x : α), p x ∧ q x)
source
theorem monotone_or {α : Type u} [preorder α] {p q : α → Prop} (m_p : monotone p) (m_q : monotone q) :
monotone (λ (x : α), p x ∨ q x)
source
theorem monotone_le {α : Type u} [preorder α] {x : α} :
monotone (has_le.le x)
source
theorem monotone_lt {α : Type u} [preorder α] {x : α} :
monotone (has_lt.lt x)
source
theorem antitone_le {α : Type u} [preorder α] {x : α} :
antitone (λ (_x : α), _x ≤ x)
source
theorem antitone_lt {α : Type u} [preorder α] {x : α} :
antitone (λ (_x : α), _x < x)
source
theorem monotone.forall {α : Type u} {β : Type v} [preorder α] {P : β → α → Prop} (hP : ∀ (x : β), monotone (P x)) :
monotone (λ (y : α), ∀ (x : β), P x y)
source
theorem antitone.forall {α : Type u} {β : Type v} [preorder α] {P : β → α → Prop} (hP : ∀ (x : β), antitone (P x)) :
antitone (λ (y : α), ∀ (x : β), P x y)
source
theorem monotone.ball {α : Type u} {β : Type v} [preorder α] {P : β → α → Prop} {s : set β} (hP : ∀ (x : β), x ∈ s → monotone (P x)) :
monotone (λ (y : α), ∀ (x : β), x ∈ s → P x y)
source
theorem antitone.ball {α : Type u} {β : Type v} [preorder α] {P : β → α → Prop} {s : set β} (hP : ∀ (x : β), x ∈ s → antitone (P x)) :
antitone (λ (y : α), ∀ (x : β), x ∈ s → P x y)
source
theorem exists_ge_and_iff_exists {α : Type u} [semilattice_sup α] {P : α → Prop} {x₀ : α} (hP : monotone P) :
(∃ (x : α), x₀ ≤ x ∧ P x) ↔ ∃ (x : α), P x
source
theorem exists_le_and_iff_exists {α : Type u} [semilattice_inf α] {P : α → Prop} {x₀ : α} (hP : antitone P) :
(∃ (x : α), x ≤ x₀ ∧ P x) ↔ ∃ (x : α), P x

Function lattices #

source
@[protected, instance]
def pi.has_bot {ι : Type u_1} {α' : ι → Type u_2} [Π (i : ι), has_bot (α' i)] :
has_bot (Π (i : ι), α' i)
Equations
source
@[simp]
theorem pi.bot_apply {ι : Type u_1} {α' : ι → Type u_2} [Π (i : ι), has_bot (α' i)] (i : ι) :
⊥ i = ⊥
source
theorem pi.bot_def {ι : Type u_1} {α' : ι → Type u_2} [Π (i : ι), has_bot (α' i)] :
⊥ = λ (i : ι), ⊥
source
@[protected, instance]
def pi.has_top {ι : Type u_1} {α' : ι → Type u_2} [Π (i : ι), has_top (α' i)] :
has_top (Π (i : ι), α' i)
Equations
source
@[simp]
theorem pi.top_apply {ι : Type u_1} {α' : ι → Type u_2} [Π (i : ι), has_top (α' i)] (i : ι) :
⊤ i = ⊤
source
theorem pi.top_def {ι : Type u_1} {α' : ι → Type u_2} [Π (i : ι), has_top (α' i)] :
⊤ = λ (i : ι), ⊤
source
@[protected, instance]
def pi.order_top {ι : Type u_1} {α' : ι → Type u_2} [Π (i : ι), has_le (α' i)] [Π (i : ι), order_top (α' i)] :
order_top (Π (i : ι), α' i)
Equations
source
@[protected, instance]
def pi.order_bot {ι : Type u_1} {α' : ι → Type u_2} [Π (i : ι), has_le (α' i)] [Π (i : ι), order_bot (α' i)] :
order_bot (Π (i : ι), α' i)
Equations
source
@[protected, instance]
def pi.bounded_order {ι : Type u_1} {α' : ι → Type u_2} [Π (i : ι), has_le (α' i)] [Π (i : ι), bounded_order (α' i)] :
bounded_order (Π (i : ι), α' i)
Equations
source
theorem eq_bot_of_bot_eq_top {α : Type u} [partial_order α] [bounded_order α] (hα : ⊥ = ⊤) (x : α) :
x = ⊥
source
theorem eq_top_of_bot_eq_top {α : Type u} [partial_order α] [bounded_order α] (hα : ⊥ = ⊤) (x : α) :
x = ⊤
source
theorem subsingleton_of_top_le_bot {α : Type u} [partial_order α] [bounded_order α] (h : ⊤ ≤ ⊥) :
subsingleton α
source
theorem subsingleton_of_bot_eq_top {α : Type u} [partial_order α] [bounded_order α] (hα : ⊥ = ⊤) :
subsingleton α
source
theorem subsingleton_iff_bot_eq_top {α : Type u} [partial_order α] [bounded_order α] :
⊥ = ⊤ ↔ subsingleton α
source
@[reducible]
def order_top.lift {α : Type u} {β : Type v} [has_le α] [has_top α] [has_le β] [order_top β] (f : α → β) (map_le : ∀ (a b : α), f a ≤ f b → a ≤ b) (map_top : f ⊤ = ⊤) :
order_top α

Pullback an order_top.

Equations
source
@[reducible]
def order_bot.lift {α : Type u} {β : Type v} [has_le α] [has_bot α] [has_le β] [order_bot β] (f : α → β) (map_le : ∀ (a b : α), f a ≤ f b → a ≤ b) (map_bot : f ⊥ = ⊥) :
order_bot α

Pullback an order_bot.

Equations
source
@[reducible]
def bounded_order.lift {α : Type u} {β : Type v} [has_le α] [has_top α] [has_bot α] [has_le β] [bounded_order β] (f : α → β) (map_le : ∀ (a b : α), f a ≤ f b → a ≤ b) (map_top : f ⊤ = ⊤) (map_bot : f ⊥ = ⊥) :
bounded_order α

Pullback a bounded_order.

Equations

with_bot, with_top #

source
def with_bot (α : Type u_1) :
Type u_1

Attach ⊥ to a type.

Equations
Instances for with_bot
source
@[protected, instance]
meta def with_bot.has_to_format {α : Type u} [has_to_format α] :
has_to_format (with_bot α)
source
@[protected, instance]
def with_bot.has_repr {α : Type u} [has_repr α] :
has_repr (with_bot α)
Equations
source
@[protected, instance]
def with_bot.has_coe_t {α : Type u} :
has_coe_t α (with_bot α)
Equations
source
@[protected, instance]
def with_bot.has_bot {α : Type u} :
has_bot (with_bot α)
Equations
source
@[protected, instance]
meta def with_bot.has_reflect {α : Type} [reflected Type α] [has_reflect α] :
has_reflect (with_bot α)
source
@[protected, instance]
def with_bot.inhabited {α : Type u} :
inhabited (with_bot α)
Equations
source
theorem with_bot.none_eq_bot {α : Type u} :
option.none = ⊥
source
theorem with_bot.some_eq_coe {α : Type u} (a : α) :
option.some a = ↑a
source
@[simp]
theorem with_bot.bot_ne_coe {α : Type u} {a : α} :
⊥ ≠ ↑a
source
@[simp]
theorem with_bot.coe_ne_bot {α : Type u} {a : α} :
↑a ≠ ⊥
source
def with_bot.rec_bot_coe {α : Type u} {C : with_bot α → Sort u_1} (h₁ : C ⊥) (h₂ : Π (a : α), C ↑a) (n : with_bot α) :
C n

Recursor for with_bot using the preferred forms ⊥ and ↑a.

Equations
source
@[simp]
theorem with_bot.rec_bot_coe_bot {α : Type u} {C : with_bot α → Sort u_1} (d : C ⊥) (f : Π (a : α), C ↑a) :
with_bot.rec_bot_coe d f ⊥ = d
source
@[simp]
theorem with_bot.rec_bot_coe_coe {α : Type u} {C : with_bot α → Sort u_1} (d : C ⊥) (f : Π (a : α), C ↑a) (x : α) :
with_bot.rec_bot_coe d f ↑x = f x
source
def with_bot.unbot' {α : Type u} (d : α) (x : with_bot α) :
α

Specialization of option.get_or_else to values in with_bot α that respects API boundaries.

Equations
source
@[simp]
theorem with_bot.unbot'_bot {α : Type u_1} (d : α) :
with_bot.unbot' d ⊥ = d
source
@[simp]
theorem with_bot.unbot'_coe {α : Type u_1} (d x : α) :
with_bot.unbot' d ↑x = x
source
@[norm_cast]
theorem with_bot.coe_eq_coe {α : Type u} {a b : α} :
↑a = ↑b ↔ a = b
source
def with_bot.map {α : Type u} {β : Type v} (f : α → β) :
with_bot α → with_bot β

Lift a map f : α → β to with_bot α → with_bot β. Implemented using option.map.

Equations
source
@[simp]
theorem with_bot.map_bot {α : Type u} {β : Type v} (f : α → β) :
with_bot.map f ⊥ = ⊥
source
@[simp]
theorem with_bot.map_coe {α : Type u} {β : Type v} (f : α → β) (a : α) :
with_bot.map f ↑a = ↑(f a)
source
theorem with_bot.ne_bot_iff_exists {α : Type u} {x : with_bot α} :
x ≠ ⊥ ↔ ∃ (a : α), ↑a = x
source
def with_bot.unbot {α : Type u} (x : with_bot α) :
x ≠ ⊥ → α

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

Equations
source
@[simp]
theorem with_bot.coe_unbot {α : Type u} (x : with_bot α) (h : x ≠ ⊥) :
↑(x.unbot h) = x
source
@[simp]
theorem with_bot.unbot_coe {α : Type u} (x : α) (h : ↑x ≠ ⊥ := with_bot.coe_ne_bot) :
↑x.unbot h = x
source
@[protected, instance]
def with_bot.can_lift {α : Type u} :
can_lift (with_bot α) α
Equations
source
@[protected, instance]
def with_bot.has_le {α : Type u} [has_le α] :
has_le (with_bot α)
Equations
source
@[simp]
theorem with_bot.some_le_some {α : Type u} {a b : α} [has_le α] :
option.some a ≤ option.some b ↔ a ≤ b
source
@[simp, norm_cast]
theorem with_bot.coe_le_coe {α : Type u} {a b : α} [has_le α] :
↑a ≤ ↑b ↔ a ≤ b
source
@[simp]
theorem with_bot.none_le {α : Type u} [has_le α] {a : with_bot α} :
option.none ≤ a
source
@[protected, instance]
def with_bot.order_bot {α : Type u} [has_le α] :
order_bot (with_bot α)
Equations
source
@[protected, instance]
def with_bot.order_top {α : Type u} [has_le α] [order_top α] :
order_top (with_bot α)
Equations
source
@[protected, instance]
def with_bot.bounded_order {α : Type u} [has_le α] [order_top α] :
bounded_order (with_bot α)
Equations
source
theorem with_bot.not_coe_le_bot {α : Type u} [has_le α] (a : α) :
¬↑a ≤ ⊥
source
theorem with_bot.coe_le {α : Type u} {a b : α} [has_le α] {o : option α} :
b ∈ o → (↑a ≤ o ↔ a ≤ b)
source
theorem with_bot.coe_le_iff {α : Type u} {a : α} [has_le α] {x : with_bot α} :
↑a ≤ x ↔ ∃ (b : α), x = ↑b ∧ a ≤ b
source
theorem with_bot.le_coe_iff {α : Type u} {b : α} [has_le α] {x : with_bot α} :
x ≤ ↑b ↔ ∀ (a : α), x = ↑a → a ≤ b
source
@[protected]
theorem is_max.with_bot {α : Type u} {a : α} [has_le α] (h : is_max a) :
is_max ↑a
source
@[protected, instance]
def with_bot.has_lt {α : Type u} [has_lt α] :
has_lt (with_bot α)
Equations
source
@[simp]
theorem with_bot.some_lt_some {α : Type u} {a b : α} [has_lt α] :
option.some a < option.some b ↔ a < b
source
@[simp, norm_cast]
theorem with_bot.coe_lt_coe {α : Type u} {a b : α} [has_lt α] :
↑a < ↑b ↔ a < b
source
@[simp]
theorem with_bot.none_lt_some {α : Type u} [has_lt α] (a : α) :
option.none < option.some a
source
theorem with_bot.bot_lt_coe {α : Type u} [has_lt α] (a : α) :
⊥ < ↑a
source
@[simp]
theorem with_bot.not_lt_none {α : Type u} [has_lt α] (a : with_bot α) :
¬a < option.none
source
theorem with_bot.lt_iff_exists_coe {α : Type u} [has_lt α] {a b : with_bot α} :
a < b ↔ ∃ (p : α), b = ↑p ∧ a < ↑p
source
theorem with_bot.lt_coe_iff {α : Type u} {b : α} [has_lt α] {x : with_bot α} :
x < ↑b ↔ ∀ (a : α), x = ↑a → a < b
source
@[protected, instance]
def with_bot.preorder {α : Type u} [preorder α] :
preorder (with_bot α)
Equations
source
@[protected, instance]
def with_bot.partial_order {α : Type u} [partial_order α] :
partial_order (with_bot α)
Equations
source
theorem with_bot.map_le_iff {α : Type u} {β : Type v} [preorder α] [preorder β] (f : α → β) (mono_iff : ∀ {a b : α}, f a ≤ f b ↔ a ≤ b) (a b : with_bot α) :
with_bot.map f a ≤ with_bot.map f b ↔ a ≤ b
source
theorem with_bot.le_coe_get_or_else {α : Type u} [preorder α] (a : with_bot α) (b : α) :
a ≤ ↑(option.get_or_else a b)
source
@[simp]
theorem with_bot.get_or_else_bot {α : Type u} (a : α) :
option.get_or_else ⊥ a = a
source
theorem with_bot.get_or_else_bot_le_iff {α : Type u} [has_le α] [order_bot α] {a : with_bot α} {b : α} :
option.get_or_else a ⊥ ≤ b ↔ a ≤ ↑b
source
theorem with_bot.get_or_else_bot_lt_iff {α : Type u} [partial_order α] [order_bot α] {a : with_bot α} {b : α} (ha : a ≠ ⊥) :
option.get_or_else a ⊥ < b ↔ a < ↑b
source
@[protected, instance]
def with_bot.semilattice_sup {α : Type u} [semilattice_sup α] :
semilattice_sup (with_bot α)
Equations
source
theorem with_bot.coe_sup {α : Type u} [semilattice_sup α] (a b : α) :
↑(a ⊔ b) = ↑a ⊔ ↑b
source
@[protected, instance]
def with_bot.semilattice_inf {α : Type u} [semilattice_inf α] :
semilattice_inf (with_bot α)
Equations
source
theorem with_bot.coe_inf {α : Type u} [semilattice_inf α] (a b : α) :
↑(a ⊓ b) = ↑a ⊓ ↑b
source
@[protected, instance]
def with_bot.lattice {α : Type u} [lattice α] :
lattice (with_bot α)
Equations
source
@[protected, instance]
def with_bot.decidable_le {α : Type u} [has_le α] [decidable_rel has_le.le] :
decidable_rel has_le.le
Equations
source
@[protected, instance]
def with_bot.decidable_lt {α : Type u} [has_lt α] [decidable_rel has_lt.lt] :
decidable_rel has_lt.lt
Equations
source
@[protected, instance]
def with_bot.is_total_le {α : Type u} [has_le α] [is_total α has_le.le] :
is_total (with_bot α) has_le.le
source
@[protected, instance]
def with_bot.linear_order {α : Type u} [linear_order α] :
linear_order (with_bot α)
Equations
source
@[norm_cast]
theorem with_bot.coe_min {α : Type u} [linear_order α] (x y : α) :
↑(linear_order.min x y) = linear_order.min ↑x ↑y
source
@[norm_cast]
theorem with_bot.coe_max {α : Type u} [linear_order α] (x y : α) :
↑(linear_order.max x y) = linear_order.max ↑x ↑y
source
theorem with_bot.well_founded_lt {α : Type u} [preorder α] (h : well_founded has_lt.lt) :
well_founded has_lt.lt
source
@[protected, instance]
def with_bot.densely_ordered {α : Type u} [has_lt α] [densely_ordered α] [no_min_order α] :
densely_ordered (with_bot α)
source
theorem with_bot.lt_iff_exists_coe_btwn {α : Type u} [preorder α] [densely_ordered α] [no_min_order α] {a b : with_bot α} :
a < b ↔ ∃ (x : α), a < ↑x ∧ ↑x < b
source
@[protected, instance]
def with_bot.no_top_order {α : Type u} [has_le α] [no_top_order α] [nonempty α] :
no_top_order (with_bot α)
source
@[protected, instance]
def with_bot.no_max_order {α : Type u} [has_lt α] [no_max_order α] [nonempty α] :
no_max_order (with_bot α)
source
def with_top (α : Type u_1) :
Type u_1

Attach ⊤ to a type.

Equations
Instances for with_top
source
@[protected, instance]
meta def with_top.has_to_format {α : Type u} [has_to_format α] :
has_to_format (with_top α)
source
@[protected, instance]
def with_top.has_repr {α : Type u} [has_repr α] :
has_repr (with_top α)
Equations
source
@[protected, instance]
def with_top.has_coe_t {α : Type u} :
has_coe_t α (with_top α)
Equations
source
@[protected, instance]
def with_top.has_top {α : Type u} :
has_top (with_top α)
Equations
source
@[protected, instance]
meta def with_top.has_reflect {α : Type} [reflected Type α] [has_reflect α] :
has_reflect (with_top α)
source
@[protected, instance]
def with_top.inhabited {α : Type u} :
inhabited (with_top α)
Equations
source
theorem with_top.none_eq_top {α : Type u} :
option.none = ⊤
source
theorem with_top.some_eq_coe {α : Type u} (a : α) :
option.some a = ↑a
source
@[simp]
theorem with_top.top_ne_coe {α : Type u} {a : α} :
⊤ ≠ ↑a
source
@[simp]
theorem with_top.coe_ne_top {α : Type u} {a : α} :
↑a ≠ ⊤
source
def with_top.rec_top_coe {α : Type u} {C : with_top α → Sort u_1} (h₁ : C ⊤) (h₂ : Π (a : α), C ↑a) (n : with_top α) :
C n

Recursor for with_top using the preferred forms ⊤ and ↑a.

Equations
source
@[simp]
theorem with_top.rec_top_coe_top {α : Type u} {C : with_top α → Sort u_1} (d : C ⊤) (f : Π (a : α), C ↑a) :
with_top.rec_top_coe d f ⊤ = d
source
@[simp]
theorem with_top.rec_top_coe_coe {α : Type u} {C : with_top α → Sort u_1} (d : C ⊤) (f : Π (a : α), C ↑a) (x : α) :
with_top.rec_top_coe d f ↑x = f x
source
@[protected]
def with_top.to_dual {α : Type u} :
with_top α ≃ with_bot αᵒᵈ

with_top.to_dual is the equivalence sending ⊤ to ⊥ and any a : α to to_dual a : αᵒᵈ. See with_top.to_dual_bot_equiv for the related order-iso.

Equations
source
@[protected]
def with_top.of_dual {α : Type u} :
with_top αᵒᵈ ≃ with_bot α

with_top.of_dual is the equivalence sending ⊤ to ⊥ and any a : αᵒᵈ to of_dual a : α. See with_top.to_dual_bot_equiv for the related order-iso.

Equations
source
@[protected]
def with_bot.to_dual {α : Type u} :
with_bot α ≃ with_top αᵒᵈ

with_bot.to_dual is the equivalence sending ⊥ to ⊤ and any a : α to to_dual a : αᵒᵈ. See with_bot.to_dual_top_equiv for the related order-iso.

Equations
source
@[protected]
def with_bot.of_dual {α : Type u} :
with_bot αᵒᵈ ≃ with_top α

with_bot.of_dual is the equivalence sending ⊥ to ⊤ and any a : αᵒᵈ to of_dual a : α. See with_bot.to_dual_top_equiv for the related order-iso.

Equations
source
@[simp]
theorem with_top.to_dual_symm_apply {α : Type u} (a : with_bot αᵒᵈ) :
⇑(with_top.to_dual.symm) a = ⇑with_bot.of_dual a
source
@[simp]
theorem with_top.of_dual_symm_apply {α : Type u} (a : with_bot α) :
⇑(with_top.of_dual.symm) a = ⇑with_bot.to_dual a
source
@[simp]
theorem with_top.to_dual_apply_top {α : Type u} :
⇑with_top.to_dual ⊤ = ⊥
source
@[simp]
theorem with_top.of_dual_apply_top {α : Type u} :
⇑with_top.of_dual ⊤ = ⊥
source
@[simp]
theorem with_top.to_dual_apply_coe {α : Type u} (a : α) :
⇑with_top.to_dual ↑a = ↑(⇑order_dual.to_dual a)
source
@[simp]
theorem with_top.of_dual_apply_coe {α : Type u} (a : αᵒᵈ) :
⇑with_top.of_dual ↑a = ↑(⇑order_dual.of_dual a)
source
def with_top.untop' {α : Type u} (d : α) (x : with_top α) :
α

Specialization of option.get_or_else to values in with_top α that respects API boundaries.

Equations
source
@[simp]
theorem with_top.untop'_top {α : Type u_1} (d : α) :
with_top.untop' d ⊤ = d
source
@[simp]
theorem with_top.untop'_coe {α : Type u_1} (d x : α) :
with_top.untop' d ↑x = x
source
@[norm_cast]
theorem with_top.coe_eq_coe {α : Type u} {a b : α} :
↑a = ↑b ↔ a = b
source
def with_top.map {α : Type u} {β : Type v} (f : α → β) :
with_top α → with_top β

Lift a map f : α → β to with_top α → with_top β. Implemented using option.map.

Equations
source
@[simp]
theorem with_top.map_top {α : Type u} {β : Type v} (f : α → β) :
with_top.map f ⊤ = ⊤
source
@[simp]
theorem with_top.map_coe {α : Type u} {β : Type v} (f : α → β) (a : α) :
with_top.map f ↑a = ↑(f a)
source
theorem with_top.map_to_dual {α : Type u} {β : Type v} (f : αᵒᵈ → βᵒᵈ) (a : with_bot α) :
with_top.map f (⇑with_bot.to_dual a) = with_bot.map (⇑order_dual.to_dual ∘ f) a
source
theorem with_top.map_of_dual {α : Type u} {β : Type v} (f : α → β) (a : with_bot αᵒᵈ) :
with_top.map f (⇑with_bot.of_dual a) = with_bot.map (⇑order_dual.of_dual ∘ f) a
source
theorem with_top.to_dual_map {α : Type u} {β : Type v} (f : α → β) (a : with_top α) :
⇑with_top.to_dual (with_top.map f a) = with_bot.map (⇑order_dual.to_dual ∘ f ∘ ⇑order_dual.of_dual) (⇑with_top.to_dual a)
source
theorem with_top.of_dual_map {α : Type u} {β : Type v} (f : αᵒᵈ → βᵒᵈ) (a : with_top αᵒᵈ) :
⇑with_top.of_dual (with_top.map f a) = with_bot.map (⇑order_dual.of_dual ∘ f ∘ ⇑order_dual.to_dual) (⇑with_top.of_dual a)
source
theorem with_top.ne_top_iff_exists {α : Type u} {x : with_top α} :
x ≠ ⊤ ↔ ∃ (a : α), ↑a = x
source
def with_top.untop {α : Type u} (x : with_top α) :
x ≠ ⊤ → α

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

Equations
source
@[simp]
theorem with_top.coe_untop {α : Type u} (x : with_top α) (h : x ≠ ⊤) :
↑(x.untop h) = x
source
@[simp]
theorem with_top.untop_coe {α : Type u} (x : α) (h : ↑x ≠ ⊤ := with_top.coe_ne_top) :
↑x.untop h = x
source
@[protected, instance]
def with_top.can_lift {α : Type u} :
can_lift (with_top α) α
Equations
source
@[protected, instance]
def with_top.has_le {α : Type u} [has_le α] :
has_le (with_top α)
Equations
source
theorem with_top.to_dual_le_iff {α : Type u} [has_le α] {a : with_top α} {b : with_bot αᵒᵈ} :
⇑with_top.to_dual a ≤ b ↔ ⇑with_bot.of_dual b ≤ a
source
theorem with_top.le_to_dual_iff {α : Type u} [has_le α] {a : with_bot αᵒᵈ} {b : with_top α} :
a ≤ ⇑with_top.to_dual b ↔ b ≤ ⇑with_bot.of_dual a
source
@[simp]
theorem with_top.to_dual_le_to_dual_iff {α : Type u} [has_le α] {a b : with_top α} :
⇑with_top.to_dual a ≤ ⇑with_top.to_dual b ↔ b ≤ a
source
theorem with_top.of_dual_le_iff {α : Type u} [has_le α] {a : with_top αᵒᵈ} {b : with_bot α} :
⇑with_top.of_dual a ≤ b ↔ ⇑with_bot.to_dual b ≤ a
source
theorem with_top.le_of_dual_iff {α : Type u} [has_le α] {a : with_bot α} {b : with_top αᵒᵈ} :
a ≤ ⇑with_top.of_dual b ↔ b ≤ ⇑with_bot.to_dual a
source
@[simp]
theorem with_top.of_dual_le_of_dual_iff {α : Type u} [has_le α] {a b : with_top αᵒᵈ} :
⇑with_top.of_dual a ≤ ⇑with_top.of_dual b ↔ b ≤ a
source
@[simp, norm_cast]
theorem with_top.coe_le_coe {α : Type u} {a b : α} [has_le α] :
↑a ≤ ↑b ↔ a ≤ b
source
@[simp]
theorem with_top.some_le_some {α : Type u} {a b : α} [has_le α] :
option.some a ≤ option.some b ↔ a ≤ b
source
@[simp]
theorem with_top.le_none {α : Type u} [has_le α] {a : with_top α} :
a ≤ option.none
source
@[protected, instance]
def with_top.order_top {α : Type u} [has_le α] :
order_top (with_top α)
Equations
source
@[protected, instance]
def with_top.order_bot {α : Type u} [has_le α] [order_bot α] :
order_bot (with_top α)
Equations
source
@[protected, instance]
def with_top.bounded_order {α : Type u} [has_le α] [order_bot α] :
bounded_order (with_top α)
Equations
source
theorem with_top.not_top_le_coe {α : Type u} [has_le α] (a : α) :
¬⊤ ≤ ↑a
source
theorem with_top.le_coe {α : Type u} {a b : α} [has_le α] {o : option α} :
a ∈ o → (o ≤ ↑b ↔ a ≤ b)
source
theorem with_top.le_coe_iff {α : Type u} {b : α} [has_le α] {x : with_top α} :
x ≤ ↑b ↔ ∃ (a : α), x = ↑a ∧ a ≤ b
source
theorem with_top.coe_le_iff {α : Type u} {a : α} [has_le α] {x : with_top α} :
↑a ≤ x ↔ ∀ (b : α), x = ↑b → a ≤ b
source
@[protected]
theorem is_min.with_top {α : Type u} {a : α} [has_le α] (h : is_min a) :
is_min ↑a
source
@[protected, instance]
def with_top.has_lt {α : Type u} [has_lt α] :
has_lt (with_top α)
Equations
source
theorem with_top.to_dual_lt_iff {α : Type u} [has_lt α] {a : with_top α} {b : with_bot αᵒᵈ} :
⇑with_top.to_dual a < b ↔ ⇑with_bot.of_dual b < a
source
theorem with_top.lt_to_dual_iff {α : Type u} [has_lt α] {a : with_bot αᵒᵈ} {b : with_top α} :
a < ⇑with_top.to_dual b ↔ b < ⇑with_bot.of_dual a
source
@[simp]
theorem with_top.to_dual_lt_to_dual_iff {α : Type u} [has_lt α] {a b : with_top α} :
⇑with_top.to_dual a < ⇑with_top.to_dual b ↔ b < a
source
theorem with_top.of_dual_lt_iff {α : Type u} [has_lt α] {a : with_top αᵒᵈ} {b : with_bot α} :
⇑with_top.of_dual a < b ↔ ⇑with_bot.to_dual b < a
source
theorem with_top.lt_of_dual_iff {α : Type u} [has_lt α] {a : with_bot α} {b : with_top αᵒᵈ} :
a < ⇑with_top.of_dual b ↔ b < ⇑with_bot.to_dual a
source
@[simp]
theorem with_top.of_dual_lt_of_dual_iff {α : Type u} [has_lt α] {a b : with_top αᵒᵈ} :
⇑with_top.of_dual a < ⇑with_top.of_dual b ↔ b < a
source
@[simp]
theorem with_bot.to_dual_symm_apply {α : Type u} (a : with_top αᵒᵈ) :
⇑(with_bot.to_dual.symm) a = ⇑with_top.of_dual a
source
@[simp]
theorem with_bot.of_dual_symm_apply {α : Type u} (a : with_top α) :
⇑(with_bot.of_dual.symm) a = ⇑with_top.to_dual a
source
@[simp]
theorem with_bot.to_dual_apply_bot {α : Type u} :
⇑with_bot.to_dual ⊥ = ⊤
source
@[simp]
theorem with_bot.of_dual_apply_bot {α : Type u} :
⇑with_bot.of_dual ⊥ = ⊤
source
@[simp]
theorem with_bot.to_dual_apply_coe {α : Type u} (a : α) :
⇑with_bot.to_dual ↑a = ↑(⇑order_dual.to_dual a)
source
@[simp]
theorem with_bot.of_dual_apply_coe {α : Type u} (a : αᵒᵈ) :
⇑with_bot.of_dual ↑a = ↑(⇑order_dual.of_dual a)
source
theorem with_bot.map_to_dual {α : Type u} {β : Type v} (f : αᵒᵈ → βᵒᵈ) (a : with_top α) :
with_bot.map f (⇑with_top.to_dual a) = with_top.map (⇑order_dual.to_dual ∘ f) a
source
theorem with_bot.map_of_dual {α : Type u} {β : Type v} (f : α → β) (a : with_top αᵒᵈ) :
with_bot.map f (⇑with_top.of_dual a) = with_top.map (⇑order_dual.of_dual ∘ f) a
source
theorem with_bot.to_dual_map {α : Type u} {β : Type v} (f : α → β) (a : with_bot α) :
⇑with_bot.to_dual (with_bot.map f a) = with_bot.map (⇑order_dual.to_dual ∘ f ∘ ⇑order_dual.of_dual) (⇑with_bot.to_dual a)
source
theorem with_bot.of_dual_map {α : Type u} {β : Type v} (f : αᵒᵈ → βᵒᵈ) (a : with_bot αᵒᵈ) :
⇑with_bot.of_dual (with_bot.map f a) = with_bot.map (⇑order_dual.of_dual ∘ f ∘ ⇑order_dual.to_dual) (⇑with_bot.of_dual a)
source
theorem with_bot.to_dual_le_iff {α : Type u} [has_le α] {a : with_bot α} {b : with_top αᵒᵈ} :
⇑with_bot.to_dual a ≤ b ↔ ⇑with_top.of_dual b ≤ a
source
theorem with_bot.le_to_dual_iff {α : Type u} [has_le α] {a : with_top αᵒᵈ} {b : with_bot α} :
a ≤ ⇑with_bot.to_dual b ↔ b ≤ ⇑with_top.of_dual a
source
@[simp]
theorem with_bot.to_dual_le_to_dual_iff {α : Type u} [has_le α] {a b : with_bot α} :
⇑with_bot.to_dual a ≤ ⇑with_bot.to_dual b ↔ b ≤ a
source
theorem with_bot.of_dual_le_iff {α : Type u} [has_le α] {a : with_bot αᵒᵈ} {b : with_top α} :
⇑with_bot.of_dual a ≤ b ↔ ⇑with_top.to_dual b ≤ a
source
theorem with_bot.le_of_dual_iff {α : Type u} [has_le α] {a : with_top α} {b : with_bot αᵒᵈ} :
a ≤ ⇑with_bot.of_dual b ↔ b ≤ ⇑with_top.to_dual a
source
@[simp]
theorem with_bot.of_dual_le_of_dual_iff {α : Type u} [has_le α] {a b : with_bot αᵒᵈ} :
⇑with_bot.of_dual a ≤ ⇑with_bot.of_dual b ↔ b ≤ a
source
theorem with_bot.to_dual_lt_iff {α : Type u} [has_lt α] {a : with_bot α} {b : with_top αᵒᵈ} :
⇑with_bot.to_dual a < b ↔ ⇑with_top.of_dual b < a
source
theorem with_bot.lt_to_dual_iff {α : Type u} [has_lt α] {a : with_top αᵒᵈ} {b : with_bot α} :
a < ⇑with_bot.to_dual b ↔ b < ⇑with_top.of_dual a
source
@[simp]
theorem with_bot.to_dual_lt_to_dual_iff {α : Type u} [has_lt α] {a b : with_bot α} :
⇑with_bot.to_dual a < ⇑with_bot.to_dual b ↔ b < a
source
theorem with_bot.of_dual_lt_iff {α : Type u} [has_lt α] {a : with_bot αᵒᵈ} {b : with_top α} :
⇑with_bot.of_dual a < b ↔ ⇑with_top.to_dual b < a
source
theorem with_bot.lt_of_dual_iff {α : Type u} [has_lt α] {a : with_top α} {b : with_bot αᵒᵈ} :
a < ⇑with_bot.of_dual b ↔ b < ⇑with_top.to_dual a
source
@[simp]
theorem with_bot.of_dual_lt_of_dual_iff {α : Type u} [has_lt α] {a b : with_bot αᵒᵈ} :
⇑with_bot.of_dual a < ⇑with_bot.of_dual b ↔ b < a
source
@[simp, norm_cast]
theorem with_top.coe_lt_coe {α : Type u} [has_lt α] {a b : α} :
↑a < ↑b ↔ a < b
source
@[simp]
theorem with_top.some_lt_some {α : Type u} [has_lt α] {a b : α} :
option.some a < option.some b ↔ a < b
source
theorem with_top.coe_lt_top {α : Type u} [has_lt α] (a : α) :
↑a < ⊤
source
@[simp]
theorem with_top.some_lt_none {α : Type u} [has_lt α] (a : α) :
option.some a < option.none
source
@[simp]
theorem with_top.not_none_lt {α : Type u} [has_lt α] (a : with_top α) :
¬option.none < a
source
theorem with_top.lt_iff_exists_coe {α : Type u} [has_lt α] {a b : with_top α} :
a < b ↔ ∃ (p : α), a = ↑p ∧ ↑p < b
source
theorem with_top.coe_lt_iff {α : Type u} [has_lt α] {a : α} {x : with_top α} :
↑a < x ↔ ∀ (b : α), x = ↑b → a < b
source
@[protected, instance]
def with_top.preorder {α : Type u} [preorder α] :
preorder (with_top α)
Equations
source
@[protected, instance]
def with_top.partial_order {α : Type u} [partial_order α] :
partial_order (with_top α)
Equations
source
theorem with_top.map_le_iff {α : Type u} {β : Type v} [preorder α] [preorder β] (f : α → β) (a b : with_top α) (mono_iff : ∀ {a b : α}, f a ≤ f b ↔ a ≤ b) :
with_top.map f a ≤ with_top.map f b ↔ a ≤ b
source
@[protected, instance]
def with_top.semilattice_inf {α : Type u} [semilattice_inf α] :
semilattice_inf (with_top α)
Equations
source
theorem with_top.coe_inf {α : Type u} [semilattice_inf α] (a b : α) :
↑(a ⊓ b) = ↑a ⊓ ↑b
source
@[protected, instance]
def with_top.semilattice_sup {α : Type u} [semilattice_sup α] :
semilattice_sup (with_top α)
Equations
source
theorem with_top.coe_sup {α : Type u} [semilattice_sup α] (a b : α) :
↑(a ⊔ b) = ↑a ⊔ ↑b
source
@[protected, instance]
def with_top.lattice {α : Type u} [lattice α] :
lattice (with_top α)
Equations
source
@[protected, instance]
def with_top.decidable_le {α : Type u} [has_le α] [decidable_rel has_le.le] :
decidable_rel has_le.le
Equations
source
@[protected, instance]
def with_top.decidable_lt {α : Type u} [has_lt α] [decidable_rel has_lt.lt] :
decidable_rel has_lt.lt
Equations
source
@[protected, instance]
def with_top.is_total_le {α : Type u} [has_le α] [is_total α has_le.le] :
is_total (with_top α) has_le.le
source
@[protected, instance]
def with_top.linear_order {α : Type u} [linear_order α] :
linear_order (with_top α)
Equations
source
@[simp, norm_cast]
theorem with_top.coe_min {α : Type u} [linear_order α] (x y : α) :
↑(linear_order.min x y) = linear_order.min ↑x ↑y
source
@[simp, norm_cast]
theorem with_top.coe_max {α : Type u} [linear_order α] (x y : α) :
↑(linear_order.max x y) = linear_order.max ↑x ↑y
source
theorem with_top.well_founded_lt {α : Type u} [preorder α] (h : well_founded has_lt.lt) :
well_founded has_lt.lt
source
theorem with_top.well_founded_gt {α : Type u} [preorder α] (h : well_founded gt) :
well_founded gt
source
theorem with_bot.well_founded_gt {α : Type u} [preorder α] (h : well_founded gt) :
well_founded gt
source
@[protected, instance]
def with_top.trichotomous.lt {α : Type u} [preorder α] [is_trichotomous α has_lt.lt] :
is_trichotomous (with_top α) has_lt.lt
source
@[protected, instance]
def with_top.is_well_order.lt {α : Type u} [preorder α] [h : is_well_order α has_lt.lt] :
is_well_order (with_top α) has_lt.lt
source
@[protected, instance]
def with_top.trichotomous.gt {α : Type u} [preorder α] [is_trichotomous α gt] :
is_trichotomous (with_top α) gt
source
@[protected, instance]
def with_top.is_well_order.gt {α : Type u} [preorder α] [h : is_well_order α gt] :
is_well_order (with_top α) gt
source
@[protected, instance]
def with_bot.trichotomous.lt {α : Type u} [preorder α] [h : is_trichotomous α has_lt.lt] :
is_trichotomous (with_bot α) has_lt.lt
source
@[protected, instance]
def with_bot.is_well_order.lt {α : Type u} [preorder α] [h : is_well_order α has_lt.lt] :
is_well_order (with_bot α) has_lt.lt
source
@[protected, instance]
def with_bot.trichotomous.gt {α : Type u} [preorder α] [h : is_trichotomous α gt] :
is_trichotomous (with_bot α) gt
source
@[protected, instance]
def with_bot.is_well_order.gt {α : Type u} [preorder α] [h : is_well_order α gt] :
is_well_order (with_bot α) gt
source
@[protected, instance]
def with_top.densely_ordered {α : Type u} [has_lt α] [densely_ordered α] [no_max_order α] :
densely_ordered (with_top α)
source
theorem with_top.lt_iff_exists_coe_btwn {α : Type u} [preorder α] [densely_ordered α] [no_max_order α] {a b : with_top α} :
a < b ↔ ∃ (x : α), a < ↑x ∧ ↑x < b
source
@[protected, instance]
def with_top.no_bot_order {α : Type u} [has_le α] [no_bot_order α] [nonempty α] :
no_bot_order (with_top α)
source
@[protected, instance]
def with_top.no_min_order {α : Type u} [has_lt α] [no_min_order α] [nonempty α] :
no_min_order (with_top α)
source
@[protected]
theorem monotone.with_bot_map {α : Type u} {β : Type v} [preorder α] [preorder β] {f : α → β} (hf : monotone f) :
monotone (with_bot.map f)
source
@[protected]
theorem monotone.with_top_map {α : Type u} {β : Type v} [preorder α] [preorder β] {f : α → β} (hf : monotone f) :
monotone (with_top.map f)
source
@[protected]
theorem strict_mono.with_bot_map {α : Type u} {β : Type v} [preorder α] [preorder β] {f : α → β} (hf : strict_mono f) :
strict_mono (with_bot.map f)
source
@[protected]
theorem strict_mono.with_top_map {α : Type u} {β : Type v} [preorder α] [preorder β] {f : α → β} (hf : strict_mono f) :
strict_mono (with_top.map f)

Subtype, order dual, product lattices #

source
@[protected, reducible]
def subtype.order_bot {α : Type u} {p : α → Prop} [has_le α] [order_bot α] (hbot : p ⊥) :
order_bot {x // p x}

A subtype remains a ⊥-order if the property holds at ⊥.

Equations
source
@[protected, reducible]
def subtype.order_top {α : Type u} {p : α → Prop} [has_le α] [order_top α] (htop : p ⊤) :
order_top {x // p x}

A subtype remains a ⊤-order if the property holds at ⊤.

Equations
source
@[protected, reducible]
def subtype.bounded_order {α : Type u} {p : α → Prop} [has_le α] [bounded_order α] (hbot : p ⊥) (htop : p ⊤) :
bounded_order (subtype p)

A subtype remains a bounded order if the property holds at ⊥ and ⊤.

Equations
source
@[simp]
theorem subtype.mk_bot {α : Type u} {p : α → Prop} [partial_order α] [order_bot α] [order_bot (subtype p)] (hbot : p ⊥) :
⟨⊥, hbot⟩ = ⊥
source
@[simp]
theorem subtype.mk_top {α : Type u} {p : α → Prop} [partial_order α] [order_top α] [order_top (subtype p)] (htop : p ⊤) :
⟨⊤, htop⟩ = ⊤
source
theorem subtype.coe_bot {α : Type u} {p : α → Prop} [partial_order α] [order_bot α] [order_bot (subtype p)] (hbot : p ⊥) :
↑⊥ = ⊥
source
theorem subtype.coe_top {α : Type u} {p : α → Prop} [partial_order α] [order_top α] [order_top (subtype p)] (htop : p ⊤) :
↑⊤ = ⊤
source
@[simp]
theorem subtype.coe_eq_bot_iff {α : Type u} {p : α → Prop} [partial_order α] [order_bot α] [order_bot (subtype p)] (hbot : p ⊥) {x : {x // p x}} :
↑x = ⊥ ↔ x = ⊥
source
@[simp]
theorem subtype.coe_eq_top_iff {α : Type u} {p : α → Prop} [partial_order α] [order_top α] [order_top (subtype p)] (htop : p ⊤) {x : {x // p x}} :
↑x = ⊤ ↔ x = ⊤
source
@[simp]
theorem subtype.mk_eq_bot_iff {α : Type u} {p : α → Prop} [partial_order α] [order_bot α] [order_bot (subtype p)] (hbot : p ⊥) {x : α} (hx : p x) :
⟨x, hx⟩ = ⊥ ↔ x = ⊥
source
@[simp]
theorem subtype.mk_eq_top_iff {α : Type u} {p : α → Prop} [partial_order α] [order_top α] [order_top (subtype p)] (htop : p ⊤) {x : α} (hx : p x) :
⟨x, hx⟩ = ⊤ ↔ x = ⊤
source
@[protected, instance]
def prod.has_top (α : Type u) (β : Type v) [has_top α] [has_top β] :
has_top (α × β)
Equations
source
@[protected, instance]
def prod.has_bot (α : Type u) (β : Type v) [has_bot α] [has_bot β] :
has_bot (α × β)
Equations
source
@[protected, instance]
def prod.order_top (α : Type u) (β : Type v) [has_le α] [has_le β] [order_top α] [order_top β] :
order_top (α × β)
Equations
source
@[protected, instance]
def prod.order_bot (α : Type u) (β : Type v) [has_le α] [has_le β] [order_bot α] [order_bot β] :
order_bot (α × β)
Equations
source
@[protected, instance]
def prod.bounded_order (α : Type u) (β : Type v) [has_le α] [has_le β] [bounded_order α] [bounded_order β] :
bounded_order (α × β)
Equations
source
theorem min_bot_left {α : Type u} [linear_order α] [order_bot α] (a : α) :
linear_order.min ⊥ a = ⊥
source
theorem max_top_left {α : Type u} [linear_order α] [order_top α] (a : α) :
linear_order.max ⊤ a = ⊤
source
theorem min_top_left {α : Type u} [linear_order α] [order_top α] (a : α) :
linear_order.min ⊤ a = a
source
theorem max_bot_left {α : Type u} [linear_order α] [order_bot α] (a : α) :
linear_order.max ⊥ a = a
source
theorem min_top_right {α : Type u} [linear_order α] [order_top α] (a : α) :
linear_order.min a ⊤ = a
source
theorem max_bot_right {α : Type u} [linear_order α] [order_bot α] (a : α) :
linear_order.max a ⊥ = a
source
theorem min_bot_right {α : Type u} [linear_order α] [order_bot α] (a : α) :
linear_order.min a ⊥ = ⊥
source
theorem max_top_right {α : Type u} [linear_order α] [order_top α] (a : α) :
linear_order.max a ⊤ = ⊤
source
@[simp]
theorem min_eq_bot {α : Type u} [linear_order α] [order_bot α] {a b : α} :
linear_order.min a b = ⊥ ↔ a = ⊥ ∨ b = ⊥
source
@[simp]
theorem max_eq_top {α : Type u} [linear_order α] [order_top α] {a b : α} :
linear_order.max a b = ⊤ ↔ a = ⊤ ∨ b = ⊤
source
@[simp]
theorem max_eq_bot {α : Type u} [linear_order α] [order_bot α] {a b : α} :
linear_order.max a b = ⊥ ↔ a = ⊥ ∧ b = ⊥
source
@[simp]
theorem min_eq_top {α : Type u} [linear_order α] [order_top α] {a b : α} :
linear_order.min a b = ⊤ ↔ a = ⊤ ∧ b = ⊤

Disjointness and complements #

source
def disjoint {α : Type u} [semilattice_inf α] [order_bot α] (a b : α) :
Prop

Two elements of a lattice are disjoint if their inf is the bottom element. (This generalizes disjoint sets, viewed as members of the subset lattice.)

Equations
Instances for disjoint
source
theorem disjoint_iff {α : Type u} [semilattice_inf α] [order_bot α] {a b : α} :
disjoint a b ↔ a ⊓ b = ⊥
source
theorem disjoint.eq_bot {α : Type u} [semilattice_inf α] [order_bot α] {a b : α} :
disjoint a b → a ⊓ b = ⊥
source
theorem disjoint.comm {α : Type u} [semilattice_inf α] [order_bot α] {a b : α} :
disjoint a b ↔ disjoint b a
source
@[symm]
theorem disjoint.symm {α : Type u} [semilattice_inf α] [order_bot α] ⦃a b : α⦄ :
disjoint a b → disjoint b a
source
theorem symmetric_disjoint {α : Type u} [semilattice_inf α] [order_bot α] :
symmetric disjoint
source
theorem disjoint_assoc {α : Type u} [semilattice_inf α] [order_bot α] {a b c : α} :
disjoint (a ⊓ b) c ↔ disjoint a (b ⊓ c)
source
theorem disjoint_left_comm {α : Type u} [semilattice_inf α] [order_bot α] {a b c : α} :
disjoint a (b ⊓ c) ↔ disjoint b (a ⊓ c)
source
theorem disjoint_right_comm {α : Type u} [semilattice_inf α] [order_bot α] {a b c : α} :
disjoint (a ⊓ b) c ↔ disjoint (a ⊓ c) b
source
@[simp]
theorem disjoint_bot_left {α : Type u} [semilattice_inf α] [order_bot α] {a : α} :
disjoint ⊥ a
source
@[simp]
theorem disjoint_bot_right {α : Type u} [semilattice_inf α] [order_bot α] {a : α} :
disjoint a ⊥
source
theorem disjoint.mono {α : Type u} [semilattice_inf α] [order_bot α] {a b c d : α} (h₁ : a ≤ b) (h₂ : c ≤ d) :
disjoint b d → disjoint a c
source
theorem disjoint.mono_left {α : Type u} [semilattice_inf α] [order_bot α] {a b c : α} (h : a ≤ b) :
disjoint b c → disjoint a c
source
theorem disjoint.mono_right {α : Type u} [semilattice_inf α] [order_bot α] {a b c : α} :
b ≤ c → disjoint a c → disjoint a b
source
theorem disjoint.inf_left {α : Type u} [semilattice_inf α] [order_bot α] {a b : α} (c : α) (h : disjoint a b) :
disjoint (a ⊓ c) b
source
theorem disjoint.inf_left' {α : Type u} [semilattice_inf α] [order_bot α] {a b : α} (c : α) (h : disjoint a b) :
disjoint (c ⊓ a) b
source
theorem disjoint.inf_right {α : Type u} [semilattice_inf α] [order_bot α] {a b : α} (c : α) (h : disjoint a b) :
disjoint a (b ⊓ c)
source
theorem disjoint.inf_right' {α : Type u} [semilattice_inf α] [order_bot α] {a b : α} (c : α) (h : disjoint a b) :
disjoint a (c ⊓ b)
source
@[simp]
theorem disjoint_self {α : Type u} [semilattice_inf α] [order_bot α] {a : α} :
disjoint a a ↔ a = ⊥
source
theorem disjoint.eq_bot_of_self {α : Type u} [semilattice_inf α] [order_bot α] {a : α} :
disjoint a a → a = ⊥

Alias of the forward direction of disjoint_self.

source
theorem disjoint.ne {α : Type u} [semilattice_inf α] [order_bot α] {a b : α} (ha : a ≠ ⊥) (hab : disjoint a b) :
a ≠ b
source
theorem disjoint.eq_bot_of_le {α : Type u} [semilattice_inf α] [order_bot α] {a b : α} (hab : disjoint a b) (h : a ≤ b) :
a = ⊥
source
theorem disjoint.eq_bot_of_ge {α : Type u} [semilattice_inf α] [order_bot α] {a b : α} (hab : disjoint a b) :
b ≤ a → b = ⊥
source
theorem disjoint.of_disjoint_inf_of_le {α : Type u} [semilattice_inf α] [order_bot α] {a b c : α} (h : disjoint (a ⊓ b) c) (hle : a ≤ c) :
disjoint a b
source
theorem disjoint.of_disjoint_inf_of_le' {α : Type u} [semilattice_inf α] [order_bot α] {a b c : α} (h : disjoint (a ⊓ b) c) (hle : b ≤ c) :
disjoint a b
source
@[simp]
theorem disjoint_top {α : Type u} [lattice α] [bounded_order α] {a : α} :
disjoint a ⊤ ↔ a = ⊥
source
@[simp]
theorem top_disjoint {α : Type u} [lattice α] [bounded_order α] {a : α} :
disjoint ⊤ a ↔ a = ⊥
source
@[simp]
theorem disjoint_sup_left {α : Type u} [distrib_lattice α] [order_bot α] {a b c : α} :
disjoint (a ⊔ b) c ↔ disjoint a c ∧ disjoint b c
source
@[simp]
theorem disjoint_sup_right {α : Type u} [distrib_lattice α] [order_bot α] {a b c : α} :
disjoint a (b ⊔ c) ↔ disjoint a b ∧ disjoint a c
source
theorem disjoint.sup_left {α : Type u} [distrib_lattice α] [order_bot α] {a b c : α} (ha : disjoint a c) (hb : disjoint b c) :
disjoint (a ⊔ b) c
source
theorem disjoint.sup_right {α : Type u} [distrib_lattice α] [order_bot α] {a b c : α} (hb : disjoint a b) (hc : disjoint a c) :
disjoint a (b ⊔ c)
source
theorem disjoint.left_le_of_le_sup_right {α : Type u} [distrib_lattice α] [order_bot α] {a b c : α} (h : a ≤ b ⊔ c) (hd : disjoint a c) :
a ≤ b
source
theorem disjoint.left_le_of_le_sup_left {α : Type u} [distrib_lattice α] [order_bot α] {a b c : α} (h : a ≤ c ⊔ b) (hd : disjoint a c) :
a ≤ b
source
def codisjoint {α : Type u} [semilattice_sup α] [order_top α] (a b : α) :
Prop

Two elements of a lattice are codisjoint if their sup is the top element.

Equations
source
theorem codisjoint_iff {α : Type u} [semilattice_sup α] [order_top α] {a b : α} :
codisjoint a b ↔ a ⊔ b = ⊤
source
theorem codisjoint.eq_top {α : Type u} [semilattice_sup α] [order_top α] {a b : α} :
codisjoint a b → a ⊔ b = ⊤
source
theorem codisjoint.comm {α : Type u} [semilattice_sup α] [order_top α] {a b : α} :
codisjoint a b ↔ codisjoint b a
source
@[symm]
theorem codisjoint.symm {α : Type u} [semilattice_sup α] [order_top α] ⦃a b : α⦄ :
codisjoint a b → codisjoint b a
source
theorem symmetric_codisjoint {α : Type u} [semilattice_sup α] [order_top α] :
symmetric codisjoint
source
theorem codisjoint_assoc {α : Type u} [semilattice_sup α] [order_top α] {a b c : α} :
codisjoint (a ⊔ b) c ↔ codisjoint a (b ⊔ c)
source
theorem codisjoint_left_comm {α : Type u} [semilattice_sup α] [order_top α] {a b c : α} :
codisjoint a (b ⊔ c) ↔ codisjoint b (a ⊔ c)
source
theorem codisjoint_right_comm {α : Type u} [semilattice_sup α] [order_top α] {a b c : α} :
codisjoint (a ⊔ b) c ↔ codisjoint (a ⊔ c) b
source
@[simp]
theorem codisjoint_top_left {α : Type u} [semilattice_sup α] [order_top α] {a : α} :
codisjoint ⊤ a
source
@[simp]
theorem codisjoint_top_right {α : Type u} [semilattice_sup α] [order_top α] {a : α} :
codisjoint a ⊤
source
theorem codisjoint.mono {α : Type u} [semilattice_sup α] [order_top α] {a b c d : α} (h₁ : a ≤ b) (h₂ : c ≤ d) :
codisjoint a c → codisjoint b d
source
theorem codisjoint.mono_left {α : Type u} [semilattice_sup α] [order_top α] {a b c : α} (h : a ≤ b) :
codisjoint a c → codisjoint b c
source
theorem codisjoint.mono_right {α : Type u} [semilattice_sup α] [order_top α] {a b c : α} :
b ≤ c → codisjoint a b → codisjoint a c
source
theorem codisjoint.sup_left {α : Type u} [semilattice_sup α] [order_top α] {a b : α} (c : α) (h : codisjoint a b) :
codisjoint (a ⊔ c) b
source
theorem codisjoint.sup_left' {α : Type u} [semilattice_sup α] [order_top α] {a b : α} (c : α) (h : codisjoint a b) :
codisjoint (c ⊔ a) b
source
theorem codisjoint.sup_right {α : Type u} [semilattice_sup α] [order_top α] {a b : α} (c : α) (h : codisjoint a b) :
codisjoint a (b ⊔ c)
source
theorem codisjoint.sup_right' {α : Type u} [semilattice_sup α] [order_top α] {a b : α} (c : α) (h : codisjoint a b) :
codisjoint a (c ⊔ b)
source
@[simp]
theorem codisjoint_self {α : Type u} [semilattice_sup α] [order_top α] {a : α} :
codisjoint a a ↔ a = ⊤
source
theorem codisjoint.eq_top_of_self {α : Type u} [semilattice_sup α] [order_top α] {a : α} :
codisjoint a a → a = ⊤

Alias of the forward direction of codisjoint_self.

source
theorem codisjoint.ne {α : Type u} [semilattice_sup α] [order_top α] {a b : α} (ha : a ≠ ⊤) (hab : codisjoint a b) :
a ≠ b
source
theorem codisjoint.eq_top_of_ge {α : Type u} [semilattice_sup α] [order_top α] {a b : α} (hab : codisjoint a b) (h : b ≤ a) :
a = ⊤
source
theorem codisjoint.eq_top_of_le {α : Type u} [semilattice_sup α] [order_top α] {a b : α} (hab : codisjoint a b) :
a ≤ b → b = ⊤
source
theorem codisjoint.of_codisjoint_sup_of_le {α : Type u} [semilattice_sup α] [order_top α] {a b c : α} (h : codisjoint (a ⊔ b) c) (hle : c ≤ a) :
codisjoint a b
source
theorem codisjoint.of_codisjoint_sup_of_le' {α : Type u} [semilattice_sup α] [order_top α] {a b c : α} (h : codisjoint (a ⊔ b) c) (hle : c ≤ b) :
codisjoint a b
source
@[simp]
theorem codisjoint_bot {α : Type u} [lattice α] [bounded_order α] {a : α} :
codisjoint a ⊥ ↔ a = ⊤
source
@[simp]
theorem bot_codisjoint {α : Type u} [lattice α] [bounded_order α] {a : α} :
codisjoint ⊥ a ↔ a = ⊤
source
@[simp]
theorem codisjoint_inf_left {α : Type u} [distrib_lattice α] [order_top α] {a b c : α} :
codisjoint (a ⊓ b) c ↔ codisjoint a c ∧ codisjoint b c
source
@[simp]
theorem codisjoint_inf_right {α : Type u} [distrib_lattice α] [order_top α] {a b c : α} :
codisjoint a (b ⊓ c) ↔ codisjoint a b ∧ codisjoint a c
source
theorem codisjoint.inf_left {α : Type u} [distrib_lattice α] [order_top α] {a b c : α} (ha : codisjoint a c) (hb : codisjoint b c) :
codisjoint (a ⊓ b) c
source
theorem codisjoint.inf_right {α : Type u} [distrib_lattice α] [order_top α] {a b c : α} (hb : codisjoint a b) (hc : codisjoint a c) :
codisjoint a (b ⊓ c)
source
theorem codisjoint.left_le_of_le_inf_right {α : Type u} [distrib_lattice α] [order_top α] {a b c : α} (h : a ⊓ b ≤ c) (hd : codisjoint b c) :
a ≤ c
source
theorem codisjoint.left_le_of_le_inf_left {α : Type u} [distrib_lattice α] [order_top α] {a b c : α} (h : b ⊓ a ≤ c) (hd : codisjoint b c) :
a ≤ c
source
theorem disjoint.dual {α : Type u} [semilattice_inf α] [order_bot α] {a b : α} :
disjoint a b → codisjoint (⇑order_dual.to_dual a) (⇑order_dual.to_dual b)
source
theorem codisjoint.dual {α : Type u} [semilattice_sup α] [order_top α] {a b : α} :
codisjoint a b → disjoint (⇑order_dual.to_dual a) (⇑order_dual.to_dual b)
source
@[simp]
theorem disjoint_to_dual_iff {α : Type u} [semilattice_sup α] [order_top α] {a b : α} :
disjoint (⇑order_dual.to_dual a) (⇑order_dual.to_dual b) ↔ codisjoint a b
source
@[simp]
theorem disjoint_of_dual_iff {α : Type u} [semilattice_inf α] [order_bot α] {a b : αᵒᵈ} :
disjoint (⇑order_dual.of_dual a) (⇑order_dual.of_dual b) ↔ codisjoint a b
source
@[simp]
theorem codisjoint_to_dual_iff {α : Type u} [semilattice_inf α] [order_bot α] {a b : α} :
codisjoint (⇑order_dual.to_dual a) (⇑order_dual.to_dual b) ↔ disjoint a b
source
@[simp]
theorem codisjoint_of_dual_iff {α : Type u} [semilattice_sup α] [order_top α] {a b : αᵒᵈ} :
codisjoint (⇑order_dual.of_dual a) (⇑order_dual.of_dual b) ↔ disjoint a b
source
theorem disjoint.le_of_codisjoint {α : Type u} [distrib_lattice α] [bounded_order α] {a b c : α} (hab : disjoint a b) (hbc : codisjoint b c) :
a ≤ c
source
structure is_compl {α : Type u} [lattice α] [bounded_order α] (x y : α) :
Prop

Two elements x and y are complements of each other if x ⊔ y = ⊤ and x ⊓ y = ⊥.

source
@[protected, symm]
theorem is_compl.symm {α : Type u} [lattice α] [bounded_order α] {x y : α} (h : is_compl x y) :
is_compl y x
source
theorem is_compl.of_eq {α : Type u} [lattice α] [bounded_order α] {x y : α} (h₁ : x ⊓ y = ⊥) (h₂ : x ⊔ y = ⊤) :
is_compl x y
source
theorem is_compl.inf_eq_bot {α : Type u} [lattice α] [bounded_order α] {x y : α} (h : is_compl x y) :
x ⊓ y = ⊥
source
theorem is_compl.sup_eq_top {α : Type u} [lattice α] [bounded_order α] {x y : α} (h : is_compl x y) :
x ⊔ y = ⊤
source
theorem is_compl.dual {α : Type u} [lattice α] [bounded_order α] {x y : α} (h : is_compl x y) :
is_compl (⇑order_dual.to_dual x) (⇑order_dual.to_dual y)
source
theorem is_compl.of_dual {α : Type u} [lattice α] [bounded_order α] {a b : αᵒᵈ} (h : is_compl a b) :
is_compl (⇑order_dual.of_dual a) (⇑order_dual.of_dual b)
source
theorem is_compl.inf_left_le_of_le_sup_right {α : Type u} [distrib_lattice α] [bounded_order α] {a b x y : α} (h : is_compl x y) (hle : a ≤ b ⊔ y) :
a ⊓ x ≤ b
source
theorem is_compl.le_sup_right_iff_inf_left_le {α : Type u} [distrib_lattice α] [bounded_order α] {x y a b : α} (h : is_compl x y) :
a ≤ b ⊔ y ↔ a ⊓ x ≤ b
source
theorem is_compl.inf_left_eq_bot_iff {α : Type u} [distrib_lattice α] [bounded_order α] {x y z : α} (h : is_compl y z) :
x ⊓ y = ⊥ ↔ x ≤ z
source
theorem is_compl.inf_right_eq_bot_iff {α : Type u} [distrib_lattice α] [bounded_order α] {x y z : α} (h : is_compl y z) :
x ⊓ z = ⊥ ↔ x ≤ y
source
theorem is_compl.disjoint_left_iff {α : Type u} [distrib_lattice α] [bounded_order α] {x y z : α} (h : is_compl y z) :
disjoint x y ↔ x ≤ z
source
theorem is_compl.disjoint_right_iff {α : Type u} [distrib_lattice α] [bounded_order α] {x y z : α} (h : is_compl y z) :
disjoint x z ↔ x ≤ y
source
theorem is_compl.le_left_iff {α : Type u} [distrib_lattice α] [bounded_order α] {x y z : α} (h : is_compl x y) :
z ≤ x ↔ disjoint z y
source
theorem is_compl.le_right_iff {α : Type u} [distrib_lattice α] [bounded_order α] {x y z : α} (h : is_compl x y) :
z ≤ y ↔ disjoint z x
source
theorem is_compl.left_le_iff {α : Type u} [distrib_lattice α] [bounded_order α] {x y z : α} (h : is_compl x y) :
x ≤ z ↔ ⊤ ≤ z ⊔ y
source
theorem is_compl.right_le_iff {α : Type u} [distrib_lattice α] [bounded_order α] {x y z : α} (h : is_compl x y) :
y ≤ z ↔ ⊤ ≤ z ⊔ x
source
@[protected]
theorem is_compl.antitone {α : Type u} [distrib_lattice α] [bounded_order α] {x y x' y' : α} (h : is_compl x y) (h' : is_compl x' y') (hx : x ≤ x') :
y' ≤ y
source
theorem is_compl.right_unique {α : Type u} [distrib_lattice α] [bounded_order α] {x y z : α} (hxy : is_compl x y) (hxz : is_compl x z) :
y = z
source
theorem is_compl.left_unique {α : Type u} [distrib_lattice α] [bounded_order α] {x y z : α} (hxz : is_compl x z) (hyz : is_compl y z) :
x = y
source
theorem is_compl.sup_inf {α : Type u} [distrib_lattice α] [bounded_order α] {x y x' y' : α} (h : is_compl x y) (h' : is_compl x' y') :
is_compl (x ⊔ x') (y ⊓ y')
source
theorem is_compl.inf_sup {α : Type u} [distrib_lattice α] [bounded_order α] {x y x' y' : α} (h : is_compl x y) (h' : is_compl x' y') :
is_compl (x ⊓ x') (y ⊔ y')
source
@[simp]
theorem is_compl_to_dual_iff {α : Type u} [lattice α] [bounded_order α] {a b : α} :
is_compl (⇑order_dual.to_dual a) (⇑order_dual.to_dual b) ↔ is_compl a b
source
@[simp]
theorem is_compl_of_dual_iff {α : Type u} [lattice α] [bounded_order α] {a b : αᵒᵈ} :
is_compl (⇑order_dual.of_dual a) (⇑order_dual.of_dual b) ↔ is_compl a b
source
theorem is_compl_bot_top {α : Type u} [lattice α] [bounded_order α] :
is_compl ⊥ ⊤
source
theorem is_compl_top_bot {α : Type u} [lattice α] [bounded_order α] :
is_compl ⊤ ⊥
source
theorem eq_top_of_is_compl_bot {α : Type u} [lattice α] [bounded_order α] {x : α} (h : is_compl x ⊥) :
x = ⊤
source
theorem eq_top_of_bot_is_compl {α : Type u} [lattice α] [bounded_order α] {x : α} (h : is_compl ⊥ x) :
x = ⊤
source
theorem eq_bot_of_is_compl_top {α : Type u} [lattice α] [bounded_order α] {x : α} (h : is_compl x ⊤) :
x = ⊥
source
theorem eq_bot_of_top_is_compl {α : Type u} [lattice α] [bounded_order α] {x : α} (h : is_compl ⊤ x) :
x = ⊥
source
@[class]
structure complemented_lattice (α : Type u_1) [lattice α] [bounded_order α] :
Prop
  • exists_is_compl : ∀ (a : α), ∃ (b : α), is_compl a b

A complemented bounded lattice is one where every element has a (not necessarily unique) complement.

Instances of this typeclass
source
@[protected, instance]
def complemented_lattice.order_dual.complemented_lattice {α : Type u} [lattice α] [bounded_order α] [complemented_lattice α] :
complemented_lattice αᵒᵈ
source
theorem bot_ne_top {α : Type u} [partial_order α] [bounded_order α] [nontrivial α] :
⊥ ≠ ⊤
source
theorem top_ne_bot {α : Type u} [partial_order α] [bounded_order α] [nontrivial α] :
⊤ ≠ ⊥
source
theorem bot_lt_top {α : Type u} [partial_order α] [bounded_order α] [nontrivial α] :
⊥ < ⊤
source
@[protected, instance]
def bool.bounded_order  :
bounded_order bool
Equations
source
@[simp]
theorem top_eq_tt  :
⊤ = bool.tt
source
@[simp]
theorem bot_eq_ff  :
⊥ = bool.ff