Theorem cnvtrrel 40008

Description: The converse of a transitive relation is a transitive relation. (Contributed by RP, 25-Dec-2019.)

Assertion

Ref	Expression
cnvtrrel	⊢ ((𝑆 ∘ 𝑆) ⊆ 𝑆 ↔ (◡𝑆 ∘ ◡𝑆) ⊆ ◡𝑆)

Proof of Theorem cnvtrrel

Step	Hyp	Ref	Expression
1		cnvss 5737	. . 3 ⊢ ((𝑆 ∘ 𝑆) ⊆ 𝑆 → ◡(𝑆 ∘ 𝑆) ⊆ ◡𝑆)
2		cnvss 5737	. . . 4 ⊢ (◡(𝑆 ∘ 𝑆) ⊆ ◡𝑆 → ◡◡(𝑆 ∘ 𝑆) ⊆ ◡◡𝑆)
3		cnvco 5750	. . . . . . . . 9 ⊢ ◡(𝑆 ∘ 𝑆) = (◡𝑆 ∘ ◡𝑆)
4	3	cnveqi 5739	. . . . . . . 8 ⊢ ◡◡(𝑆 ∘ 𝑆) = ◡(◡𝑆 ∘ ◡𝑆)
5		cnvco 5750	. . . . . . . 8 ⊢ ◡(◡𝑆 ∘ ◡𝑆) = (◡◡𝑆 ∘ ◡◡𝑆)
6		cocnvcnv1 6104	. . . . . . . . 9 ⊢ (◡◡𝑆 ∘ ◡◡𝑆) = (𝑆 ∘ ◡◡𝑆)
7		cocnvcnv2 6105	. . . . . . . . 9 ⊢ (𝑆 ∘ ◡◡𝑆) = (𝑆 ∘ 𝑆)
8	6, 7	eqtri 2844	. . . . . . . 8 ⊢ (◡◡𝑆 ∘ ◡◡𝑆) = (𝑆 ∘ 𝑆)
9	4, 5, 8	3eqtri 2848	. . . . . . 7 ⊢ ◡◡(𝑆 ∘ 𝑆) = (𝑆 ∘ 𝑆)
10	9	sseq1i 3994	. . . . . 6 ⊢ (◡◡(𝑆 ∘ 𝑆) ⊆ ◡◡𝑆 ↔ (𝑆 ∘ 𝑆) ⊆ ◡◡𝑆)
11	10	biimpi 218	. . . . 5 ⊢ (◡◡(𝑆 ∘ 𝑆) ⊆ ◡◡𝑆 → (𝑆 ∘ 𝑆) ⊆ ◡◡𝑆)
12		cnvcnvss 6045	. . . . 5 ⊢ ◡◡𝑆 ⊆ 𝑆
13	11, 12	sstrdi 3978	. . . 4 ⊢ (◡◡(𝑆 ∘ 𝑆) ⊆ ◡◡𝑆 → (𝑆 ∘ 𝑆) ⊆ 𝑆)
14	2, 13	syl 17	. . 3 ⊢ (◡(𝑆 ∘ 𝑆) ⊆ ◡𝑆 → (𝑆 ∘ 𝑆) ⊆ 𝑆)
15	1, 14	impbii 211	. 2 ⊢ ((𝑆 ∘ 𝑆) ⊆ 𝑆 ↔ ◡(𝑆 ∘ 𝑆) ⊆ ◡𝑆)
16	3	sseq1i 3994	. 2 ⊢ (◡(𝑆 ∘ 𝑆) ⊆ ◡𝑆 ↔ (◡𝑆 ∘ ◡𝑆) ⊆ ◡𝑆)
17	15, 16	bitri 277	1 ⊢ ((𝑆 ∘ 𝑆) ⊆ 𝑆 ↔ (◡𝑆 ∘ ◡𝑆) ⊆ ◡𝑆)

Syntax hints:   ↔ wb 208   ⊆ wss 3935  ^◡ccnv 5548   ∘ ccom 5553

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pr 5321

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-br 5059  df-opab 5121  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561

This theorem is referenced by: (None)