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

Theorem ceqsexgv 2900
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 1605 . 2  |-  F/ x ps
2 ceqsexgv.1 . 2  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
31, 2ceqsexg 2899 1  |-  ( A  e.  V  ->  ( E. x ( x  =  A  /\  ph )  <->  ps ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358   E.wex 1528    = wceq 1623    e. wcel 1684
This theorem is referenced by:  ceqsrexv  2901  clel3g  2905  elxp5  5161  xpsnen  6946  isssc  13697  isgrpo  20863  ismgm  20987  islatalg  25183  ceqsex3vOLD  26727  pmapjat1  30042
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-v 2790
  Copyright terms: Public domain W3C validator