Theorem cnvref4 38854

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

Step	Hyp	Ref	Expression
1		dfrel6 38851	. . . . . . 7 ⊢ (Rel 𝑅 ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
2	1	biimpi 218	. . . . . 6 ⊢ (Rel 𝑅 → (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
3	2	dmeqd 5882	. . . . 5 ⊢ (Rel 𝑅 → dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = dom 𝑅)
4	2	rneqd 5915	. . . . 5 ⊢ (Rel 𝑅 → ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = ran 𝑅)
5	3, 4	xpeq12d 5679	. . . 4 ⊢ (Rel 𝑅 → (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅))) = (dom 𝑅 × ran 𝑅))
6	5	ineq2d 4173	. . 3 ⊢ (Rel 𝑅 → (𝑆 ∩ (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)))) = (𝑆 ∩ (dom 𝑅 × ran 𝑅)))
7	6	sseq2d 3969	. 2 ⊢ (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)))) ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom 𝑅 × ran 𝑅))))
8		relxp 5666	. . . 4 ⊢ Rel (dom 𝑅 × ran 𝑅)
9		relin2 5787	. . . 4 ⊢ (Rel (dom 𝑅 × ran 𝑅) → Rel (𝑅 ∩ (dom 𝑅 × ran 𝑅)))
10		relssinxpdmrn 38853	. . . 4 ⊢ (Rel (𝑅 ∩ (dom 𝑅 × ran 𝑅)) → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)))) ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑆))
11	8, 9, 10	mp2b 10	. . 3 ⊢ ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)))) ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑆)
12	2	sseq1d 3968	. . 3 ⊢ (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑆 ↔ 𝑅 ⊆ 𝑆))
13	11, 12	bitrid 285	. 2 ⊢ (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom (𝑅 ∩ (dom 𝑅 × ran 𝑅)) × ran (𝑅 ∩ (dom 𝑅 × ran 𝑅)))) ↔ 𝑅 ⊆ 𝑆))
14	7, 13	bitr3d 283	1 ⊢ (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑆 ∩ (dom 𝑅 × ran 𝑅)) ↔ 𝑅 ⊆ 𝑆))

Syntax hints:   → wi 4   ↔ wb 208   = wceq 1561   ∩ cin 3904   ⊆ wss 3905   × cxp 5646  dom cdm 5648  ran crn 5649  Rel wrel 5653

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5247  ax-pr 5391

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-sb 2092  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3078  df-rex 3088  df-rab 3416  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5102  df-opab 5164  df-xp 5654  df-rel 5655  df-cnv 5656  df-dm 5658  df-rn 5659  df-res 5660

This theorem is referenced by:  dfcnvrefrel4  39116