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

Theorem rexeqbidva 2751
Description: Equality deduction for restricted universal quantifier. (Contributed by Mario Carneiro, 5-Jan-2017.)
Hypotheses
Ref Expression
raleqbidva.1  |-  ( ph  ->  A  =  B )
raleqbidva.2  |-  ( (
ph  /\  x  e.  A )  ->  ( ps 
<->  ch ) )
Assertion
Ref Expression
rexeqbidva  |-  ( ph  ->  ( E. x  e.  A  ps  <->  E. x  e.  B  ch )
)
Distinct variable groups:    x, A    x, B    ph, x
Allowed substitution hints:    ps( x)    ch( x)

Proof of Theorem rexeqbidva
StepHypRef Expression
1 raleqbidva.2 . . 3  |-  ( (
ph  /\  x  e.  A )  ->  ( ps 
<->  ch ) )
21rexbidva 2560 . 2  |-  ( ph  ->  ( E. x  e.  A  ps  <->  E. x  e.  A  ch )
)
3 raleqbidva.1 . . 3  |-  ( ph  ->  A  =  B )
43rexeqdv 2743 . 2  |-  ( ph  ->  ( E. x  e.  A  ch  <->  E. x  e.  B  ch )
)
52, 4bitrd 244 1  |-  ( ph  ->  ( E. x  e.  A  ps  <->  E. x  e.  B  ch )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1623    e. wcel 1684   E.wrex 2544
This theorem is referenced by:  catpropd  13612
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-cleq 2276  df-clel 2279  df-nfc 2408  df-rex 2549
  Copyright terms: Public domain W3C validator