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

Theorem rexeqbii 2943
Description: Equality deduction for restricted existential quantifier, changing both formula and quantifier domain. Inference form. (Contributed by David Moews, 1-May-2017.)
Hypotheses
Ref Expression
rexeqbii.1  |-  A  =  B
rexeqbii.2  |-  ( ps  <->  ch )
Assertion
Ref Expression
rexeqbii  |-  ( E. x  e.  A  ps  <->  E. x  e.  B  ch )

Proof of Theorem rexeqbii
StepHypRef Expression
1 rexeqbii.1 . . . 4  |-  A  =  B
21eleq2i 2500 . . 3  |-  ( x  e.  A  <->  x  e.  B )
3 rexeqbii.2 . . 3  |-  ( ps  <->  ch )
42, 3anbi12i 701 . 2  |-  ( ( x  e.  A  /\  ps )  <->  ( x  e.  B  /\  ch )
)
54rexbii2 2925 1  |-  ( E. x  e.  A  ps  <->  E. x  e.  B  ch )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 187    = wceq 1437    e. wcel 1868   E.wrex 2776
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1665  ax-4 1678  ax-ext 2400
This theorem depends on definitions:  df-bi 188  df-an 372  df-ex 1660  df-cleq 2414  df-clel 2417  df-rex 2781
This theorem is referenced by:  bnj882  29730
  Copyright terms: Public domain W3C validator