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

Theorem cbvrexdva 2540
Description: Rule used to change the bound variable in a restricted existential quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.)
Hypothesis
Ref Expression
cbvraldva.1  |-  ( (
ph  /\  x  =  y )  ->  ( ps 
<->  ch ) )
Assertion
Ref Expression
cbvrexdva  |-  ( ph  ->  ( E. x  e.  A  ps  <->  E. y  e.  A  ch )
)
Distinct variable groups:    ps, y    ch, x    x, A, y    ph, x, y
Allowed substitution hints:    ps( x)    ch( y)

Proof of Theorem cbvrexdva
StepHypRef Expression
1 cbvraldva.1 . 2  |-  ( (
ph  /\  x  =  y )  ->  ( ps 
<->  ch ) )
2 eqidd 2041 . 2  |-  ( (
ph  /\  x  =  y )  ->  A  =  A )
31, 2cbvrexdva2 2538 1  |-  ( ph  ->  ( E. x  e.  A  ps  <->  E. y  e.  A  ch )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    <-> wb 98   E.wrex 2307
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-nf 1350  df-cleq 2033  df-clel 2036  df-rex 2312
This theorem is referenced by:  tfrlem3ag  5924  tfrlem3a  5925  tfrlemi1  5946
  Copyright terms: Public domain W3C validator