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

Theorem cbvralv2 3283
Description: Rule used to change the bound variable in a restricted universal 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
cbvralv2  |-  ( A. x  e.  A  ps  <->  A. 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 cbvralv2
StepHypRef Expression
1 nfcv 2548 . 2  |-  F/_ y A
2 nfcv 2548 . 2  |-  F/_ x B
3 nfv 1626 . 2  |-  F/ y ps
4 nfv 1626 . 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, 6cbvralcsf 3279 1  |-  ( A. x  e.  A  ps  <->  A. y  e.  B  ch )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    = wceq 1649   A.wral 2674
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2393
This theorem depends on definitions:  df-bi 178  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2399  df-cleq 2405  df-clel 2408  df-nfc 2537  df-ral 2679  df-sbc 3130  df-csb 3220
  Copyright terms: Public domain W3C validator