Theorems · Theorem · order theory
RelIso.trans_apply
∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} {r : α → α → Prop} {s : β → β → Prop} {t : γ → γ → Prop} (f₁ : r ≃r s)
(f₂ : s ≃r t) (a : α), (f₁.trans f₂) a = f₂ (f₁ a)- Defined in
- Mathlib.Order.RelIso.Basic
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 24 from the axioms · uses Quot.sound
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
- RelIsostatement and proof · cited by 456
- RelIso.transstatement and proof · cited by 18
Cited by4
Results whose statement or proof uses this declaration.
- RelIso.self_trans_symmproof · cited by 1
- RelIso.symm_trans_selfproof · cited by 1
- SimpleGraph.Iso.sumComm_comp_sumCongrproof · cited by 0
- SimpleGraph.Iso.sumAssoc_comp_sumCongrproof · cited by 0