Theorem rnxrn 39462

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 1111	. . . . 5 ⊢ ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)))
2	1	3exbii 1882	. . . 4 ⊢ (∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦) ↔ ∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)))
3		exrot3 2201	. . . 4 ⊢ (∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)) ↔ ∃𝑥∃𝑦∃𝑢(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)))
4		19.42v 1985	. . . . 5 ⊢ (∃𝑢(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑢(𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)))
5	4	2exbii 1881	. . . 4 ⊢ (∃𝑥∃𝑦∃𝑢(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑢(𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)))
6	2, 3, 5	3bitri 300	. . 3 ⊢ (∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑢(𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)))
7	6	abbii 2827	. 2 ⊢ {𝑤 ∣ ∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑢(𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦))}
8		dfrn6 39349	. . 3 ⊢ ran (𝑅 ⋉ 𝑆) = {𝑤 ∣ [𝑤]◡(𝑅 ⋉ 𝑆) ≠ ∅}
9		n0 4299	. . . . 5 ⊢ ([𝑤]◡(𝑅 ⋉ 𝑆) ≠ ∅ ↔ ∃𝑢 𝑢 ∈ [𝑤]◡(𝑅 ⋉ 𝑆))
10		elec1cnvxrn2 39461	. . . . . . 7 ⊢ (𝑢 ∈ V → (𝑢 ∈ [𝑤]◡(𝑅 ⋉ 𝑆) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)))
11	10	elv 3455	. . . . . 6 ⊢ (𝑢 ∈ [𝑤]◡(𝑅 ⋉ 𝑆) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦))
12	11	exbii 1880	. . . . 5 ⊢ (∃𝑢 𝑢 ∈ [𝑤]◡(𝑅 ⋉ 𝑆) ↔ ∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦))
13	9, 12	bitri 278	. . . 4 ⊢ ([𝑤]◡(𝑅 ⋉ 𝑆) ≠ ∅ ↔ ∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦))
14	13	abbii 2827	. . 3 ⊢ {𝑤 ∣ [𝑤]◡(𝑅 ⋉ 𝑆) ≠ ∅} = {𝑤 ∣ ∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)}
15	8, 14	eqtri 2783	. 2 ⊢ ran (𝑅 ⋉ 𝑆) = {𝑤 ∣ ∃𝑢∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)}
16		df-opab 5167	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢(𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑢(𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦))}
17	7, 15, 16	3eqtr4i 2793	1 ⊢ ran (𝑅 ⋉ 𝑆) = {⟨𝑥, 𝑦⟩ ∣ ∃𝑢(𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)}

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738   ≠ wne 2955  Vcvv 3450  ∅c0 4277  ⟨cop 4834   class class class wbr 5102  {copab 5166  ^◡ccnv 5650  ran crn 5652  [cec 8722   ⋉ cxrn 39215

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391  ax-un 7755

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-fo 6549  df-fv 6551  df-1st 8005  df-2nd 8006  df-ec 8726  df-xrn 39421

This theorem is used by:  rnxrnres  39463  dfcoss4  39546  dfssr2  39620