Theorems · Inductive type · order theory
ConditionallyCompletePartialOrderInf
Type u_3 → Type u_3
Conditionally complete partial orders (with infima) are partial orders where every nonempty, directed set which is bounded below has a greatest lower bound.
- Cited by
- 51 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 by57
Results whose statement or proof uses this declaration.
- ciInf_conststatement and proof · cited by 20
- IsLeast.csInf_eqstatement and proof · cited by 11
- ciInf_uniquestatement and proof · cited by 9
- DirectedOn.csInf_lestatement and proof · cited by 9
- tendsto_atTop_ciInfstatement and proof · cited by 8
- DirectedOn.isGLB_csInfstatement and proof · cited by 8
- csInf_singletonstatement and proof · cited by 6
- csInf_Icistatement and proof · cited by 5
- ciInf_posstatement and proof · cited by 4
- DirectedOn.le_csInfstatement and proof · cited by 4
- Directed.ciInf_lestatement and proof · cited by 3
- csInf_Iccstatement and proof · cited by 2