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

Theorem ceqsexgv 3335
Description: Elimination of an existential quantifier, using implicit substitution. (Contributed by NM, 29-Dec-1996.)
Hypothesis
Ref Expression
ceqsexgv.1  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
ceqsexgv  |-  ( A  e.  V  ->  ( E. x ( x  =  A  /\  ph )  <->  ps ) )
Distinct variable groups:    x, A    ps, x
Allowed substitution hints:    ph( x)    V( x)

Proof of Theorem ceqsexgv
StepHypRef Expression
1 nfv 1843 . 2  |-  F/ x ps
2 ceqsexgv.1 . 2  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
31, 2ceqsexg 3334 1  |-  ( A  e.  V  ->  ( E. x ( x  =  A  /\  ph )  <->  ps ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    = wceq 1483   E.wex 1704    e. wcel 1990
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-12 2047  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-v 3202
This theorem is referenced by:  ceqsrexv  3336  clel3g  3340  elxp5  7111  xpsnen  8044  isssc  16480  metuel2  22370  isgrpo  27351  bj-finsumval0  33147  ismgmOLD  33649  pmapjat1  35139
  Copyright terms: Public domain W3C validator