Theorem ceqsex2v 3548

Description: Elimination of two existential quantifiers, using implicit substitution. (Contributed by Scott Fenton, 7-Jun-2006.) Avoid ax-10 2141 and ax-11 2158. (Revised by GG, 20-Aug-2023.)

Hypotheses

Ref	Expression
ceqsex2v.1	⊢ 𝐴 ∈ V
ceqsex2v.2	⊢ 𝐵 ∈ V
ceqsex2v.3	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
ceqsex2v.4	⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
ceqsex2v	⊢ (∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝜑) ↔ 𝜒)

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝜓,𝑥   𝜒,𝑦

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

Proof of Theorem ceqsex2v

Step	Hyp	Ref	Expression
1		3anass 1095	. . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝜑) ↔ (𝑥 = 𝐴 ∧ (𝑦 = 𝐵 ∧ 𝜑)))
2	1	exbii 1846	. . . 4 ⊢ (∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝜑) ↔ ∃𝑦(𝑥 = 𝐴 ∧ (𝑦 = 𝐵 ∧ 𝜑)))
3		19.42v 1953	. . . 4 ⊢ (∃𝑦(𝑥 = 𝐴 ∧ (𝑦 = 𝐵 ∧ 𝜑)) ↔ (𝑥 = 𝐴 ∧ ∃𝑦(𝑦 = 𝐵 ∧ 𝜑)))
4	2, 3	bitri 275	. . 3 ⊢ (∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝜑) ↔ (𝑥 = 𝐴 ∧ ∃𝑦(𝑦 = 𝐵 ∧ 𝜑)))
5	4	exbii 1846	. 2 ⊢ (∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝜑) ↔ ∃𝑥(𝑥 = 𝐴 ∧ ∃𝑦(𝑦 = 𝐵 ∧ 𝜑)))
6		ceqsex2v.1	. . 3 ⊢ 𝐴 ∈ V
7		ceqsex2v.3	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
8	7	anbi2d 629	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝑦 = 𝐵 ∧ 𝜑) ↔ (𝑦 = 𝐵 ∧ 𝜓)))
9	8	exbidv 1920	. . 3 ⊢ (𝑥 = 𝐴 → (∃𝑦(𝑦 = 𝐵 ∧ 𝜑) ↔ ∃𝑦(𝑦 = 𝐵 ∧ 𝜓)))
10	6, 9	ceqsexv 3542	. 2 ⊢ (∃𝑥(𝑥 = 𝐴 ∧ ∃𝑦(𝑦 = 𝐵 ∧ 𝜑)) ↔ ∃𝑦(𝑦 = 𝐵 ∧ 𝜓))
11		ceqsex2v.2	. . 3 ⊢ 𝐵 ∈ V
12		ceqsex2v.4	. . 3 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
13	11, 12	ceqsexv 3542	. 2 ⊢ (∃𝑦(𝑦 = 𝐵 ∧ 𝜓) ↔ 𝜒)
14	5, 10, 13	3bitri 297	1 ⊢ (∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝜑) ↔ 𝜒)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1537  ∃wex 1777   ∈ wcel 2108  Vcvv 3488

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110

This theorem depends on definitions:  df-bi 207  df-an 396  df-3an 1089  df-ex 1778  df-clel 2819

This theorem is referenced by:  ceqsex3v  3549  ceqsex4v  3550  ispos  18384  elfuns  35879  brimg  35901  brapply  35902  brsuccf  35905  brrestrict  35913  dfrdg4  35915  diblsmopel  41128