Theorems · Inductive type · order theory
Order.Cofinal
(P : Type u_2) → [Preorder P] → Type u_2
For a preorder P, Cofinal P is the type of subsets of P
containing arbitrarily large elements. They are the dense sets in
the topology whose open sets are terminal segments.
- Defined in
- Mathlib.Order.Ideal
- Cited by
- 13 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
- Assumes
- Preorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement · cited by 7,952
Cited by29
Results whose statement or proof uses this declaration.
- Order.sequenceOfCofinalsstatement and proof · cited by 5
- Order.idealOfCofinalsstatement and proof · cited by 4
- Order.sequenceOfCofinals.encode_memstatement and proof · cited by 3
- Order.Cofinal.abovestatement and proof · cited by 3
- Order.sequenceOfCofinals.monotonestatement and proof · cited by 2
- Order.PartialIso.definedAtLeftstatement · cited by 2
- Order.PartialIso.funOfIdealstatement · cited by 2
- FirstOrder.Language.IsExtensionPair.definedAtLeftstatement · cited by 2
- Order.Cofinal.isCofinalstatement and proof · cited by 2
- FirstOrder.Language.equiv_between_cgproof · cited by 2
- Order.cofinal_meets_idealOfCofinalsstatement and proof · cited by 2
- Order.PartialIso.definedAtRightstatement · cited by 1