Theorems · Theorem · order theory
RelHomClass.map_rel
∀ {F : Type u_5} {α : outParam (Type u_6)} {β : outParam (Type u_7)} {r : outParam (α → α → Prop)}
{s : outParam (β → β → Prop)} {inst : FunLike F α β} [self : RelHomClass F r s] (f : F) {a b : α},
r a b → s (f a) (f b)A RelHomClass sends related elements to related elements
- Defined in
- Mathlib.Order.RelIso.Basic
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 4 from the axioms · uses no axioms
- Assumes
- RelHomClass
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 · cited by 62,936
- FunLikestatement and proof · cited by 2,560
- RelHomClassstatement and proof · cited by 13
Cited by10
Results whose statement or proof uses this declaration.
- OrderHomClass.monoproof · cited by 22
- IsChain.imageproof · cited by 8
- OrderHomClass.monotoneproof · cited by 5
- RelHomClass.accproof · cited by 2
- RelHomClass.asymmproof · cited by 1
- RelHomClass.irreflproof · cited by 1
- RelHomClass.map_infproof · cited by 1
- SimpleGraph.IsVertexCover.preimageproof · cited by 1
- RelHomClass.directedproof · cited by 0
- RelHomClass.directedOnproof · cited by 0