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 39202
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 39199 . . . . . . 7 (Rel 𝑅 ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
21biimpi 219 . . . . . 6 (Rel 𝑅 → (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
32dmeqd 5883 . . . . 5 (Rel 𝑅 → dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = dom 𝑅)
42rneqd 5916 . . . . 5 (Rel 𝑅 → ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = ran 𝑅)
53, 4xpeq12d 5678 . . . 4 (Rel 𝑅 → (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅))) = (dom 𝑅 × ran 𝑅))
65ineq2d 4165 . . 3 (Rel 𝑅 → (𝑆 ∩ (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)))) = (𝑆 ∩ (dom 𝑅 × ran 𝑅)))
76sseq2d 3962 . 2 (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)))) ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom 𝑅 × ran 𝑅))))
8 relxp 5665 . . . 4 Rel (dom 𝑅 × ran 𝑅)
9 relin2 5787 . . . 4 (Rel (dom 𝑅 × ran 𝑅) → Rel (𝑅 ∩ (dom 𝑅 × ran 𝑅)))
10 relssinxpdmrn 39201 . . . 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 3961 . . 3 (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑆 ↔ 𝑅 ⊆ 𝑆))
1311, 12bitrid 286 . 2 (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)))) ↔ 𝑅 ⊆ 𝑆))
147, 13bitr3d 284 1 (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom 𝑅 × ran 𝑅)) ↔ 𝑅 ⊆ 𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∩ cin 3897   ⊆ wss 3898   × cxp 5645  dom cdm 5647  ran crn 5648  Rel wrel 5652
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5248  ax-pr 5390
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 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-xp 5653  df-rel 5654  df-cnv 5655  df-dm 5657  df-rn 5658  df-res 5659
This theorem is used by:  dfcnvrefrel4  39464
  Copyright terms: Public domain W3C validator