Theorems · Definition · order theory
RightOrdContinuous
{α : Type u} → {β : Type v} → [Preorder α] → [Preorder β] → (α → β) → PropA function f between preorders is right order continuous if it preserves all infima of
nonempty sets. We define it using IsGLB instead of sInf so that the proof works both for
complete lattices and conditionally complete lattices.
- Defined in
- Mathlib.Order.OrdContinuous
- Cited by
- 24 results in Mathlib
- Foundations
- Depth 7 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- Preorderstatement and proof · cited by 7,952
- Set.imageproof · cited by 5,609
- Set.Nonemptyproof · cited by 2,627
- IsGLBproof · cited by 213
Cited by25
Results whose statement or proof uses this declaration.
- RightOrdContinuous.dualstatement · cited by 2
- RightOrdContinuous.map_sInf'statement and proof · cited by 2
- RightOrdContinuous.continuousWithinAt_Icistatement and proof · cited by 1
- RightOrdContinuous.le_iffstatement and proof · cited by 1
- RightOrdContinuous.map_csInfstatement and proof · cited by 1
- RightOrdContinuous.map_infstatement and proof · cited by 1
- RightOrdContinuous.map_isLeaststatement and proof · cited by 1
- RightOrdContinuous.toOrderEmbeddingstatement and proof · cited by 1
- GaloisConnection.rightOrdContinuousstatement · cited by 1
- Monotone.rightOrdContinuousstatement · cited by 1
- LeftOrdContinuous.dualstatement · cited by 1
- Continuous.of_ordContinuousstatement and proof · cited by 0