MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rexcom4b Structured version   Visualization version   GIF version

Theorem rexcom4b 3502
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
StepHypRef Expression
1 rexcom4a 3287 . 2 (∃𝑥𝑦𝐴 (𝜑𝑥 = 𝐵) ↔ ∃𝑦𝐴 (𝜑 ∧ ∃𝑥 𝑥 = 𝐵))
2 rexcom4b.1 . . . . 5 𝐵 ∈ V
32isseti 3488 . . . 4 𝑥 𝑥 = 𝐵
43biantru 528 . . 3 (𝜑 ↔ (𝜑 ∧ ∃𝑥 𝑥 = 𝐵))
54rexbii 3092 . 2 (∃𝑦𝐴 𝜑 ↔ ∃𝑦𝐴 (𝜑 ∧ ∃𝑥 𝑥 = 𝐵))
61, 5bitr4i 277 1 (∃𝑥𝑦𝐴 (𝜑𝑥 = 𝐵) ↔ ∃𝑦𝐴 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 394   = wceq 1539  wex 1779  wcel 2104  wrex 3068  Vcvv 3472
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-11 2152
This theorem depends on definitions:  df-bi 206  df-an 395  df-ex 1780  df-clel 2808  df-rex 3069
This theorem is referenced by:  islshpat  38190
  Copyright terms: Public domain W3C validator