Theorem rexopabb 5434

Description: Restricted existential quantification over an ordered-pair class abstraction. (Contributed by AV, 8-Nov-2023.)

Hypotheses

Ref	Expression
rexopabb.o	⊢ 𝑂 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
rexopabb.p	⊢ (𝑜 = ⟨𝑥, 𝑦⟩ → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
rexopabb	⊢ (∃𝑜 ∈ 𝑂 𝜓 ↔ ∃𝑥∃𝑦(𝜑 ∧ 𝜒))

Distinct variable groups:   𝑜,𝑂   𝑥,𝑜,𝑦   𝜑,𝑜   𝜓,𝑥,𝑦   𝜒,𝑜

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑜)   𝜒(𝑥,𝑦)   𝑂(𝑥,𝑦)

Proof of Theorem rexopabb

Step	Hyp	Ref	Expression
1		rexopabb.o	. . 3 ⊢ 𝑂 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
2	1	rexeqi 3338	. 2 ⊢ (∃𝑜 ∈ 𝑂 𝜓 ↔ ∃𝑜 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}𝜓)
3		elopab 5433	. . . . 5 ⊢ (𝑜 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥∃𝑦(𝑜 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
4		simprr 769	. . . . . . . . 9 ⊢ ((𝜓 ∧ (𝑜 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) → 𝜑)
5		rexopabb.p	. . . . . . . . . . . 12 ⊢ (𝑜 = ⟨𝑥, 𝑦⟩ → (𝜓 ↔ 𝜒))
6	5	biimpd 228	. . . . . . . . . . 11 ⊢ (𝑜 = ⟨𝑥, 𝑦⟩ → (𝜓 → 𝜒))
7	6	adantr 480	. . . . . . . . . 10 ⊢ ((𝑜 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (𝜓 → 𝜒))
8	7	impcom 407	. . . . . . . . 9 ⊢ ((𝜓 ∧ (𝑜 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) → 𝜒)
9	4, 8	jca 511	. . . . . . . 8 ⊢ ((𝜓 ∧ (𝑜 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) → (𝜑 ∧ 𝜒))
10	9	ex 412	. . . . . . 7 ⊢ (𝜓 → ((𝑜 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (𝜑 ∧ 𝜒)))
11	10	2eximdv 1923	. . . . . 6 ⊢ (𝜓 → (∃𝑥∃𝑦(𝑜 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ∃𝑥∃𝑦(𝜑 ∧ 𝜒)))
12	11	impcom 407	. . . . 5 ⊢ ((∃𝑥∃𝑦(𝑜 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∧ 𝜓) → ∃𝑥∃𝑦(𝜑 ∧ 𝜒))
13	3, 12	sylanb 580	. . . 4 ⊢ ((𝑜 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∧ 𝜓) → ∃𝑥∃𝑦(𝜑 ∧ 𝜒))
14	13	rexlimiva 3209	. . 3 ⊢ (∃𝑜 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}𝜓 → ∃𝑥∃𝑦(𝜑 ∧ 𝜒))
15		nfopab1 5140	. . . . 5 ⊢ Ⅎ𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}
16		nfv 1918	. . . . 5 ⊢ Ⅎ𝑥𝜓
17	15, 16	nfrex 3237	. . . 4 ⊢ Ⅎ𝑥∃𝑜 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}𝜓
18		nfopab2 5141	. . . . . 6 ⊢ Ⅎ𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑}
19		nfv 1918	. . . . . 6 ⊢ Ⅎ𝑦𝜓
20	18, 19	nfrex 3237	. . . . 5 ⊢ Ⅎ𝑦∃𝑜 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}𝜓
21		opabidw 5431	. . . . . 6 ⊢ (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜑)
22		opex 5373	. . . . . . 7 ⊢ ⟨𝑥, 𝑦⟩ ∈ V
23	22, 5	sbcie 3754	. . . . . 6 ⊢ ([⟨𝑥, 𝑦⟩ / 𝑜]𝜓 ↔ 𝜒)
24		rspesbca 3810	. . . . . 6 ⊢ ((⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∧ [⟨𝑥, 𝑦⟩ / 𝑜]𝜓) → ∃𝑜 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}𝜓)
25	21, 23, 24	syl2anbr 598	. . . . 5 ⊢ ((𝜑 ∧ 𝜒) → ∃𝑜 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}𝜓)
26	20, 25	exlimi 2213	. . . 4 ⊢ (∃𝑦(𝜑 ∧ 𝜒) → ∃𝑜 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}𝜓)
27	17, 26	exlimi 2213	. . 3 ⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜒) → ∃𝑜 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}𝜓)
28	14, 27	impbii 208	. 2 ⊢ (∃𝑜 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}𝜓 ↔ ∃𝑥∃𝑦(𝜑 ∧ 𝜒))
29	2, 28	bitri 274	1 ⊢ (∃𝑜 ∈ 𝑂 𝜓 ↔ ∃𝑥∃𝑦(𝜑 ∧ 𝜒))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539  ∃wex 1783   ∈ wcel 2108  ∃wrex 3064  [wsbc 3711  ⟨cop 4564  {copab 5132

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-sep 5218  ax-nul 5225  ax-pr 5347

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-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-dif 3886  df-un 3888  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-opab 5133

This theorem is referenced by:  satfv1  33225