Totally_Ordered_Set_is_Lattice
Provedlattice-theoryproofwikitotal-orderings
Every totally ordered set is a lattice: any two elements have a least upper bound.
Preamble
import Mathlib.Order.Lattice
Formal statement
theorem Totally_Ordered_Set_is_Lattice {α : Type _} [LinearOrder α] (a b : α) : ∃ c : α, a ≤ c ∧ b ≤ c ∧ ∀ d, a ≤ d → b ≤ d → c ≤ d := by sorrySource