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

Theorem ceqsexgv 3060
 Description: Elimination of an existential quantifier, using implicit substitution. (Contributed by NM, 29-Dec-1996.)
Hypothesis
Ref Expression
ceqsexgv.1
Assertion
Ref Expression
ceqsexgv
Distinct variable groups:   ,   ,
Allowed substitution hints:   ()   ()

Proof of Theorem ceqsexgv
StepHypRef Expression
1 nfv 1629 . 2
2 ceqsexgv.1 . 2
31, 2ceqsexg 3059 1
 Colors of variables: wff set class Syntax hints:   wi 4   wb 177   wa 359  wex 1550   wceq 1652   wcel 1725 This theorem is referenced by:  ceqsrexv  3061  clel3g  3065  elxp5  5350  xpsnen  7184  isssc  14012  metuel2  18601  isgrpo  21776  ismgm  21900  ceqsex3vOLD  26701  pmapjat1  30587 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416 This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-v 2950
 Copyright terms: Public domain W3C validator