Theorem opabex3 7964

Description: Existence of an ordered pair abstraction. (Contributed by Jeff Madsen, 2-Sep-2009.)

Hypotheses

Ref	Expression
opabex3.1	⊢ 𝐴 ∈ V
opabex3.2	⊢ (𝑥 ∈ 𝐴 → {𝑦 ∣ 𝜑} ∈ V)

Assertion

Ref	Expression
opabex3	⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∈ V

Distinct variable group:   𝑥,𝐴,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem opabex3

Dummy variables 𝑣 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		19.42v 1986	. . . . . 6 ⊢ (∃𝑦(𝑥 ∈ 𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
2		an12 658	. . . . . . 7 ⊢ ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ (𝑥 ∈ 𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
3	2	exbii 1881	. . . . . 6 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ∃𝑦(𝑥 ∈ 𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
4		elxp 5678	. . . . . . . 8 ⊢ (𝑧 ∈ ({𝑥} × {𝑦 ∣ 𝜑}) ↔ ∃𝑣∃𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})))
5		excom 2199	. . . . . . . . 9 ⊢ (∃𝑣∃𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})) ↔ ∃𝑤∃𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})))
6		an12 658	. . . . . . . . . . . . 13 ⊢ ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})) ↔ (𝑣 ∈ {𝑥} ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})))
7		velsn 4600	. . . . . . . . . . . . . 14 ⊢ (𝑣 ∈ {𝑥} ↔ 𝑣 = 𝑥)
8	7	anbi1i 636	. . . . . . . . . . . . 13 ⊢ ((𝑣 ∈ {𝑥} ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})) ↔ (𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})))
9	6, 8	bitri 278	. . . . . . . . . . . 12 ⊢ ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})) ↔ (𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})))
10	9	exbii 1881	. . . . . . . . . . 11 ⊢ (∃𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})) ↔ ∃𝑣(𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})))
11		opeq1 4833	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑥 → ⟨𝑣, 𝑤⟩ = ⟨𝑥, 𝑤⟩)
12	11	eqeq2d 2771	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑥 → (𝑧 = ⟨𝑣, 𝑤⟩ ↔ 𝑧 = ⟨𝑥, 𝑤⟩))
13	12	anbi1d 643	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑥 → ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜑}) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})))
14	13	equsexvw 2038	. . . . . . . . . . 11 ⊢ (∃𝑣(𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜑}))
15	10, 14	bitri 278	. . . . . . . . . 10 ⊢ (∃𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜑}))
16	15	exbii 1881	. . . . . . . . 9 ⊢ (∃𝑤∃𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})) ↔ ∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜑}))
17	5, 16	bitri 278	. . . . . . . 8 ⊢ (∃𝑣∃𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})) ↔ ∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜑}))
18		nfv 1947	. . . . . . . . . 10 ⊢ Ⅎ𝑦 𝑧 = ⟨𝑥, 𝑤⟩
19		nfsab1 2746	. . . . . . . . . 10 ⊢ Ⅎ𝑦 𝑤 ∈ {𝑦 ∣ 𝜑}
20	18, 19	nfan 1932	. . . . . . . . 9 ⊢ Ⅎ𝑦(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜑})
21		nfv 1947	. . . . . . . . 9 ⊢ Ⅎ𝑤(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
22		opeq2 4834	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑦 → ⟨𝑥, 𝑤⟩ = ⟨𝑥, 𝑦⟩)
23	22	eqeq2d 2771	. . . . . . . . . 10 ⊢ (𝑤 = 𝑦 → (𝑧 = ⟨𝑥, 𝑤⟩ ↔ 𝑧 = ⟨𝑥, 𝑦⟩))
24		df-clab 2739	. . . . . . . . . . 11 ⊢ (𝑤 ∈ {𝑦 ∣ 𝜑} ↔ [𝑤 / 𝑦]𝜑)
25		sbequ12 2286	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑤 → (𝜑 ↔ [𝑤 / 𝑦]𝜑))
26	25	equcoms 2053	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑦 → (𝜑 ↔ [𝑤 / 𝑦]𝜑))
27	24, 26	bitr4id 293	. . . . . . . . . 10 ⊢ (𝑤 = 𝑦 → (𝑤 ∈ {𝑦 ∣ 𝜑} ↔ 𝜑))
28	23, 27	anbi12d 644	. . . . . . . . 9 ⊢ (𝑤 = 𝑦 → ((𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜑}) ↔ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
29	20, 21, 28	cbvexv1 2371	. . . . . . . 8 ⊢ (∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜑}) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
30	4, 17, 29	3bitri 300	. . . . . . 7 ⊢ (𝑧 ∈ ({𝑥} × {𝑦 ∣ 𝜑}) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
31	30	anbi2i 635	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥} × {𝑦 ∣ 𝜑})) ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
32	1, 3, 31	3bitr4ri 307	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥} × {𝑦 ∣ 𝜑})) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)))
33	32	exbii 1881	. . . 4 ⊢ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥} × {𝑦 ∣ 𝜑})) ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)))
34		eliun 4955	. . . . 5 ⊢ (𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝑦 ∣ 𝜑}) ↔ ∃𝑥 ∈ 𝐴 𝑧 ∈ ({𝑥} × {𝑦 ∣ 𝜑}))
35		df-rex 3087	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 𝑧 ∈ ({𝑥} × {𝑦 ∣ 𝜑}) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥} × {𝑦 ∣ 𝜑})))
36	34, 35	bitri 278	. . . 4 ⊢ (𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝑦 ∣ 𝜑}) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥} × {𝑦 ∣ 𝜑})))
37		elopab 5505	. . . 4 ⊢ (𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)))
38	33, 36, 37	3bitr4i 306	. . 3 ⊢ (𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝑦 ∣ 𝜑}) ↔ 𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)})
39	38	eqriv 2757	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝑦 ∣ 𝜑}) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
40		opabex3.1	. . 3 ⊢ 𝐴 ∈ V
41		vsnex 5400	. . . . 5 ⊢ {𝑥} ∈ V
42		opabex3.2	. . . . 5 ⊢ (𝑥 ∈ 𝐴 → {𝑦 ∣ 𝜑} ∈ V)
43		xpexg 7749	. . . . 5 ⊢ (({𝑥} ∈ V ∧ {𝑦 ∣ 𝜑} ∈ V) → ({𝑥} × {𝑦 ∣ 𝜑}) ∈ V)
44	41, 42, 43	sylancr 599	. . . 4 ⊢ (𝑥 ∈ 𝐴 → ({𝑥} × {𝑦 ∣ 𝜑}) ∈ V)
45	44	rgen 3078	. . 3 ⊢ ∀𝑥 ∈ 𝐴 ({𝑥} × {𝑦 ∣ 𝜑}) ∈ V
46		iunexg 7960	. . 3 ⊢ ((𝐴 ∈ V ∧ ∀𝑥 ∈ 𝐴 ({𝑥} × {𝑦 ∣ 𝜑}) ∈ V) → ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝑦 ∣ 𝜑}) ∈ V)
47	40, 45, 46	mp2an 705	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝑦 ∣ 𝜑}) ∈ V
48	39, 47	eqeltrri 2857	1 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∈ V

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812  [wsb 2099   ∈ wcel 2145  {cab 2738  ∀wral 3076  ∃wrex 3086  Vcvv 3450  {csn 4584  ⟨cop 4590  ∪ ciun 4951  {copab 5167   × cxp 5653

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-rep 5232  ax-sep 5251  ax-pow 5330  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-clab 2739  df-cleq 2752  df-clel 2835  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-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-opab 5168  df-xp 5661  df-rel 5662

This theorem is used by:  dvdsrval  20502  eulerpartlemgvv  34887