Theorems · Theorem · order theory
Order.sequenceOfCofinals.encode_mem
∀ {P : Type u_1} [inst : Preorder P] (p : P) {ι : Type u_2} [inst_1 : Encodable ι] (𝒟 : ι → Order.Cofinal P) (i : ι),
Order.sequenceOfCofinals p 𝒟 (Encodable.encode i + 1) ∈ 𝒟 i- Defined in
- Mathlib.Order.Ideal
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses Classical.choice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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
- Encodable.encodestatement and proof · cited by 118
- Encodable.encodekproof · cited by 27
- Order.Cofinalstatement and proof · cited by 13
- Order.sequenceOfCofinalsstatement and proof · cited by 5
- Order.Cofinal.aboveproof · cited by 3
- Order.Cofinal.above_memproof · cited by 1
Cited by3
Results whose statement or proof uses this declaration.
- Order.cofinal_meets_idealOfCofinalsproof · cited by 2
- FirstOrder.Language.equiv_between_cgproof · cited by 2
- FirstOrder.Language.embedding_from_cgproof · cited by 0