Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ceqsrexv2 Structured version   Visualization version   GIF version

Theorem ceqsrexv2 32851
Description: Alternate elimitation of a restricted existential quantifier, using implicit substitution. (Contributed by Scott Fenton, 5-Sep-2017.)
Hypothesis
Ref Expression
ceqsrexv2.1 (𝑥 = 𝐴 → (𝜑𝜓))
Assertion
Ref Expression
ceqsrexv2 (∃𝑥𝐵 (𝑥 = 𝐴𝜑) ↔ (𝐴𝐵𝜓))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜓,𝑥
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem ceqsrexv2
StepHypRef Expression
1 ceqsrexv2.1 . 2 (𝑥 = 𝐴 → (𝜑𝜓))
21ceqsrexbv 3647 1 (∃𝑥𝐵 (𝑥 = 𝐴𝜑) ↔ (𝐴𝐵𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1528  wcel 2105  wrex 3136
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-ext 2790
This theorem depends on definitions:  df-bi 208  df-an 397  df-ex 1772  df-cleq 2811  df-clel 2890  df-rex 3141
This theorem is referenced by:  ceqsralv2  32853
  Copyright terms: Public domain W3C validator