Theorems · Definition · order theory
Order.sequenceOfCofinals
{P : Type u_1} → [inst : Preorder P] → P → {ι : Type u_2} → [Encodable ι] → (ι → Order.Cofinal P) → ℕ → PGiven a starting point, and a countable family of cofinal sets, this is an increasing sequence that intersects each cofinal set.
- Defined in
- Mathlib.Order.Ideal
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses Classical.choice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement and proof · cited by 7,952
- Encodablestatement and proof · cited by 140
- Order.Cofinalstatement and proof · cited by 13
Cited by6
Results whose statement or proof uses this declaration.
- Order.idealOfCofinalsproof · cited by 4
- Order.sequenceOfCofinals.encode_memstatement and proof · cited by 3
- FirstOrder.Language.equiv_between_cgproof · cited by 2
- Order.cofinal_meets_idealOfCofinalsproof · cited by 2
- Order.sequenceOfCofinals.monotonestatement and proof · cited by 2
- FirstOrder.Language.embedding_from_cgproof · cited by 0