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

Theorem ceqsex2v 3117
Description: Elimination of two existential quantifiers, using implicit substitution. (Contributed by Scott Fenton, 7-Jun-2006.)
Hypotheses
Ref Expression
ceqsex2v.1  |-  A  e. 
_V
ceqsex2v.2  |-  B  e. 
_V
ceqsex2v.3  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
ceqsex2v.4  |-  ( y  =  B  ->  ( ps 
<->  ch ) )
Assertion
Ref Expression
ceqsex2v  |-  ( E. x E. y ( x  =  A  /\  y  =  B  /\  ph )  <->  ch )
Distinct variable groups:    x, y, A    x, B, y    ps, x    ch, y
Allowed substitution hints:    ph( x, y)    ps( y)    ch( x)

Proof of Theorem ceqsex2v
StepHypRef Expression
1 nfv 1674 . 2  |-  F/ x ps
2 nfv 1674 . 2  |-  F/ y ch
3 ceqsex2v.1 . 2  |-  A  e. 
_V
4 ceqsex2v.2 . 2  |-  B  e. 
_V
5 ceqsex2v.3 . 2  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
6 ceqsex2v.4 . 2  |-  ( y  =  B  ->  ( ps 
<->  ch ) )
71, 2, 3, 4, 5, 6ceqsex2 3116 1  |-  ( E. x E. y ( x  =  A  /\  y  =  B  /\  ph )  <->  ch )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ w3a 965    = wceq 1370   E.wex 1587    e. wcel 1758   _Vcvv 3078
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-10 1777  ax-11 1782  ax-12 1794  ax-ext 2432
This theorem depends on definitions:  df-bi 185  df-an 371  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-clab 2440  df-cleq 2446  df-clel 2449  df-v 3080
This theorem is referenced by:  ceqsex3v  3118  ceqsex4v  3119  ispos  15239  elfuns  28110  brimg  28132  brapply  28133  brsuccf  28136  brrestrict  28144  dfrdg4  28145  diblsmopel  35174
  Copyright terms: Public domain W3C validator