Theorems · Inductive type · order theory
Set.OrdConnected
{α : Type u_1} → [Preorder α] → Set α → PropWe say that a set s : Set α is OrdConnected if for all x y ∈ s it includes the
interval [[x, y]]. If α is a DenselyOrdered ConditionallyCompleteLinearOrder with
the OrderTopology, then this condition is equivalent to IsPreconnected s. If α is a
linearly ordered field, then this condition is also equivalent to Convex α s.
- Defined in
- Mathlib.Order.Interval.Set.Defs
- Cited by
- 161 results in Mathlib
- Foundations
- Depth 1 from the axioms, rests on 3 definitions · uses no axioms
- Assumes
- Preorder
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.
Cited by163
Results whose statement or proof uses this declaration.
- Set.OrdConnected.outstatement and proof · cited by 47
- Convex.ordConnectedstatement · cited by 19
- StrictMono.isEmbedding_of_ordConnectedstatement and proof · cited by 9
- Set.OrdConnected.isPreconnectedstatement and proof · cited by 9
- Set.OrdConnected.strictConvexstatement and proof · cited by 9
- Set.OrdConnected.apply_covBy_apply_iffstatement and proof · cited by 8
- Set.OrdConnected.out'statement and proof · cited by 8
- Set.OrdConnected.image_hasDerivWithinAtstatement and proof · cited by 6
- Set.OrdConnected.uIcc_subsetstatement and proof · cited by 6
- Set.image_subtype_val_Iocstatement and proof · cited by 5
- Set.OrdConnected.apply_wcovBy_apply_iffstatement and proof · cited by 5
- Set.OrdConnected.upperClosure_inter_lowerClosurestatement and proof · cited by 5