Theorem opabex3rd 7967

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 1986	. . . . . . 7 ⊢ (∃𝑥(𝑦 ∈ 𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)) ↔ (𝑦 ∈ 𝐴 ∧ ∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
2		an12 658	. . . . . . . 8 ⊢ ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) ↔ (𝑦 ∈ 𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
3	2	exbii 1881	. . . . . . 7 ⊢ (∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) ↔ ∃𝑥(𝑦 ∈ 𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
4		elxp 5674	. . . . . . . . . 10 ⊢ (𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑤∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ {𝑥 ∣ 𝜓} ∧ 𝑣 ∈ {𝑦})))
5		ancom 466	. . . . . . . . . . . 12 ⊢ ((𝑤 ∈ {𝑥 ∣ 𝜓} ∧ 𝑣 ∈ {𝑦}) ↔ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}))
6	5	anbi2i 635	. . . . . . . . . . 11 ⊢ ((𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ {𝑥 ∣ 𝜓} ∧ 𝑣 ∈ {𝑦})) ↔ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
7	6	2exbii 1882	. . . . . . . . . 10 ⊢ (∃𝑤∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ {𝑥 ∣ 𝜓} ∧ 𝑣 ∈ {𝑦})) ↔ ∃𝑤∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
8	4, 7	bitri 278	. . . . . . . . 9 ⊢ (𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑤∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
9		an12 658	. . . . . . . . . . . . 13 ⊢ ((𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ (𝑣 ∈ {𝑦} ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
10		velsn 4600	. . . . . . . . . . . . . 14 ⊢ (𝑣 ∈ {𝑦} ↔ 𝑣 = 𝑦)
11	10	anbi1i 636	. . . . . . . . . . . . 13 ⊢ ((𝑣 ∈ {𝑦} ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ (𝑣 = 𝑦 ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
12	9, 11	bitri 278	. . . . . . . . . . . 12 ⊢ ((𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ (𝑣 = 𝑦 ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
13	12	exbii 1881	. . . . . . . . . . 11 ⊢ (∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ ∃𝑣(𝑣 = 𝑦 ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
14		opeq2 4834	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑦 → ⟨𝑤, 𝑣⟩ = ⟨𝑤, 𝑦⟩)
15	14	eqeq2d 2772	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑦 → (𝑧 = ⟨𝑤, 𝑣⟩ ↔ 𝑧 = ⟨𝑤, 𝑦⟩))
16	15	anbi1d 643	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑦 → ((𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}) ↔ (𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})))
17	16	equsexvw 2038	. . . . . . . . . . 11 ⊢ (∃𝑣(𝑣 = 𝑦 ∧ (𝑧 = ⟨𝑤, 𝑣⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ (𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}))
18	13, 17	bitri 278	. . . . . . . . . 10 ⊢ (∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ (𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}))
19	18	exbii 1881	. . . . . . . . 9 ⊢ (∃𝑤∃𝑣(𝑧 = ⟨𝑤, 𝑣⟩ ∧ (𝑣 ∈ {𝑦} ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})) ↔ ∃𝑤(𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}))
20		nfv 1947	. . . . . . . . . . 11 ⊢ Ⅎ𝑥 𝑧 = ⟨𝑤, 𝑦⟩
21		nfsab1 2747	. . . . . . . . . . 11 ⊢ Ⅎ𝑥 𝑤 ∈ {𝑥 ∣ 𝜓}
22	20, 21	nfan 1932	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓})
23		nfv 1947	. . . . . . . . . 10 ⊢ Ⅎ𝑤(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
24		opeq1 4833	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑥 → ⟨𝑤, 𝑦⟩ = ⟨𝑥, 𝑦⟩)
25	24	eqeq2d 2772	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑥 → (𝑧 = ⟨𝑤, 𝑦⟩ ↔ 𝑧 = ⟨𝑥, 𝑦⟩))
26		df-clab 2740	. . . . . . . . . . . 12 ⊢ (𝑤 ∈ {𝑥 ∣ 𝜓} ↔ [𝑤 / 𝑥]𝜓)
27		sbequ12 2287	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑤 → (𝜓 ↔ [𝑤 / 𝑥]𝜓))
28	27	equcoms 2053	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑥 → (𝜓 ↔ [𝑤 / 𝑥]𝜓))
29	26, 28	bitr4id 293	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑥 → (𝑤 ∈ {𝑥 ∣ 𝜓} ↔ 𝜓))
30	25, 29	anbi12d 644	. . . . . . . . . 10 ⊢ (𝑤 = 𝑥 → ((𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}) ↔ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
31	22, 23, 30	cbvexv1 2372	. . . . . . . . 9 ⊢ (∃𝑤(𝑧 = ⟨𝑤, 𝑦⟩ ∧ 𝑤 ∈ {𝑥 ∣ 𝜓}) ↔ ∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
32	8, 19, 31	3bitri 300	. . . . . . . 8 ⊢ (𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
33	32	anbi2i 635	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})) ↔ (𝑦 ∈ 𝐴 ∧ ∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
34	1, 3, 33	3bitr4ri 307	. . . . . 6 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})) ↔ ∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)))
35	34	exbii 1881	. . . . 5 ⊢ (∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})) ↔ ∃𝑦∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)))
36		excom 2199	. . . . 5 ⊢ (∃𝑦∃𝑥(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)))
37	35, 36	bitri 278	. . . 4 ⊢ (∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})) ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)))
38		eliun 4955	. . . . 5 ⊢ (𝑧 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑦 ∈ 𝐴 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦}))
39		df-rex 3088	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})))
40	38, 39	bitri 278	. . . 4 ⊢ (𝑧 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ({𝑥 ∣ 𝜓} × {𝑦})))
41		elopab 5501	. . . 4 ⊢ (𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝜓)} ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)))
42	37, 40, 41	3bitr4i 306	. . 3 ⊢ (𝑧 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ↔ 𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝜓)})
43	42	eqriv 2758	. 2 ⊢ ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) = {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝜓)}
44		opabex3rd.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
45		opabex3rd.2	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → {𝑥 ∣ 𝜓} ∈ V)
46		vsnex 5393	. . . . 5 ⊢ {𝑦} ∈ V
47		xpexg 7753	. . . . 5 ⊢ (({𝑥 ∣ 𝜓} ∈ V ∧ {𝑦} ∈ V) → ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V)
48	45, 46, 47	sylancl 598	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V)
49	48	ralrimiva 3155	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V)
50		iunexg 7964	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V) → ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V)
51	44, 49, 50	syl2anc 596	. 2 ⊢ (𝜑 → ∪ 𝑦 ∈ 𝐴 ({𝑥 ∣ 𝜓} × {𝑦}) ∈ V)
52	43, 51	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:  satfvsuclem1  36093  satf0suclem  36109  fmlasuc0  36118