Theorem opabex3rd 7782

Description: Existence of an ordered pair abstraction if the second components are elements of a set. (Contributed by AV, 17-Sep-2023.) (Revised by AV, 9-Aug-2024.)

Hypotheses

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

Assertion

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

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

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

Proof of Theorem opabex3rd

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

Step	Hyp	Ref	Expression
1		19.42v 1958	. . . . . . 7 ⊢ (∃𝑥(𝑦 ∈ 𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)) ↔ (𝑦 ∈ 𝐴 ∧ ∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
2		an12 641	. . . . . . . 8 ⊢ ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) ↔ (𝑦 ∈ 𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
3	2	exbii 1851	. . . . . . 7 ⊢ (∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) ↔ ∃𝑥(𝑦 ∈ 𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
4		elxp 5603	. . . . . . . . . 10 ⊢ (𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑤∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ {𝑥 ∣ 𝜓} ∧ 𝑣 ∈ {𝑦})))
5		ancom 460	. . . . . . . . . . . 12 ⊢ ((𝑤 ∈ {𝑥 ∣ 𝜓} ∧ 𝑣 ∈ {𝑦}) ↔ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}))
6	5	anbi2i 622	. . . . . . . . . . 11 ⊢ ((𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ {𝑥 ∣ 𝜓} ∧ 𝑣 ∈ {𝑦})) ↔ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
7	6	2exbii 1852	. . . . . . . . . 10 ⊢ (∃𝑤∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ {𝑥 ∣ 𝜓} ∧ 𝑣 ∈ {𝑦})) ↔ ∃𝑤∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
8	4, 7	bitri 274	. . . . . . . . 9 ⊢ (𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑤∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
9		an12 641	. . . . . . . . . . . . 13 ⊢ ((𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ (𝑣 ∈ {𝑦} ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
10		velsn 4574	. . . . . . . . . . . . . 14 ⊢ (𝑣 ∈ {𝑦} ↔ 𝑣 = 𝑦)
11	10	anbi1i 623	. . . . . . . . . . . . 13 ⊢ ((𝑣 ∈ {𝑦} ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ (𝑣 = 𝑦 ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
12	9, 11	bitri 274	. . . . . . . . . . . 12 ⊢ ((𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ (𝑣 = 𝑦 ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
13	12	exbii 1851	. . . . . . . . . . 11 ⊢ (∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ ∃𝑣(𝑣 = 𝑦 ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
14		opeq2 4802	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑦 → ⟨𝑤, 𝑣⟩ = ⟨𝑤, 𝑦⟩)
15	14	eqeq2d 2749	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑦 → (𝑧 = ⟨𝑤, 𝑣⟩ ↔ 𝑧 = ⟨𝑤, 𝑦⟩))
16	15	anbi1d 629	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑦 → ((𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}) ↔ (𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
17	16	equsexvw 2009	. . . . . . . . . . 11 ⊢ (∃𝑣(𝑣 = 𝑦 ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ (𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}))
18	13, 17	bitri 274	. . . . . . . . . 10 ⊢ (∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ (𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}))
19	18	exbii 1851	. . . . . . . . 9 ⊢ (∃𝑤∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ ∃𝑤(𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}))
20		nfv 1918	. . . . . . . . . . 11 ⊢ Ⅎ𝑥 𝑧 = ⟨𝑤, 𝑦⟩
21		nfsab1 2723	. . . . . . . . . . 11 ⊢ Ⅎ𝑥 𝑤 ∈ {𝑥 ∣ 𝜓}
22	20, 21	nfan 1903	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})
23		nfv 1918	. . . . . . . . . 10 ⊢ Ⅎ𝑤(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
24		opeq1 4801	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑥 → ⟨𝑤, 𝑦⟩ = ⟨𝑥, 𝑦⟩)
25	24	eqeq2d 2749	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑥 → (𝑧 = ⟨𝑤, 𝑦⟩ ↔ 𝑧 = ⟨𝑥, 𝑦⟩))
26		df-clab 2716	. . . . . . . . . . . 12 ⊢ (𝑤 ∈ {𝑥 ∣ 𝜓} ↔ [𝑤 / 𝑥]𝜓)
27		sbequ12 2247	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑤 → (𝜓 ↔ [𝑤 / 𝑥]𝜓))
28	27	equcoms 2024	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑥 → (𝜓 ↔ [𝑤 / 𝑥]𝜓))
29	26, 28	bitr4id 289	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑥 → (𝑤 ∈ {𝑥 ∣ 𝜓} ↔ 𝜓))
30	25, 29	anbi12d 630	. . . . . . . . . 10 ⊢ (𝑤 = 𝑥 → ((𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}) ↔ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
31	22, 23, 30	cbvexv1 2341	. . . . . . . . 9 ⊢ (∃𝑤(𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}) ↔ ∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
32	8, 19, 31	3bitri 296	. . . . . . . 8 ⊢ (𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
33	32	anbi2i 622	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})) ↔ (𝑦 ∈ 𝐴 ∧ ∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
34	1, 3, 33	3bitr4ri 303	. . . . . 6 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})) ↔ ∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)))
35	34	exbii 1851	. . . . 5 ⊢ (∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})) ↔ ∃𝑦∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)))
36		excom 2164	. . . . 5 ⊢ (∃𝑦∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)))
37	35, 36	bitri 274	. . . 4 ⊢ (∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})) ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)))
38		eliun 4925	. . . . 5 ⊢ (𝑧 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑦 ∈ 𝐴 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦}))
39		df-rex 3069	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})))
40	38, 39	bitri 274	. . . 4 ⊢ (𝑧 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})))
41		elopab 5433	. . . 4 ⊢ (𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝜓)} ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)))
42	37, 40, 41	3bitr4i 302	. . 3 ⊢ (𝑧 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ↔ 𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝜓)})
43	42	eqriv 2735	. 2 ⊢ ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) = {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝜓)}
44		opabex3rd.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
45		opabex3rd.2	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → {𝑥 ∣ 𝜓} ∈ V)
46		snex 5349	. . . . 5 ⊢ {𝑦} ∈ V
47		xpexg 7578	. . . . 5 ⊢ (({𝑥 ∣ 𝜓} ∈ V ∧ {𝑦} ∈ V) → ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V)
48	45, 46, 47	sylancl 585	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V)
49	48	ralrimiva 3107	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V)
50		iunexg 7779	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V) → ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V)
51	44, 49, 50	syl2anc 583	. 2 ⊢ (𝜑 → ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V)
52	43, 51	eqeltrrid 2844	1 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝜓)} ∈ V)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539  ∃wex 1783  [wsb 2068   ∈ wcel 2108  {cab 2715  ∀wral 3063  ∃wrex 3064  Vcvv 3422  {csn 4558  ⟨cop 4564  ∪ ciun 4921  {copab 5132   × cxp 5578

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426

This theorem is referenced by:  satfvsuclem1  33221  satf0suclem  33237  fmlasuc0  33246