Theorems · Inductive type · order theory
RelEmbedding
{α : Type u_5} → {β : Type u_6} → (α → α → Prop) → (β → β → Prop) → Type (max u_5 u_6)A relation embedding with respect to a given pair of relations r and s
is an embedding f : α ↪ β such that r a b ↔ s (f a) (f b).
- Defined in
- Mathlib.Order.RelIso.Basic
- Cited by
- 281 results in Mathlib
- Foundations
- Depth 0 from the axioms, rests on 1 definitions · 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 by346
Results whose statement or proof uses this declaration.
- OrderEmbeddingproof · cited by 619
- PrincipalSeg.toRelEmbeddingstatement · cited by 129
- RelEmbedding.toEmbeddingstatement and proof · cited by 45
- RelEmbedding.injectivestatement and proof · cited by 41
- SimpleGraph.Embeddingproof · cited by 41
- RelIso.toRelEmbeddingstatement · cited by 34
- RelEmbedding.transstatement and proof · cited by 27
- RelEmbedding.map_rel_iffstatement and proof · cited by 25
- PrincipalSeg.mem_range_of_relstatement · cited by 24
- RelEmbedding.toRelHomstatement and proof · cited by 15
- Ordinal.typein_enumstatement · cited by 13
- Ordinal.typein_lt_typestatement · cited by 13
Showing the 200 most cited of 346.