Theorems · Definition · order theory
LowerAdjoint.closed
{α : Type u_1} → {β : Type u_4} → [inst : Preorder α] → [inst_1 : Preorder β] → {u : β → α} → LowerAdjoint u → Set αAn element x is closed for l : LowerAdjoint u if it is a fixed point: u (l x) = x
- Defined in
- Mathlib.Order.Closure
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Preorderstatement and proof · cited by 7,952
- Set.ofPredproof · cited by 6,101
- LowerAdjoint.toFunproof · cited by 105
- LowerAdjointstatement and proof · cited by 38
Cited by10
Results whose statement or proof uses this declaration.
- LowerAdjoint.closure_eq_self_of_mem_closedstatement and proof · cited by 2
- FirstOrder.Language.Substructure.mem_closed_of_isRelationalstatement · cited by 2
- FirstOrder.Language.Substructure.closedstatement · cited by 1
- LowerAdjoint.closure_le_closed_iff_lestatement and proof · cited by 1
- FirstOrder.Language.Substructure.mem_closed_iffstatement and proof · cited by 1
- LowerAdjoint.mem_closed_iffstatement · cited by 0
- LowerAdjoint.mem_closed_iff_closure_lestatement · cited by 0
- LowerAdjoint.closure_is_closedstatement · cited by 0
- LowerAdjoint.toClosedstatement · cited by 0
- LowerAdjoint.closed_eq_range_closestatement · cited by 0