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

Theorem rexeqdv 2738
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 2732 . 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 1398   E.wrex 2512
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-cleq 2224  df-clel 2227  df-nfc 2364  df-rex 2517
This theorem is referenced by:  rexeqtrdv  2740  rexeqtrrdv  2742  rexeqbidv  2748  rexeqbidva  2750  fnunirn  5918  cbvexfo  5937  fival  7229  nninfwlpoimlemg  7434  nninfwlpoimlemginf  7435  nninfwlpoim  7438  nninfinfwlpo  7439  genipv  7789  exfzdc  10549  infssuzex  10556  nninfdcex  10560  zproddc  12220  ennnfonelemrnh  13117  grppropd  13680  dvdsrpropdg  14242  znunit  14755  cnpfval  15006  plyval  15543  uhgrvtxedgiedgb  16084  wlkvtxedg  16304
  Copyright terms: Public domain W3C validator