Theorem ceqsrex2v 3587

Description: Elimination of a restricted existential quantifier, using implicit substitution. (Contributed by NM, 29-Oct-2005.)

Hypotheses

Ref	Expression
ceqsrex2v.1	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
ceqsrex2v.2	⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
ceqsrex2v	⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ 𝜑) ↔ 𝜒))

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

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

Proof of Theorem ceqsrex2v

Step	Hyp	Ref	Expression
1		anass 469	. . . . . 6 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ 𝜑) ↔ (𝑥 = 𝐴 ∧ (𝑦 = 𝐵 ∧ 𝜑)))
2	1	rexbii 3181	. . . . 5 ⊢ (∃𝑦 ∈ 𝐷 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐷 (𝑥 = 𝐴 ∧ (𝑦 = 𝐵 ∧ 𝜑)))
3		r19.42v 3279	. . . . 5 ⊢ (∃𝑦 ∈ 𝐷 (𝑥 = 𝐴 ∧ (𝑦 = 𝐵 ∧ 𝜑)) ↔ (𝑥 = 𝐴 ∧ ∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜑)))
4	2, 3	bitri 274	. . . 4 ⊢ (∃𝑦 ∈ 𝐷 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ 𝜑) ↔ (𝑥 = 𝐴 ∧ ∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜑)))
5	4	rexbii 3181	. . 3 ⊢ (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ 𝜑) ↔ ∃𝑥 ∈ 𝐶 (𝑥 = 𝐴 ∧ ∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜑)))
6		ceqsrex2v.1	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
7	6	anbi2d 629	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑦 = 𝐵 ∧ 𝜑) ↔ (𝑦 = 𝐵 ∧ 𝜓)))
8	7	rexbidv 3226	. . . 4 ⊢ (𝑥 = 𝐴 → (∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜓)))
9	8	ceqsrexv 3585	. . 3 ⊢ (𝐴 ∈ 𝐶 → (∃𝑥 ∈ 𝐶 (𝑥 = 𝐴 ∧ ∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜑)) ↔ ∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜓)))
10	5, 9	bitrid 282	. 2 ⊢ (𝐴 ∈ 𝐶 → (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜓)))
11		ceqsrex2v.2	. . 3 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
12	11	ceqsrexv 3585	. 2 ⊢ (𝐵 ∈ 𝐷 → (∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜓) ↔ 𝜒))
13	10, 12	sylan9bb 510	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ 𝜑) ↔ 𝜒))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106  ∃wrex 3065

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1542  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-rex 3070

This theorem is referenced by:  opiota  7899  brdom7disj  10287  brdom6disj  10288  lsmspsn  20346