Theorem elxp4 5109

Description: Membership in a cross product. This version requires no quantifiers or dummy variables. (Contributed by set.mm contributors, 17-Feb-2004.)

Assertion

Ref	Expression
elxp4	⊢ (A ∈ (B × C) ↔ (A = ⟨∪dom {A}, ∪ran {A}⟩ ∧ (∪dom {A} ∈ B ∧ ∪ran {A} ∈ C)))

Proof of Theorem elxp4

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elxp 4802	. 2 ⊢ (A ∈ (B × C) ↔ ∃x∃y(A = ⟨x, y⟩ ∧ (x ∈ B ∧ y ∈ C)))
2		sneq 3745	. . . . . . . . . . 11 ⊢ (A = ⟨x, y⟩ → {A} = {⟨x, y⟩})
3	2	rneqd 4959	. . . . . . . . . 10 ⊢ (A = ⟨x, y⟩ → ran {A} = ran {⟨x, y⟩})
4	3	unieqd 3903	. . . . . . . . 9 ⊢ (A = ⟨x, y⟩ → ∪ran {A} = ∪ran {⟨x, y⟩})
5		vex 2863	. . . . . . . . . 10 ⊢ x ∈ V
6		vex 2863	. . . . . . . . . 10 ⊢ y ∈ V
7	5, 6	op2nda 5077	. . . . . . . . 9 ⊢ ∪ran {⟨x, y⟩} = y
8	4, 7	syl6req 2402	. . . . . . . 8 ⊢ (A = ⟨x, y⟩ → y = ∪ran {A})
9	8	adantr 451	. . . . . . 7 ⊢ ((A = ⟨x, y⟩ ∧ (x ∈ B ∧ y ∈ C)) → y = ∪ran {A})
10	9	pm4.71ri 614	. . . . . 6 ⊢ ((A = ⟨x, y⟩ ∧ (x ∈ B ∧ y ∈ C)) ↔ (y = ∪ran {A} ∧ (A = ⟨x, y⟩ ∧ (x ∈ B ∧ y ∈ C))))
11	10	exbii 1582	. . . . 5 ⊢ (∃y(A = ⟨x, y⟩ ∧ (x ∈ B ∧ y ∈ C)) ↔ ∃y(y = ∪ran {A} ∧ (A = ⟨x, y⟩ ∧ (x ∈ B ∧ y ∈ C))))
12		snex 4112	. . . . . . . 8 ⊢ {A} ∈ V
13	12	rnex 5108	. . . . . . 7 ⊢ ran {A} ∈ V
14	13	uniex 4318	. . . . . 6 ⊢ ∪ran {A} ∈ V
15		opeq2 4580	. . . . . . . 8 ⊢ (y = ∪ran {A} → ⟨x, y⟩ = ⟨x, ∪ran {A}⟩)
16	15	eqeq2d 2364	. . . . . . 7 ⊢ (y = ∪ran {A} → (A = ⟨x, y⟩ ↔ A = ⟨x, ∪ran {A}⟩))
17		eleq1 2413	. . . . . . . 8 ⊢ (y = ∪ran {A} → (y ∈ C ↔ ∪ran {A} ∈ C))
18	17	anbi2d 684	. . . . . . 7 ⊢ (y = ∪ran {A} → ((x ∈ B ∧ y ∈ C) ↔ (x ∈ B ∧ ∪ran {A} ∈ C)))
19	16, 18	anbi12d 691	. . . . . 6 ⊢ (y = ∪ran {A} → ((A = ⟨x, y⟩ ∧ (x ∈ B ∧ y ∈ C)) ↔ (A = ⟨x, ∪ran {A}⟩ ∧ (x ∈ B ∧ ∪ran {A} ∈ C))))
20	14, 19	ceqsexv 2895	. . . . 5 ⊢ (∃y(y = ∪ran {A} ∧ (A = ⟨x, y⟩ ∧ (x ∈ B ∧ y ∈ C))) ↔ (A = ⟨x, ∪ran {A}⟩ ∧ (x ∈ B ∧ ∪ran {A} ∈ C)))
21	11, 20	bitri 240	. . . 4 ⊢ (∃y(A = ⟨x, y⟩ ∧ (x ∈ B ∧ y ∈ C)) ↔ (A = ⟨x, ∪ran {A}⟩ ∧ (x ∈ B ∧ ∪ran {A} ∈ C)))
22		sneq 3745	. . . . . . . . 9 ⊢ (A = ⟨x, ∪ran {A}⟩ → {A} = {⟨x, ∪ran {A}⟩})
23	22	dmeqd 4910	. . . . . . . 8 ⊢ (A = ⟨x, ∪ran {A}⟩ → dom {A} = dom {⟨x, ∪ran {A}⟩})
24	23	unieqd 3903	. . . . . . 7 ⊢ (A = ⟨x, ∪ran {A}⟩ → ∪dom {A} = ∪dom {⟨x, ∪ran {A}⟩})
25	5, 14	op1sta 5073	. . . . . . 7 ⊢ ∪dom {⟨x, ∪ran {A}⟩} = x
26	24, 25	syl6req 2402	. . . . . 6 ⊢ (A = ⟨x, ∪ran {A}⟩ → x = ∪dom {A})
27	26	pm4.71ri 614	. . . . 5 ⊢ (A = ⟨x, ∪ran {A}⟩ ↔ (x = ∪dom {A} ∧ A = ⟨x, ∪ran {A}⟩))
28	27	anbi1i 676	. . . 4 ⊢ ((A = ⟨x, ∪ran {A}⟩ ∧ (x ∈ B ∧ ∪ran {A} ∈ C)) ↔ ((x = ∪dom {A} ∧ A = ⟨x, ∪ran {A}⟩) ∧ (x ∈ B ∧ ∪ran {A} ∈ C)))
29		anass 630	. . . 4 ⊢ (((x = ∪dom {A} ∧ A = ⟨x, ∪ran {A}⟩) ∧ (x ∈ B ∧ ∪ran {A} ∈ C)) ↔ (x = ∪dom {A} ∧ (A = ⟨x, ∪ran {A}⟩ ∧ (x ∈ B ∧ ∪ran {A} ∈ C))))
30	21, 28, 29	3bitri 262	. . 3 ⊢ (∃y(A = ⟨x, y⟩ ∧ (x ∈ B ∧ y ∈ C)) ↔ (x = ∪dom {A} ∧ (A = ⟨x, ∪ran {A}⟩ ∧ (x ∈ B ∧ ∪ran {A} ∈ C))))
31	30	exbii 1582	. 2 ⊢ (∃x∃y(A = ⟨x, y⟩ ∧ (x ∈ B ∧ y ∈ C)) ↔ ∃x(x = ∪dom {A} ∧ (A = ⟨x, ∪ran {A}⟩ ∧ (x ∈ B ∧ ∪ran {A} ∈ C))))
32	12	dmex 5107	. . . 4 ⊢ dom {A} ∈ V
33	32	uniex 4318	. . 3 ⊢ ∪dom {A} ∈ V
34		opeq1 4579	. . . . 5 ⊢ (x = ∪dom {A} → ⟨x, ∪ran {A}⟩ = ⟨∪dom {A}, ∪ran {A}⟩)
35	34	eqeq2d 2364	. . . 4 ⊢ (x = ∪dom {A} → (A = ⟨x, ∪ran {A}⟩ ↔ A = ⟨∪dom {A}, ∪ran {A}⟩))
36		eleq1 2413	. . . . 5 ⊢ (x = ∪dom {A} → (x ∈ B ↔ ∪dom {A} ∈ B))
37	36	anbi1d 685	. . . 4 ⊢ (x = ∪dom {A} → ((x ∈ B ∧ ∪ran {A} ∈ C) ↔ (∪dom {A} ∈ B ∧ ∪ran {A} ∈ C)))
38	35, 37	anbi12d 691	. . 3 ⊢ (x = ∪dom {A} → ((A = ⟨x, ∪ran {A}⟩ ∧ (x ∈ B ∧ ∪ran {A} ∈ C)) ↔ (A = ⟨∪dom {A}, ∪ran {A}⟩ ∧ (∪dom {A} ∈ B ∧ ∪ran {A} ∈ C))))
39	33, 38	ceqsexv 2895	. 2 ⊢ (∃x(x = ∪dom {A} ∧ (A = ⟨x, ∪ran {A}⟩ ∧ (x ∈ B ∧ ∪ran {A} ∈ C))) ↔ (A = ⟨∪dom {A}, ∪ran {A}⟩ ∧ (∪dom {A} ∈ B ∧ ∪ran {A} ∈ C)))
40	1, 31, 39	3bitri 262	1 ⊢ (A ∈ (B × C) ↔ (A = ⟨∪dom {A}, ∪ran {A}⟩ ∧ (∪dom {A} ∈ B ∧ ∪ran {A} ∈ C)))

This proof depends on syntax axioms:   ↔ wb 176   ∧ wa 358  ∃wex 1541   = wceq 1642   ∈ wcel 1710  {csn 3738  ∪cuni 3892  ⟨cop 4562   × cxp 4771  dom cdm 4773  ran crn 4774

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4079  ax-xp 4080  ax-cnv 4081  ax-1c 4082  ax-sset 4083  ax-si 4084  ax-ins2 4085  ax-ins3 4086  ax-typlower 4087  ax-sn 4088

This proof depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2208  df-mo 2209  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-ral 2620  df-rex 2621  df-reu 2622  df-rmo 2623  df-rab 2624  df-v 2862  df-sbc 3048  df-nin 3212  df-compl 3213  df-in 3214  df-un 3215  df-dif 3216  df-symdif 3217  df-ss 3260  df-pss 3262  df-nul 3552  df-if 3664  df-pw 3725  df-sn 3742  df-pr 3743  df-uni 3893  df-int 3928  df-opk 4059  df-1c 4137  df-pw1 4138  df-uni1 4139  df-xpk 4186  df-cnvk 4187  df-ins2k 4188  df-ins3k 4189  df-imak 4190  df-cok 4191  df-p6 4192  df-sik 4193  df-ssetk 4194  df-imagek 4195  df-idk 4196  df-iota 4340  df-0c 4378  df-addc 4379  df-nnc 4380  df-fin 4381  df-lefin 4441  df-ltfin 4442  df-ncfin 4443  df-tfin 4444  df-evenfin 4445  df-oddfin 4446  df-sfin 4447  df-spfin 4448  df-phi 4566  df-op 4567  df-proj1 4568  df-proj2 4569  df-opab 4624  df-br 4641  df-swap 4725  df-ima 4728  df-xp 4785  df-cnv 4786  df-rn 4787  df-dm 4788

This theorem is used by: (None)