Theorem relcnvtrgOLD 6268

Description: Obsolete form of relcnvtrg 6267 as of 8-Aug-2026. (Contributed by Peter Mazsa, 17-Oct-2023.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
relcnvtrgOLD	⊢ ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → ((𝑅 ∘ 𝑆) ⊆ 𝑇 ↔ (◡𝑆 ∘ ◡𝑅) ⊆ ◡𝑇))

Proof of Theorem relcnvtrgOLD

Step	Hyp	Ref	Expression
1		cnvco 5874	. . 3 ⊢ ◡(𝑅 ∘ 𝑆) = (◡𝑆 ∘ ◡𝑅)
2		cnvss 5857	. . 3 ⊢ ((𝑅 ∘ 𝑆) ⊆ 𝑇 → ◡(𝑅 ∘ 𝑆) ⊆ ◡𝑇)
3	1, 2	eqsstrrid 3975	. 2 ⊢ ((𝑅 ∘ 𝑆) ⊆ 𝑇 → (◡𝑆 ∘ ◡𝑅) ⊆ ◡𝑇)
4		cnvco 5874	. . . 4 ⊢ ◡(◡𝑆 ∘ ◡𝑅) = (◡◡𝑅 ∘ ◡◡𝑆)
5		cnvss 5857	. . . 4 ⊢ ((◡𝑆 ∘ ◡𝑅) ⊆ ◡𝑇 → ◡(◡𝑆 ∘ ◡𝑅) ⊆ ◡◡𝑇)
6		sseq1 3961	. . . . 5 ⊢ (◡(◡𝑆 ∘ ◡𝑅) = (◡◡𝑅 ∘ ◡◡𝑆) → (◡(◡𝑆 ∘ ◡𝑅) ⊆ ◡◡𝑇 ↔ (◡◡𝑅 ∘ ◡◡𝑆) ⊆ ◡◡𝑇))
7		dfrel2 6186	. . . . . . . . . 10 ⊢ (Rel 𝑅 ↔ ◡◡𝑅 = 𝑅)
8	7	biimpi 219	. . . . . . . . 9 ⊢ (Rel 𝑅 → ◡◡𝑅 = 𝑅)
9	8	3ad2ant1 1150	. . . . . . . 8 ⊢ ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → ◡◡𝑅 = 𝑅)
10		dfrel2 6186	. . . . . . . . . 10 ⊢ (Rel 𝑆 ↔ ◡◡𝑆 = 𝑆)
11	10	biimpi 219	. . . . . . . . 9 ⊢ (Rel 𝑆 → ◡◡𝑆 = 𝑆)
12	11	3ad2ant2 1151	. . . . . . . 8 ⊢ ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → ◡◡𝑆 = 𝑆)
13	9, 12	coeq12d 5849	. . . . . . 7 ⊢ ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → (◡◡𝑅 ∘ ◡◡𝑆) = (𝑅 ∘ 𝑆))
14		dfrel2 6186	. . . . . . . . 9 ⊢ (Rel 𝑇 ↔ ◡◡𝑇 = 𝑇)
15	14	biimpi 219	. . . . . . . 8 ⊢ (Rel 𝑇 → ◡◡𝑇 = 𝑇)
16	15	3ad2ant3 1152	. . . . . . 7 ⊢ ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → ◡◡𝑇 = 𝑇)
17	13, 16	sseq12d 3969	. . . . . 6 ⊢ ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → ((◡◡𝑅 ∘ ◡◡𝑆) ⊆ ◡◡𝑇 ↔ (𝑅 ∘ 𝑆) ⊆ 𝑇))
18	17	biimpcd 252	. . . . 5 ⊢ ((◡◡𝑅 ∘ ◡◡𝑆) ⊆ ◡◡𝑇 → ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → (𝑅 ∘ 𝑆) ⊆ 𝑇))
19	6, 18	biimtrdi 256	. . . 4 ⊢ (◡(◡𝑆 ∘ ◡𝑅) = (◡◡𝑅 ∘ ◡◡𝑆) → (◡(◡𝑆 ∘ ◡𝑅) ⊆ ◡◡𝑇 → ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → (𝑅 ∘ 𝑆) ⊆ 𝑇)))
20	4, 5, 19	mpsyl 69	. . 3 ⊢ ((◡𝑆 ∘ ◡𝑅) ⊆ ◡𝑇 → ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → (𝑅 ∘ 𝑆) ⊆ 𝑇))
21	20	com12 33	. 2 ⊢ ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → ((◡𝑆 ∘ ◡𝑅) ⊆ ◡𝑇 → (𝑅 ∘ 𝑆) ⊆ 𝑇))
22	3, 21	impbid2 229	1 ⊢ ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → ((𝑅 ∘ 𝑆) ⊆ 𝑇 ↔ (◡𝑆 ∘ ◡𝑅) ⊆ ◡𝑇))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1102   = wceq 1569   ⊆ wss 3904  ^◡ccnv 5659   ∘ ccom 5664  Rel wrel 5665

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669

This theorem is used by:  relcnvtrOLD  6269