Theorems · Inductive type · order theory
RelHom
{α : Type u_5} → {β : Type u_6} → (α → α → Prop) → (β → β → Prop) → Type (max u_5 u_6)A relation homomorphism with respect to a given pair of relations r and s
is a function f : α → β such that r a b → s (f a) (f b).
- Defined in
- Mathlib.Order.RelIso.Basic
- Cited by
- 49 results in Mathlib
- Foundations
- Depth 0 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by71
Results whose statement or proof uses this declaration.
- SimpleGraph.Homproof · cited by 139
- RelEmbedding.toRelHomstatement · cited by 15
- RelHom.extstatement and proof · cited by 9
- RelHom.compstatement and proof · cited by 7
- RelHom.comp_applystatement and proof · cited by 6
- SimpleGraph.Subgraph.hom_applystatement · cited by 6
- SetRel.Homproof · cited by 4
- RelHom.idstatement · cited by 4
- RelHom.map_relstatement and proof · cited by 4
- RelHom.map_rel'statement and proof · cited by 4
- RelHom.toFunstatement and proof · cited by 4
- RelIso.relHomCongrstatement and proof · cited by 4