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

Theorem cbvrexv2 2995
Description: Rule used to change the bound variable in a restricted existential quantifier with implicit substitution which also changes the quantifier domain. (Contributed by David Moews, 1-May-2017.)
Hypotheses
Ref Expression
cbvralv2.1  |-  ( x  =  y  ->  ( ps 
<->  ch ) )
cbvralv2.2  |-  ( x  =  y  ->  A  =  B )
Assertion
Ref Expression
cbvrexv2  |-  ( E. x  e.  A  ps  <->  E. y  e.  B  ch )
Distinct variable groups:    y, A    ps, y    x, B    ch, x
Allowed substitution hints:    ps( x)    ch( y)    A( x)    B( y)

Proof of Theorem cbvrexv2
StepHypRef Expression
1 nfcv 2228 . 2  |-  F/_ y A
2 nfcv 2228 . 2  |-  F/_ x B
3 nfv 1466 . 2  |-  F/ y ps
4 nfv 1466 . 2  |-  F/ x ch
5 cbvralv2.2 . 2  |-  ( x  =  y  ->  A  =  B )
6 cbvralv2.1 . 2  |-  ( x  =  y  ->  ( ps 
<->  ch ) )
71, 2, 3, 4, 5, 6cbvrexcsf 2991 1  |-  ( E. x  e.  A  ps  <->  E. y  e.  B  ch )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 103    = wceq 1289   E.wrex 2360
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070
This theorem depends on definitions:  df-bi 115  df-tru 1292  df-nf 1395  df-sb 1693  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-rex 2365  df-sbc 2841  df-csb 2934
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator