Theorem ceqsex2v 3218

Description: Elimination of two existential quantifiers, using implicit substitution. (Contributed by Scott Fenton, 7-Jun-2006.)

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		nfv 1830	. 2 ⊢ Ⅎ𝑥𝜓
2		nfv 1830	. 2 ⊢ Ⅎ𝑦𝜒
3		ceqsex2v.1	. 2 ⊢ 𝐴 ∈ V
4		ceqsex2v.2	. 2 ⊢ 𝐵 ∈ V
5		ceqsex2v.3	. 2 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
6		ceqsex2v.4	. 2 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
7	1, 2, 3, 4, 5, 6	ceqsex2 3217	1 ⊢ (∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝜑) ↔ 𝜒)

Syntax hints:   → wi 4   ↔ wb 195   ∧ w3a 1031   = wceq 1475  ∃wex 1695   ∈ wcel 1977  Vcvv 3173

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-ext 2590

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-v 3175

This theorem is referenced by:  ceqsex3v  3219  ceqsex4v  3220  ispos  16770  elfuns  31192  brimg  31214  brapply  31215  brsuccf  31218  brrestrict  31226  dfrdg4  31228  diblsmopel  35478