Documentation

Mathlib.Data.Set.Intervals.Infinite

Infinitude of intervals #

Bounded intervals in dense orders are infinite, as are unbounded intervals in orders that are unbounded on the appropriate side. We also prove that an unbounded preorder is an infinite type.

theorem NoMaxOrder.infinite {α : Type u_1} [Preorder α] [Nonempty α] [NoMaxOrder α] :

A nonempty preorder with no maximal element is infinite. This is not an instance to avoid a cycle with Infinite α → Nontrivial α → Nonempty α.

theorem NoMinOrder.infinite {α : Type u_1} [Preorder α] [Nonempty α] [NoMinOrder α] :

A nonempty preorder with no minimal element is infinite. This is not an instance to avoid a cycle with Infinite α → Nontrivial α → Nonempty α.

theorem Set.Ioo.infinite {α : Type u_1} [Preorder α] [DenselyOrdered α] {a : α} {b : α} (h : a < b) :
Infinite ↑(Set.Ioo a b)
theorem Set.Ioo_infinite {α : Type u_1} [Preorder α] [DenselyOrdered α] {a : α} {b : α} (h : a < b) :
theorem Set.Ico_infinite {α : Type u_1} [Preorder α] [DenselyOrdered α] {a : α} {b : α} (h : a < b) :
theorem Set.Ico.infinite {α : Type u_1} [Preorder α] [DenselyOrdered α] {a : α} {b : α} (h : a < b) :
Infinite ↑(Set.Ico a b)
theorem Set.Ioc_infinite {α : Type u_1} [Preorder α] [DenselyOrdered α] {a : α} {b : α} (h : a < b) :
theorem Set.Ioc.infinite {α : Type u_1} [Preorder α] [DenselyOrdered α] {a : α} {b : α} (h : a < b) :
Infinite ↑(Set.Ioc a b)
theorem Set.Icc_infinite {α : Type u_1} [Preorder α] [DenselyOrdered α] {a : α} {b : α} (h : a < b) :
theorem Set.Icc.infinite {α : Type u_1} [Preorder α] [DenselyOrdered α] {a : α} {b : α} (h : a < b) :
Infinite ↑(Set.Icc a b)
theorem Set.Iio_infinite {α : Type u_1} [Preorder α] [NoMinOrder α] (a : α) :
theorem Set.Iic_infinite {α : Type u_1} [Preorder α] [NoMinOrder α] (a : α) :
theorem Set.Ioi_infinite {α : Type u_1} [Preorder α] [NoMaxOrder α] (a : α) :
theorem Set.Ici_infinite {α : Type u_1} [Preorder α] [NoMaxOrder α] (a : α) :