Theorem opabex3d 7966

Description: Existence of an ordered pair abstraction, deduction version. (Contributed by Alexander van der Vekens, 19-Oct-2017.) (Revised by AV, 9-Aug-2024.)

Hypotheses

Ref	Expression
opabex3d.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
opabex3d.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → {𝑦 ∣ 𝜓} ∈ V)

Assertion

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

Distinct variable groups:   𝑥,𝐴,𝑦   𝜑,𝑥

Allowed substitution hints:   𝜑(𝑦)   𝜓(𝑥, 𝑦)   𝑉(𝑥, 𝑦)

Proof of Theorem opabex3d

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 5674	. . . . . . . 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 2772	. . . . . . . . . . . . 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 2747	. . . . . . . . . 10 ⊢ Ⅎ𝑦 𝑤 ∈ {𝑦 ∣ 𝜓}
20	18, 19	nfan 1932	. . . . . . . . 9 ⊢ Ⅎ𝑦(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜓})
21		nfv 1947	. . . . . . . . 9 ⊢ Ⅎ𝑤(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
22		opeq2 4834	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑦 → ⟨𝑥, 𝑤⟩ = ⟨𝑥, 𝑦⟩)
23	22	eqeq2d 2772	. . . . . . . . . 10 ⊢ (𝑤 = 𝑦 → (𝑧 = ⟨𝑥, 𝑤⟩ ↔ 𝑧 = ⟨𝑥, 𝑦⟩))
24		df-clab 2740	. . . . . . . . . . 11 ⊢ (𝑤 ∈ {𝑦 ∣ 𝜓} ↔ [𝑤 / 𝑦]𝜓)
25		sbequ12 2287	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑤 → (𝜓 ↔ [𝑤 / 𝑦]𝜓))
26	25	equcoms 2053	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑦 → (𝜓 ↔ [𝑤 / 𝑦]𝜓))
27	24, 26	bitr4id 293	. . . . . . . . . 10 ⊢ (𝑤 = 𝑦 → (𝑤 ∈ {𝑦 ∣ 𝜓} ↔ 𝜓))
28	23, 27	anbi12d 644	. . . . . . . . 9 ⊢ (𝑤 = 𝑦 → ((𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦 ∣ 𝜓}) ↔ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
29	20, 21, 28	cbvexv1 2372	. . . . . . . 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 3088	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 𝑧 ∈ ({𝑥} × {𝑦 ∣ 𝜓}) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥} × {𝑦 ∣ 𝜓})))
36	34, 35	bitri 278	. . . 4 ⊢ (𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝑦 ∣ 𝜓}) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥} × {𝑦 ∣ 𝜓})))
37		elopab 5501	. . . 4 ⊢ (𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜓)} ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝜓)))
38	33, 36, 37	3bitr4i 306	. . 3 ⊢ (𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝑦 ∣ 𝜓}) ↔ 𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜓)})
39	38	eqriv 2758	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝑦 ∣ 𝜓}) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜓)}
40		opabex3d.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
41		vsnex 5393	. . . . 5 ⊢ {𝑥} ∈ V
42		opabex3d.2	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → {𝑦 ∣ 𝜓} ∈ V)
43		xpexg 7753	. . . . 5 ⊢ (({𝑥} ∈ V ∧ {𝑦 ∣ 𝜓} ∈ V) → ({𝑥} × {𝑦 ∣ 𝜓}) ∈ V)
44	41, 42, 43	sylancr 599	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ({𝑥} × {𝑦 ∣ 𝜓}) ∈ V)
45	44	ralrimiva 3155	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ({𝑥} × {𝑦 ∣ 𝜓}) ∈ V)
46		iunexg 7964	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 ({𝑥} × {𝑦 ∣ 𝜓}) ∈ V) → ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝑦 ∣ 𝜓}) ∈ V)
47	40, 45, 46	syl2anc 596	. 2 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝑦 ∣ 𝜓}) ∈ V)
48	39, 47	eqeltrrid 2866	1 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜓)} ∈ V)

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

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 2733  ax-rep 5232  ax-sep 5249  ax-pow 5327  ax-pr 5391  ax-un 7740

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 2565  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 5657  df-rel 5658

This theorem is used by:  wksfval  30172  fpwrelmap  33307  satfv0  36092  cnvepresex  39236  tfsconcatun  44297  opabresex0d  48299  upwlksfval  49177  upfval2  50229