Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cnvref4 Structured version   Visualization version   GIF version

Theorem cnvref4 38339
Description: Two ways to say that a relation is a subclass. (Contributed by Peter Mazsa, 11-Apr-2023.)
Assertion
Ref Expression
cnvref4 (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom 𝑅 × ran 𝑅)) ↔ 𝑅𝑆))

Proof of Theorem cnvref4
StepHypRef Expression
1 dfrel6 38336 . . . . . . 7 (Rel 𝑅 ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
21biimpi 216 . . . . . 6 (Rel 𝑅 → (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
32dmeqd 5872 . . . . 5 (Rel 𝑅 → dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = dom 𝑅)
42rneqd 5905 . . . . 5 (Rel 𝑅 → ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = ran 𝑅)
53, 4xpeq12d 5672 . . . 4 (Rel 𝑅 → (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅))) = (dom 𝑅 × ran 𝑅))
65ineq2d 4186 . . 3 (Rel 𝑅 → (𝑆 ∩ (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)))) = (𝑆 ∩ (dom 𝑅 × ran 𝑅)))
76sseq2d 3982 . 2 (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)))) ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom 𝑅 × ran 𝑅))))
8 relxp 5659 . . . 4 Rel (dom 𝑅 × ran 𝑅)
9 relin2 5779 . . . 4 (Rel (dom 𝑅 × ran 𝑅) → Rel (𝑅 ∩ (dom 𝑅 × ran 𝑅)))
10 relssinxpdmrn 38338 . . . 4 (Rel (𝑅 ∩ (dom 𝑅 × ran 𝑅)) → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)))) ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑆))
118, 9, 10mp2b 10 . . 3 ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)))) ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑆)
122sseq1d 3981 . . 3 (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑆𝑅𝑆))
1311, 12bitrid 283 . 2 (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)))) ↔ 𝑅𝑆))
147, 13bitr3d 281 1 (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom 𝑅 × ran 𝑅)) ↔ 𝑅𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1540  cin 3916  wss 3917   × cxp 5639  dom cdm 5641  ran crn 5642  Rel wrel 5646
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-br 5111  df-opab 5173  df-xp 5647  df-rel 5648  df-cnv 5649  df-dm 5651  df-rn 5652  df-res 5653
This theorem is referenced by:  dfcnvrefrel4  38530
  Copyright terms: Public domain W3C validator