Theorem opabex3rd 7705

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 1961	. . . . . . 7 ⊢ (∃𝑥(𝑦 ∈ 𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)) ↔ (𝑦 ∈ 𝐴 ∧ ∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
2		an12 645	. . . . . . . 8 ⊢ ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) ↔ (𝑦 ∈ 𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
3	2	exbii 1854	. . . . . . 7 ⊢ (∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) ↔ ∃𝑥(𝑦 ∈ 𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
4		elxp 5558	. . . . . . . . . 10 ⊢ (𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑤∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ {𝑥 ∣ 𝜓} ∧ 𝑣 ∈ {𝑦})))
5		ancom 464	. . . . . . . . . . . 12 ⊢ ((𝑤 ∈ {𝑥 ∣ 𝜓} ∧ 𝑣 ∈ {𝑦}) ↔ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}))
6	5	anbi2i 626	. . . . . . . . . . 11 ⊢ ((𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ {𝑥 ∣ 𝜓} ∧ 𝑣 ∈ {𝑦})) ↔ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
7	6	2exbii 1855	. . . . . . . . . 10 ⊢ (∃𝑤∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ {𝑥 ∣ 𝜓} ∧ 𝑣 ∈ {𝑦})) ↔ ∃𝑤∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
8	4, 7	bitri 278	. . . . . . . . 9 ⊢ (𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑤∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
9		an12 645	. . . . . . . . . . . . 13 ⊢ ((𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ (𝑣 ∈ {𝑦} ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
10		velsn 4542	. . . . . . . . . . . . . 14 ⊢ (𝑣 ∈ {𝑦} ↔ 𝑣 = 𝑦)
11	10	anbi1i 627	. . . . . . . . . . . . 13 ⊢ ((𝑣 ∈ {𝑦} ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ (𝑣 = 𝑦 ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
12	9, 11	bitri 278	. . . . . . . . . . . 12 ⊢ ((𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ (𝑣 = 𝑦 ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
13	12	exbii 1854	. . . . . . . . . . 11 ⊢ (∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ ∃𝑣(𝑣 = 𝑦 ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
14		opeq2 4771	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑦 → ⟨𝑤, 𝑣⟩ = ⟨𝑤, 𝑦⟩)
15	14	eqeq2d 2750	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑦 → (𝑧 = ⟨𝑤, 𝑣⟩ ↔ 𝑧 = ⟨𝑤, 𝑦⟩))
16	15	anbi1d 633	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑦 → ((𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}) ↔ (𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
17	16	equsexvw 2016	. . . . . . . . . . 11 ⊢ (∃𝑣(𝑣 = 𝑦 ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ (𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}))
18	13, 17	bitri 278	. . . . . . . . . 10 ⊢ (∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ (𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}))
19	18	exbii 1854	. . . . . . . . 9 ⊢ (∃𝑤∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ ∃𝑤(𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}))
20		nfv 1921	. . . . . . . . . . 11 ⊢ Ⅎ𝑥 𝑧 = ⟨𝑤, 𝑦⟩
21		nfsab1 2726	. . . . . . . . . . 11 ⊢ Ⅎ𝑥 𝑤 ∈ {𝑥 ∣ 𝜓}
22	20, 21	nfan 1906	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})
23		nfv 1921	. . . . . . . . . 10 ⊢ Ⅎ𝑤(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
24		opeq1 4769	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑥 → ⟨𝑤, 𝑦⟩ = ⟨𝑥, 𝑦⟩)
25	24	eqeq2d 2750	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑥 → (𝑧 = ⟨𝑤, 𝑦⟩ ↔ 𝑧 = ⟨𝑥, 𝑦⟩))
26		df-clab 2718	. . . . . . . . . . . 12 ⊢ (𝑤 ∈ {𝑥 ∣ 𝜓} ↔ [𝑤 / 𝑥]𝜓)
27		sbequ12 2253	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑤 → (𝜓 ↔ [𝑤 / 𝑥]𝜓))
28	27	equcoms 2032	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑥 → (𝜓 ↔ [𝑤 / 𝑥]𝜓))
29	26, 28	bitr4id 293	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑥 → (𝑤 ∈ {𝑥 ∣ 𝜓} ↔ 𝜓))
30	25, 29	anbi12d 634	. . . . . . . . . 10 ⊢ (𝑤 = 𝑥 → ((𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}) ↔ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
31	22, 23, 30	cbvexv1 2345	. . . . . . . . 9 ⊢ (∃𝑤(𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}) ↔ ∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
32	8, 19, 31	3bitri 300	. . . . . . . 8 ⊢ (𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
33	32	anbi2i 626	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})) ↔ (𝑦 ∈ 𝐴 ∧ ∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
34	1, 3, 33	3bitr4ri 307	. . . . . 6 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})) ↔ ∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)))
35	34	exbii 1854	. . . . 5 ⊢ (∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})) ↔ ∃𝑦∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)))
36		excom 2170	. . . . 5 ⊢ (∃𝑦∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)))
37	35, 36	bitri 278	. . . 4 ⊢ (∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})) ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)))
38		eliun 4895	. . . . 5 ⊢ (𝑧 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑦 ∈ 𝐴 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦}))
39		df-rex 3060	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})))
40	38, 39	bitri 278	. . . 4 ⊢ (𝑧 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})))
41		elopab 5392	. . . 4 ⊢ (𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝜓)} ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)))
42	37, 40, 41	3bitr4i 306	. . 3 ⊢ (𝑧 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ↔ 𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝜓)})
43	42	eqriv 2736	. 2 ⊢ ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) = {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝜓)}
44		opabex3rd.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
45		opabex3rd.2	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → {𝑥 ∣ 𝜓} ∈ V)
46		snex 5308	. . . . 5 ⊢ {𝑦} ∈ V
47		xpexg 7504	. . . . 5 ⊢ (({𝑥 ∣ 𝜓} ∈ V ∧ {𝑦} ∈ V) → ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V)
48	45, 46, 47	sylancl 589	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V)
49	48	ralrimiva 3097	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V)
50		iunexg 7702	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V) → ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V)
51	44, 49, 50	syl2anc 587	. 2 ⊢ (𝜑 → ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V)
52	43, 51	eqeltrrid 2839	1 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝜓)} ∈ V)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1542  ∃wex 1786  [wsb 2074   ∈ wcel 2114  {cab 2717  ∀wral 3054  ∃wrex 3055  Vcvv 3400  {csn 4526  ⟨cop 4532  ∪ ciun 4891  {copab 5102   × cxp 5533

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 1975  ax-7 2020  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2162  ax-12 2179  ax-ext 2711  ax-rep 5164  ax-sep 5177  ax-nul 5184  ax-pow 5242  ax-pr 5306  ax-un 7492

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2075  df-mo 2541  df-eu 2571  df-clab 2718  df-cleq 2731  df-clel 2812  df-nfc 2882  df-ne 2936  df-ral 3059  df-rex 3060  df-reu 3061  df-rab 3063  df-v 3402  df-sbc 3686  df-csb 3801  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4222  df-if 4425  df-pw 4500  df-sn 4527  df-pr 4529  df-op 4533  df-uni 4807  df-iun 4893  df-br 5041  df-opab 5103  df-mpt 5121  df-id 5439  df-xp 5541  df-rel 5542  df-cnv 5543  df-co 5544  df-dm 5545  df-rn 5546  df-res 5547  df-ima 5548  df-iota 6308  df-fun 6352  df-fn 6353  df-f 6354  df-f1 6355  df-fo 6356  df-f1o 6357  df-fv 6358

This theorem is referenced by:  satfvsuclem1  32905  satf0suclem  32921  fmlasuc0  32930