Metamath Proof Explorer


Theorem relcnvtrg

Description: Subclass law for converse of a composition. A particular case is ( ( R o. R ) C_ R <-> (`' R o. ``' R ) C_ ``' R ) ` , which says that a relation is transitive iff its converse is transitive. (Contributed by FL, 19-Sep-2011) Generalize to a statement about three classes rather than one. (Revised by Peter Mazsa, 17-Oct-2023) Remove antecedent. (Revised by Eric Schmidt, 8-Aug-2026)

Ref Expression
Assertion relcnvtrg ⊢ R ∘ S ⊆ T ↔ S -1 ∘ R -1 ⊆ T -1

Proof

Step Hyp Ref Expression
1 cnvco ⊢ R ∘ S -1 = S -1 ∘ R -1
2 cnvss ⊢ R ∘ S ⊆ T → R ∘ S -1 ⊆ T -1
3 1 2 eqsstrrid ⊢ R ∘ S ⊆ T → S -1 ∘ R -1 ⊆ T -1
4 cnvco ⊢ S -1 ∘ R -1 -1 = R -1 -1 ∘ S -1 -1
5 cocnvcnv1 ⊢ R -1 -1 ∘ S -1 -1 = R ∘ S -1 -1
6 cocnvcnv2 ⊢ R ∘ S -1 -1 = R ∘ S
7 4 5 6 3eqtri ⊢ S -1 ∘ R -1 -1 = R ∘ S
8 cnvss ⊢ S -1 ∘ R -1 ⊆ T -1 → S -1 ∘ R -1 -1 ⊆ T -1 -1
9 7 8 eqsstrrid ⊢ S -1 ∘ R -1 ⊆ T -1 → R ∘ S ⊆ T -1 -1
10 cnvcnvss ⊢ T -1 -1 ⊆ T
11 9 10 sstrdi ⊢ S -1 ∘ R -1 ⊆ T -1 → R ∘ S ⊆ T
12 3 11 impbii ⊢ R ∘ S ⊆ T ↔ S -1 ∘ R -1 ⊆ T -1