Theorems · Inductive type · order theory
ConditionallyCompletePartialOrder
Type u_3 → Type u_3
Conditionally complete partial orders (with suprema and infima) are partial orders where every nonempty, directed set which is bounded above (respectively, below) has a least upper (respectively, greatest lower) bound.
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 0 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by11
Results whose statement or proof uses this declaration.
- ConditionallyCompletePartialOrder.toInfSetstatement and proof · cited by 1
- Directed.ciInf_le_ciSupstatement and proof · cited by 0
- ConditionallyCompletePartialOrder.mk.noConfusionstatement · cited by 0
- ConditionallyCompletePartialOrder.casesOnstatement and proof · cited by 0
- ConditionallyCompletePartialOrder.ctorIdxstatement and proof · cited by 0
- ConditionallyCompletePartialOrder.isGLB_csInf_of_directedstatement and proof · cited by 0
- ConditionallyCompletePartialOrder.noConfusionstatement and proof · cited by 0
- ConditionallyCompletePartialOrder.noConfusionTypestatement and proof · cited by 0
- DirectedOn.subset_Icc_csInf_csSupstatement and proof · cited by 0
- ConditionallyCompletePartialOrder.recOnstatement and proof · cited by 0
- DirectedOn.csInf_le_csSupstatement and proof · cited by 0