Theorems · Definition · order theory
RelIso.relHomCongr
{α₁ : Type u_5} →
{β₁ : Type u_6} →
{α₂ : Type u_7} →
{β₂ : Type u_8} →
{r₁ : α₁ → α₁ → Prop} →
{s₁ : β₁ → β₁ → Prop} →
{r₂ : α₂ → α₂ → Prop} → {s₂ : β₂ → β₂ → Prop} → r₁ ≃r r₂ → s₁ ≃r s₂ → r₁ →r s₁ ≃ (r₂ →r s₂)Transport a RelHom across a pair of RelIsos, by pre- and post-composition.
This is Equiv.arrowCongr for RelHom.
- Defined in
- Mathlib.Order.RelIso.Basic
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 26 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Equivstatement · cited by 8,337
- RelIsostatement and proof · cited by 456
- RelIso.symmproof · cited by 193
- RelHomstatement and proof · cited by 49
- RelIso.toRelEmbeddingproof · cited by 34
- RelEmbedding.toRelHomproof · cited by 15
- RelHom.compproof · cited by 7
Cited by5
Results whose statement or proof uses this declaration.
- SimpleGraph.Iso.homCongrproof · cited by 0
- RelIso.relHomCongr_applystatement and proof · cited by 0
- RelIso.relHomCongr_apply_applystatement and proof · cited by 0
- RelIso.relHomCongr_symm_applystatement and proof · cited by 0
- RelIso.relHomCongr_symm_apply_applystatement and proof · cited by 0