Theorem rexcom4b 3504

Description: Specialized existential commutation lemma. (Contributed by Jeff Madsen, 1-Jun-2011.)

Hypothesis

Ref	Expression
rexcom4b.1	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
rexcom4b	⊢ (∃𝑥∃𝑦 ∈ 𝐴 (𝜑 ∧ 𝑥 = 𝐵) ↔ ∃𝑦 ∈ 𝐴 𝜑)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑦   𝜑,𝑥

Allowed substitution hints:   𝜑(𝑦)   𝐴(𝑦)   𝐵(𝑦)

Proof of Theorem rexcom4b

Step	Hyp	Ref	Expression
1		rexcom4a 3290	. 2 ⊢ (∃𝑥∃𝑦 ∈ 𝐴 (𝜑 ∧ 𝑥 = 𝐵) ↔ ∃𝑦 ∈ 𝐴 (𝜑 ∧ ∃𝑥 𝑥 = 𝐵))
2		rexcom4b.1	. . . . 5 ⊢ 𝐵 ∈ V
3	2	isseti 3490	. . . 4 ⊢ ∃𝑥 𝑥 = 𝐵
4	3	biantru 531	. . 3 ⊢ (𝜑 ↔ (𝜑 ∧ ∃𝑥 𝑥 = 𝐵))
5	4	rexbii 3095	. 2 ⊢ (∃𝑦 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐴 (𝜑 ∧ ∃𝑥 𝑥 = 𝐵))
6	1, 5	bitr4i 278	1 ⊢ (∃𝑥∃𝑦 ∈ 𝐴 (𝜑 ∧ 𝑥 = 𝐵) ↔ ∃𝑦 ∈ 𝐴 𝜑)

Syntax hints:   ↔ wb 205   ∧ wa 397   = wceq 1542  ∃wex 1782   ∈ wcel 2107  ∃wrex 3071  Vcvv 3475

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 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-11 2155

This theorem depends on definitions:  df-bi 206  df-an 398  df-ex 1783  df-clel 2811  df-rex 3072

This theorem is referenced by:  islshpat  37793