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

Theorem cbvral2vw 2707
Description: Change bound variables of double restricted universal quantification, using implicit substitution. Version of cbvral2v 2709 with a disjoint variable condition, which does not require ax-13 2143. (Contributed by NM, 10-Aug-2004.) (Revised by Gino Giotto, 10-Jan-2024.)
Hypotheses
Ref Expression
cbvral2vw.1  |-  ( x  =  z  ->  ( ph 
<->  ch ) )
cbvral2vw.2  |-  ( y  =  w  ->  ( ch 
<->  ps ) )
Assertion
Ref Expression
cbvral2vw  |-  ( A. x  e.  A  A. y  e.  B  ph  <->  A. z  e.  A  A. w  e.  B  ps )
Distinct variable groups:    x, z    y, w    x, A, z    x, y, B, z    w, B    ph, z    ps, y    ch, x    ch, w
Allowed substitution hints:    ph( x, y, w)    ps( x, z, w)    ch( y, z)    A( y, w)

Proof of Theorem cbvral2vw
StepHypRef Expression
1 cbvral2vw.1 . . . 4  |-  ( x  =  z  ->  ( ph 
<->  ch ) )
21ralbidv 2470 . . 3  |-  ( x  =  z  ->  ( A. y  e.  B  ph  <->  A. y  e.  B  ch ) )
32cbvralvw 2700 . 2  |-  ( A. x  e.  A  A. y  e.  B  ph  <->  A. z  e.  A  A. y  e.  B  ch )
4 cbvral2vw.2 . . . 4  |-  ( y  =  w  ->  ( ch 
<->  ps ) )
54cbvralvw 2700 . . 3  |-  ( A. y  e.  B  ch  <->  A. w  e.  B  ps )
65ralbii 2476 . 2  |-  ( A. z  e.  A  A. y  e.  B  ch  <->  A. z  e.  A  A. w  e.  B  ps )
73, 6bitri 183 1  |-  ( A. x  e.  A  A. y  e.  B  ph  <->  A. z  e.  A  A. w  e.  B  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104   A.wral 2448
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1440  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527
This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-clel 2166  df-ral 2453
This theorem is referenced by:  mhmpropd  12689
  Copyright terms: Public domain W3C validator