Theorems · Definition · order theory
Interval
(α : Type u_6) → [LE α] → Type u_6
The closed intervals in an order.
We represent intervals either as ⊥ or a nonempty interval given by its endpoints fst, snd.
To convert intervals to the set of elements between these endpoints, use the coercion
Interval α → Set α.
- Defined in
- Mathlib.Order.Interval.Basic
- Cited by
- 76 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
- Assumes
- LE
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- WithBotproof · cited by 1,498
- NonemptyIntervalproof · cited by 139
Cited by83
Results whose statement or proof uses this declaration.
- Interval.coestatement · cited by 28
- Interval.purestatement · cited by 15
- Interval.lengthstatement and proof · cited by 8
- Interval.dualstatement · cited by 5
- Interval.mapstatement · cited by 4
- Interval.recBotCoestatement and proof · cited by 4
- Interval.add_botstatement and proof · cited by 3
- Interval.bot_ne_purestatement · cited by 3
- Interval.bot_addstatement and proof · cited by 2
- Interval.coeHomstatement and proof · cited by 2
- Interval.coe_injstatement · cited by 2
- Interval.length_add_lestatement and proof · cited by 2