Theorem rnxrn 39169

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

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2738   ≠ wne 2955  Vcvv 3450  ∅c0 4279  ⟨cop 4590   class class class wbr 5103  {copab 5167  ^◡ccnv 5654  ran crn 5656  [cec 8694   ⋉ cxrn 38922

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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7736

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-nf 1817  df-sb 2100  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-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fo 6539  df-fv 6541  df-1st 7986  df-2nd 7987  df-ec 8698  df-xrn 39128

This theorem is used by:  rnxrnres  39170  dfcoss4  39253  dfssr2  39327