Theorems · Theorem · order theory
isOrderRightAdjoint_sSup
∀ {α : Type u_1} {β : Type u_2} [inst : CompleteSemilatticeSup α] [inst_1 : Preorder β] (f : α → β),
IsOrderRightAdjoint f fun y => sSup {x | f x ≤ y}- Defined in
- Mathlib.Order.SemiconjSup
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 9 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- Set.ofPredstatement and proof · cited by 6,101
- SupSet.sSupstatement · cited by 954
- isLUB_sSupproof · cited by 21
- CompleteSemilatticeSupstatement and proof · cited by 18
- IsOrderRightAdjointstatement · cited by 7
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.