Theorems · Definition · order theory
LowerAdjoint.toFun
{α : Type u_1} → {β : Type u_4} → [inst : Preorder α] → [inst_1 : Preorder β] → {u : β → α} → LowerAdjoint u → α → βThe underlying function
- Defined in
- Mathlib.Order.Closure
- Cited by
- 105 results in Mathlib
- Foundations
- Depth 2 from the axioms, rests on 3 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
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
- LowerAdjointstatement and proof · cited by 38
Cited by112
Results whose statement or proof uses this declaration.
- FirstOrder.Language.Substructure.FGproof · cited by 34
- FirstOrder.Language.Substructure.CGproof · cited by 18
- LowerAdjoint.closureOperatorproof · cited by 12
- FirstOrder.Language.Substructure.subset_closurestatement · cited by 12
- LowerAdjoint.closedproof · cited by 9
- FirstOrder.Language.Substructure.closure_eqstatement · cited by 7
- FirstOrder.Language.Substructure.closure_lestatement · cited by 7
- FirstOrder.Language.Substructure.fg_defstatement and proof · cited by 6
- FirstOrder.Language.Substructure.cg_defstatement · cited by 5
- FirstOrder.Language.Substructure.closure_eq_of_lestatement and proof · cited by 5
- FirstOrder.Language.Substructure.FG.supproof · cited by 5
- FirstOrder.Language.Substructure.closure_imagestatement · cited by 4