MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  relcnvtrgOLD Structured version   Visualization version   GIF version

Theorem relcnvtrgOLD 6284
Description: Obsolete form of relcnvtrg 6283 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
StepHypRef Expression
1 cnvco 5873 . . 3 ◡(𝑅 ∘ 𝑆) = (◡𝑆 ∘ ◡𝑅)
2 cnvss 5856 . . 3 ((𝑅 ∘ 𝑆) ⊆ 𝑇 → ◡(𝑅 ∘ 𝑆) ⊆ ◡𝑇)
31, 2eqsstrrid 3952 . 2 ((𝑅 ∘ 𝑆) ⊆ 𝑇 → (◡𝑆 ∘ ◡𝑅) ⊆ ◡𝑇)
4 cnvco 5873 . . . 4 ◡(◡𝑆 ∘ ◡𝑅) = (◡◡𝑅 ∘ ◡◡𝑆)
5 cnvss 5856 . . . 4 ((◡𝑆 ∘ ◡𝑅) ⊆ ◡𝑇 → ◡(◡𝑆 ∘ ◡𝑅) ⊆ ◡◡𝑇)
6 sseq1 3938 . . . . 5 (◡(◡𝑆 ∘ ◡𝑅) = (◡◡𝑅 ∘ ◡◡𝑆) → (◡(◡𝑆 ∘ ◡𝑅) ⊆ ◡◡𝑇 ↔ (◡◡𝑅 ∘ ◡◡𝑆) ⊆ ◡◡𝑇))
7 dfrel2 6192 . . . . . . . . . 10 (Rel 𝑅 ↔ ◡◡𝑅 = 𝑅)
87biimpi 219 . . . . . . . . 9 (Rel 𝑅 → ◡◡𝑅 = 𝑅)
983ad2ant1 1151 . . . . . . . 8 ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → ◡◡𝑅 = 𝑅)
10 dfrel2 6192 . . . . . . . . . 10 (Rel 𝑆 ↔ ◡◡𝑆 = 𝑆)
1110biimpi 219 . . . . . . . . 9 (Rel 𝑆 → ◡◡𝑆 = 𝑆)
12113ad2ant2 1152 . . . . . . . 8 ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → ◡◡𝑆 = 𝑆)
139, 12coeq12d 5847 . . . . . . 7 ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → (◡◡𝑅 ∘ ◡◡𝑆) = (𝑅 ∘ 𝑆))
14 dfrel2 6192 . . . . . . . . 9 (Rel 𝑇 ↔ ◡◡𝑇 = 𝑇)
1514biimpi 219 . . . . . . . 8 (Rel 𝑇 → ◡◡𝑇 = 𝑇)
16153ad2ant3 1153 . . . . . . 7 ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → ◡◡𝑇 = 𝑇)
1713, 16sseq12d 3946 . . . . . 6 ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → ((◡◡𝑅 ∘ ◡◡𝑆) ⊆ ◡◡𝑇 ↔ (𝑅 ∘ 𝑆) ⊆ 𝑇))
1817biimpcd 252 . . . . 5 ((◡◡𝑅 ∘ ◡◡𝑆) ⊆ ◡◡𝑇 → ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → (𝑅 ∘ 𝑆) ⊆ 𝑇))
196, 18biimtrdi 256 . . . 4 (◡(◡𝑆 ∘ ◡𝑅) = (◡◡𝑅 ∘ ◡◡𝑆) → (◡(◡𝑆 ∘ ◡𝑅) ⊆ ◡◡𝑇 → ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → (𝑅 ∘ 𝑆) ⊆ 𝑇)))
204, 5, 19mpsyl 69 . . 3 ((◡𝑆 ∘ ◡𝑅) ⊆ ◡𝑇 → ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → (𝑅 ∘ 𝑆) ⊆ 𝑇))
2120com12 33 . 2 ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → ((◡𝑆 ∘ ◡𝑅) ⊆ ◡𝑇 → (𝑅 ∘ 𝑆) ⊆ 𝑇))
223, 21impbid2 229 1 ((Rel 𝑅 ∧ Rel 𝑆 ∧ Rel 𝑇) → ((𝑅 ∘ 𝑆) ⊆ 𝑇 ↔ (◡𝑆 ∘ ◡𝑅) ⊆ ◡𝑇))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1570   ⊆ wss 3900  ◡ccnv 5654   ∘ ccom 5659  Rel wrel 5660
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664
This theorem is used by:  relcnvtrOLD  6285
  Copyright terms: Public domain W3C validator