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

Theorem cbval2 1796
Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 22-Dec-2003.) (Revised by Mario Carneiro, 6-Oct-2016.) (Proof shortened by Wolf Lammen, 22-Apr-2018.)
Hypotheses
Ref Expression
cbval2.1  |-  F/ z
ph
cbval2.2  |-  F/ w ph
cbval2.3  |-  F/ x ps
cbval2.4  |-  F/ y ps
cbval2.5  |-  ( ( x  =  z  /\  y  =  w )  ->  ( ph  <->  ps )
)
Assertion
Ref Expression
cbval2  |-  ( A. x A. y ph  <->  A. z A. w ps )
Distinct variable groups:    x, y    y,
z    x, w    z, w
Allowed substitution hints:    ph( x, y, z, w)    ps( x, y, z, w)

Proof of Theorem cbval2
StepHypRef Expression
1 cbval2.1 . . 3  |-  F/ z
ph
21nfal 1468 . 2  |-  F/ z A. y ph
3 cbval2.3 . . 3  |-  F/ x ps
43nfal 1468 . 2  |-  F/ x A. w ps
5 nfv 1421 . . . . . 6  |-  F/ w  x  =  z
6 cbval2.2 . . . . . 6  |-  F/ w ph
75, 6nfim 1464 . . . . 5  |-  F/ w
( x  =  z  ->  ph )
8 nfv 1421 . . . . . 6  |-  F/ y  x  =  z
9 cbval2.4 . . . . . 6  |-  F/ y ps
108, 9nfim 1464 . . . . 5  |-  F/ y ( x  =  z  ->  ps )
11 cbval2.5 . . . . . . 7  |-  ( ( x  =  z  /\  y  =  w )  ->  ( ph  <->  ps )
)
1211expcom 109 . . . . . 6  |-  ( y  =  w  ->  (
x  =  z  -> 
( ph  <->  ps ) ) )
1312pm5.74d 171 . . . . 5  |-  ( y  =  w  ->  (
( x  =  z  ->  ph )  <->  ( x  =  z  ->  ps )
) )
147, 10, 13cbval 1637 . . . 4  |-  ( A. y ( x  =  z  ->  ph )  <->  A. w
( x  =  z  ->  ps ) )
15 19.21v 1753 . . . 4  |-  ( A. y ( x  =  z  ->  ph )  <->  ( x  =  z  ->  A. y ph ) )
16 19.21v 1753 . . . 4  |-  ( A. w ( x  =  z  ->  ps )  <->  ( x  =  z  ->  A. w ps ) )
1714, 15, 163bitr3i 199 . . 3  |-  ( ( x  =  z  ->  A. y ph )  <->  ( x  =  z  ->  A. w ps ) )
1817pm5.74ri 170 . 2  |-  ( x  =  z  ->  ( A. y ph  <->  A. w ps ) )
192, 4, 18cbval 1637 1  |-  ( A. x A. y ph  <->  A. z A. w ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    <-> wb 98   A.wal 1241   F/wnf 1349
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-i5r 1428
This theorem depends on definitions:  df-bi 110  df-nf 1350
This theorem is referenced by:  cbval2v  1798
  Copyright terms: Public domain W3C validator