ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  rexeqdv Unicode version

Theorem rexeqdv 2737
Description: Equality deduction for restricted existential quantifier. (Contributed by NM, 14-Jan-2007.)
Hypothesis
Ref Expression
raleq1d.1  |-  ( ph  ->  A  =  B )
Assertion
Ref Expression
rexeqdv  |-  ( ph  ->  ( E. x  e.  A  ps  <->  E. x  e.  B  ps )
)
Distinct variable groups:    x, A    x, B
Allowed substitution hints:    ph( x)    ps( x)

Proof of Theorem rexeqdv
StepHypRef Expression
1 raleq1d.1 . 2  |-  ( ph  ->  A  =  B )
2 rexeq 2731 . 2  |-  ( A  =  B  ->  ( E. x  e.  A  ps 
<->  E. x  e.  B  ps ) )
31, 2syl 14 1  |-  ( ph  ->  ( E. x  e.  A  ps  <->  E. x  e.  B  ps )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1397   E.wrex 2511
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-cleq 2224  df-clel 2227  df-nfc 2363  df-rex 2516
This theorem is referenced by:  rexeqtrdv  2739  rexeqtrrdv  2741  rexeqbidv  2747  rexeqbidva  2749  fnunirn  5907  cbvexfo  5926  fival  7168  nninfwlpoimlemg  7373  nninfwlpoimlemginf  7374  nninfwlpoim  7377  nninfinfwlpo  7378  genipv  7728  exfzdc  10485  infssuzex  10492  nninfdcex  10496  zproddc  12139  ennnfonelemrnh  13036  grppropd  13599  dvdsrpropdg  14160  znunit  14672  cnpfval  14918  plyval  15455  uhgrvtxedgiedgb  15993  wlkvtxedg  16213
  Copyright terms: Public domain W3C validator