Theorem rnxrn 38384

Description: Range of the range Cartesian product of classes. (Contributed by Peter Mazsa, 1-Jun-2020.)

Assertion

Ref	Expression
rnxrn	⊢ ran (𝑅 ⋉ 𝑆) = {⟨𝑥, 𝑦⟩ ∣ ∃𝑢(𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)}

Distinct variable groups:   𝑢,𝑅,𝑥,𝑦   𝑢,𝑆,𝑥,𝑦

Proof of Theorem rnxrn

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		3anass 1094	. . . . 5 ⊢ ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)))
2	1	3exbii 1850	. . . 4 ⊢ (∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦) ↔ ∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)))
3		exrot3 2166	. . . 4 ⊢ (∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)) ↔ ∃𝑥∃𝑦∃𝑢(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)))
4		19.42v 1953	. . . . 5 ⊢ (∃𝑢(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑢(𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)))
5	4	2exbii 1849	. . . 4 ⊢ (∃𝑥∃𝑦∃𝑢(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑢(𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)))
6	2, 3, 5	3bitri 297	. . 3 ⊢ (∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑢(𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)))
7	6	abbii 2796	. 2 ⊢ {𝑤 ∣ ∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑢(𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦))}
8		dfrn6 38290	. . 3 ⊢ ran (𝑅 ⋉ 𝑆) = {𝑤 ∣ [𝑤]◡(𝑅 ⋉ 𝑆) ≠ ∅}
9		n0 4316	. . . . 5 ⊢ ([𝑤]◡(𝑅 ⋉ 𝑆) ≠ ∅ ↔ ∃𝑢 𝑢 ∈ [𝑤]◡(𝑅 ⋉ 𝑆))
10		elec1cnvxrn2 38383	. . . . . . 7 ⊢ (𝑢 ∈ V → (𝑢 ∈ [𝑤]◡(𝑅 ⋉ 𝑆) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)))
11	10	elv 3452	. . . . . 6 ⊢ (𝑢 ∈ [𝑤]◡(𝑅 ⋉ 𝑆) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦))
12	11	exbii 1848	. . . . 5 ⊢ (∃𝑢 𝑢 ∈ [𝑤]◡(𝑅 ⋉ 𝑆) ↔ ∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦))
13	9, 12	bitri 275	. . . 4 ⊢ ([𝑤]◡(𝑅 ⋉ 𝑆) ≠ ∅ ↔ ∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦))
14	13	abbii 2796	. . 3 ⊢ {𝑤 ∣ [𝑤]◡(𝑅 ⋉ 𝑆) ≠ ∅} = {𝑤 ∣ ∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)}
15	8, 14	eqtri 2752	. 2 ⊢ ran (𝑅 ⋉ 𝑆) = {𝑤 ∣ ∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)}
16		df-opab 5170	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢(𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑢(𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦))}
17	7, 15, 16	3eqtr4i 2762	1 ⊢ ran (𝑅 ⋉ 𝑆) = {⟨𝑥, 𝑦⟩ ∣ ∃𝑢(𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)}

Syntax hints:   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540  ∃wex 1779   ∈ wcel 2109  {cab 2707   ≠ wne 2925  Vcvv 3447  ∅c0 4296  ⟨cop 4595   class class class wbr 5107  {copab 5169  ^◡ccnv 5637  ran crn 5639  [cec 8669   ⋉ cxrn 38168

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-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711

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-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fo 6517  df-fv 6519  df-1st 7968  df-2nd 7969  df-ec 8673  df-xrn 38353

This theorem is referenced by:  rnxrnres  38385  dfcoss4  38406  dfssr2  38490