Theorems · Theorem · order theory
RelHom.comp_apply
∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} {r : α → α → Prop} {s : β → β → Prop} {t : γ → γ → Prop} (g : s →r t)
(f : r →r s) (x : α), (g.comp f) x = g (f x)- Defined in
- Mathlib.Order.RelIso.Basic
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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
- RelHomstatement and proof · cited by 49
- RelHom.compstatement and proof · cited by 7
Cited by6
Results whose statement or proof uses this declaration.
- SimpleGraph.Copy.comp_applyproof · cited by 2
- SimpleGraph.Iso.symm_toHom_comp_toHomproof · cited by 1
- SimpleGraph.Subgraph.map_compproof · cited by 1
- SimpleGraph.Hom.sum_comp_sumCommproof · cited by 0
- SimpleGraph.Hom.sum_sum_comp_sumAssocproof · cited by 0
- SimpleGraph.Iso.toHom_comp_symm_toHomproof · cited by 0