Theorems · Theorem · order theory
IsOrderRightAdjoint.orderIso_comp
∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} [inst : Preorder α] [inst_1 : Preorder β] [inst_2 : Preorder γ]
{f : α → β} {g : β → α}, IsOrderRightAdjoint f g → ∀ (e : β ≃o γ), IsOrderRightAdjoint (⇑e ∘ f) (g ∘ ⇑e.symm)- Defined in
- Mathlib.Order.SemiconjSup
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 27 from the axioms · uses propext, Quot.sound
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.
- DFunLike.coestatement and proof · cited by 62,936
- Preorderstatement and proof · cited by 7,952
- Set.ofPredproof · cited by 6,101
- OrderIsostatement and proof · cited by 874
- OrderIso.symmstatement and proof · cited by 475
- IsLUBproof · cited by 280
- OrderIso.le_symm_applyproof · cited by 14
- IsOrderRightAdjointstatement and proof · cited by 7
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.