Theorem elxp4 7862

Description: Membership in a Cartesian product. This version requires no quantifiers or dummy variables. See also elxp5 7863, elxp6 7965, and elxp7 7966. (Contributed by NM, 17-Feb-2004.)

Assertion

Ref	Expression
elxp4	⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨∪ dom {𝐴}, ∪ ran {𝐴}⟩ ∧ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))

Proof of Theorem elxp4

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elxp 5641	. 2 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)))
2		sneq 4565	. . . . . . . . . . . 12 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → {𝐴} = {⟨𝑥, 𝑦⟩})
3	2	rneqd 5880	. . . . . . . . . . 11 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → ran {𝐴} = ran {⟨𝑥, 𝑦⟩})
4	3	unieqd 4851	. . . . . . . . . 10 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → ∪ ran {𝐴} = ∪ ran {⟨𝑥, 𝑦⟩})
5		vex 3435	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
6		vex 3435	. . . . . . . . . . 11 ⊢ 𝑦 ∈ V
7	5, 6	op2nda 6179	. . . . . . . . . 10 ⊢ ∪ ran {⟨𝑥, 𝑦⟩} = 𝑦
8	4, 7	eqtr2di 2791	. . . . . . . . 9 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → 𝑦 = ∪ ran {𝐴})
9	8	pm4.71ri 565	. . . . . . . 8 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ ↔ (𝑦 = ∪ ran {𝐴} ∧ 𝐴 = ⟨𝑥, 𝑦⟩))
10	9	anbi1i 630	. . . . . . 7 ⊢ ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ((𝑦 = ∪ ran {𝐴} ∧ 𝐴 = ⟨𝑥, 𝑦⟩) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)))
11		anass 469	. . . . . . 7 ⊢ (((𝑦 = ∪ ran {𝐴} ∧ 𝐴 = ⟨𝑥, 𝑦⟩) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ (𝑦 = ∪ ran {𝐴} ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))))
12	10, 11	bitri 276	. . . . . 6 ⊢ ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ (𝑦 = ∪ ran {𝐴} ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))))
13	12	exbii 1855	. . . . 5 ⊢ (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ∃𝑦(𝑦 = ∪ ran {𝐴} ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))))
14		snex 5368	. . . . . . . 8 ⊢ {𝐴} ∈ V
15	14	rnex 7850	. . . . . . 7 ⊢ ran {𝐴} ∈ V
16	15	uniex 7684	. . . . . 6 ⊢ ∪ ran {𝐴} ∈ V
17		opeq2 4805	. . . . . . . 8 ⊢ (𝑦 = ∪ ran {𝐴} → ⟨𝑥, 𝑦⟩ = ⟨𝑥, ∪ ran {𝐴}⟩)
18	17	eqeq2d 2750	. . . . . . 7 ⊢ (𝑦 = ∪ ran {𝐴} → (𝐴 = ⟨𝑥, 𝑦⟩ ↔ 𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩))
19		eleq1 2827	. . . . . . . 8 ⊢ (𝑦 = ∪ ran {𝐴} → (𝑦 ∈ 𝐶 ↔ ∪ ran {𝐴} ∈ 𝐶))
20	19	anbi2d 636	. . . . . . 7 ⊢ (𝑦 = ∪ ran {𝐴} → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) ↔ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))
21	18, 20	anbi12d 638	. . . . . 6 ⊢ (𝑦 = ∪ ran {𝐴} → ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))))
22	16, 21	ceqsexv 3479	. . . . 5 ⊢ (∃𝑦(𝑦 = ∪ ran {𝐴} ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) ↔ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))
23	13, 22	bitri 276	. . . 4 ⊢ (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))
24		sneq 4565	. . . . . . . . 9 ⊢ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ → {𝐴} = {⟨𝑥, ∪ ran {𝐴}⟩})
25	24	dmeqd 5847	. . . . . . . 8 ⊢ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ → dom {𝐴} = dom {⟨𝑥, ∪ ran {𝐴}⟩})
26	25	unieqd 4851	. . . . . . 7 ⊢ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ → ∪ dom {𝐴} = ∪ dom {⟨𝑥, ∪ ran {𝐴}⟩})
27	5, 16	op1sta 6176	. . . . . . 7 ⊢ ∪ dom {⟨𝑥, ∪ ran {𝐴}⟩} = 𝑥
28	26, 27	eqtr2di 2791	. . . . . 6 ⊢ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ → 𝑥 = ∪ dom {𝐴})
29	28	pm4.71ri 565	. . . . 5 ⊢ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ↔ (𝑥 = ∪ dom {𝐴} ∧ 𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩))
30	29	anbi1i 630	. . . 4 ⊢ ((𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)) ↔ ((𝑥 = ∪ dom {𝐴} ∧ 𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩) ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))
31		anass 469	. . . 4 ⊢ (((𝑥 = ∪ dom {𝐴} ∧ 𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩) ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)) ↔ (𝑥 = ∪ dom {𝐴} ∧ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))))
32	23, 30, 31	3bitri 298	. . 3 ⊢ (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ (𝑥 = ∪ dom {𝐴} ∧ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))))
33	32	exbii 1855	. 2 ⊢ (∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ∃𝑥(𝑥 = ∪ dom {𝐴} ∧ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))))
34	14	dmex 7849	. . . 4 ⊢ dom {𝐴} ∈ V
35	34	uniex 7684	. . 3 ⊢ ∪ dom {𝐴} ∈ V
36		opeq1 4804	. . . . 5 ⊢ (𝑥 = ∪ dom {𝐴} → ⟨𝑥, ∪ ran {𝐴}⟩ = ⟨∪ dom {𝐴}, ∪ ran {𝐴}⟩)
37	36	eqeq2d 2750	. . . 4 ⊢ (𝑥 = ∪ dom {𝐴} → (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ↔ 𝐴 = ⟨∪ dom {𝐴}, ∪ ran {𝐴}⟩))
38		eleq1 2827	. . . . 5 ⊢ (𝑥 = ∪ dom {𝐴} → (𝑥 ∈ 𝐵 ↔ ∪ dom {𝐴} ∈ 𝐵))
39	38	anbi1d 637	. . . 4 ⊢ (𝑥 = ∪ dom {𝐴} → ((𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶) ↔ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))
40	37, 39	anbi12d 638	. . 3 ⊢ (𝑥 = ∪ dom {𝐴} → ((𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)) ↔ (𝐴 = ⟨∪ dom {𝐴}, ∪ ran {𝐴}⟩ ∧ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))))
41	35, 40	ceqsexv 3479	. 2 ⊢ (∃𝑥(𝑥 = ∪ dom {𝐴} ∧ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))) ↔ (𝐴 = ⟨∪ dom {𝐴}, ∪ ran {𝐴}⟩ ∧ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))
42	1, 33, 41	3bitri 298	1 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨∪ dom {𝐴}, ∪ ran {𝐴}⟩ ∧ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))

Syntax hints:   ↔ wb 207   ∧ wa 396   = wceq 1547  ∃wex 1786   ∈ wcel 2119  {csn 4555  ⟨cop 4561  ∪ cuni 4838   × cxp 5616  dom cdm 5618  ran crn 5619

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711  ax-sep 5218  ax-pr 5362  ax-un 7678

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-xp 5624  df-rel 5625  df-cnv 5626  df-dm 5628  df-rn 5629

This theorem is referenced by:  elxp6  7965  xpdom2  9000