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

Theorem sbcom2v 1973
Description: Lemma for proving sbcom2 1975. It is the same as sbcom2 1975 but with additional distinct variable constraints on  x and  y, and on  w and  z. (Contributed by Jim Kingdon, 19-Feb-2018.)
Assertion
Ref Expression
sbcom2v  |-  ( [ w  /  z ] [ y  /  x ] ph  <->  [ y  /  x ] [ w  /  z ] ph )
Distinct variable groups:    x, w, z   
x, y, z
Allowed substitution hints:    ph( x, y, z, w)

Proof of Theorem sbcom2v
StepHypRef Expression
1 alcom 1466 . . 3  |-  ( A. z A. x ( x  =  y  ->  (
z  =  w  ->  ph ) )  <->  A. x A. z ( x  =  y  ->  ( z  =  w  ->  ph )
) )
2 bi2.04 247 . . . . . 6  |-  ( ( x  =  y  -> 
( z  =  w  ->  ph ) )  <->  ( z  =  w  ->  ( x  =  y  ->  ph )
) )
32albii 1458 . . . . 5  |-  ( A. x ( x  =  y  ->  ( z  =  w  ->  ph )
)  <->  A. x ( z  =  w  ->  (
x  =  y  ->  ph ) ) )
4 19.21v 1861 . . . . 5  |-  ( A. x ( z  =  w  ->  ( x  =  y  ->  ph )
)  <->  ( z  =  w  ->  A. x
( x  =  y  ->  ph ) ) )
53, 4bitri 183 . . . 4  |-  ( A. x ( x  =  y  ->  ( z  =  w  ->  ph )
)  <->  ( z  =  w  ->  A. x
( x  =  y  ->  ph ) ) )
65albii 1458 . . 3  |-  ( A. z A. x ( x  =  y  ->  (
z  =  w  ->  ph ) )  <->  A. z
( z  =  w  ->  A. x ( x  =  y  ->  ph )
) )
7 19.21v 1861 . . . 4  |-  ( A. z ( x  =  y  ->  ( z  =  w  ->  ph )
)  <->  ( x  =  y  ->  A. z
( z  =  w  ->  ph ) ) )
87albii 1458 . . 3  |-  ( A. x A. z ( x  =  y  ->  (
z  =  w  ->  ph ) )  <->  A. x
( x  =  y  ->  A. z ( z  =  w  ->  ph )
) )
91, 6, 83bitr3i 209 . 2  |-  ( A. z ( z  =  w  ->  A. x
( x  =  y  ->  ph ) )  <->  A. x
( x  =  y  ->  A. z ( z  =  w  ->  ph )
) )
10 sb6 1874 . . 3  |-  ( [ w  /  z ] [ y  /  x ] ph  <->  A. z ( z  =  w  ->  [ y  /  x ] ph ) )
11 sb6 1874 . . . . 5  |-  ( [ y  /  x ] ph 
<-> 
A. x ( x  =  y  ->  ph )
)
1211imbi2i 225 . . . 4  |-  ( ( z  =  w  ->  [ y  /  x ] ph )  <->  ( z  =  w  ->  A. x
( x  =  y  ->  ph ) ) )
1312albii 1458 . . 3  |-  ( A. z ( z  =  w  ->  [ y  /  x ] ph )  <->  A. z ( z  =  w  ->  A. x
( x  =  y  ->  ph ) ) )
1410, 13bitri 183 . 2  |-  ( [ w  /  z ] [ y  /  x ] ph  <->  A. z ( z  =  w  ->  A. x
( x  =  y  ->  ph ) ) )
15 sb6 1874 . . 3  |-  ( [ y  /  x ] [ w  /  z ] ph  <->  A. x ( x  =  y  ->  [ w  /  z ] ph ) )
16 sb6 1874 . . . . 5  |-  ( [ w  /  z ]
ph 
<-> 
A. z ( z  =  w  ->  ph )
)
1716imbi2i 225 . . . 4  |-  ( ( x  =  y  ->  [ w  /  z ] ph )  <->  ( x  =  y  ->  A. z
( z  =  w  ->  ph ) ) )
1817albii 1458 . . 3  |-  ( A. x ( x  =  y  ->  [ w  /  z ] ph ) 
<-> 
A. x ( x  =  y  ->  A. z
( z  =  w  ->  ph ) ) )
1915, 18bitri 183 . 2  |-  ( [ y  /  x ] [ w  /  z ] ph  <->  A. x ( x  =  y  ->  A. z
( z  =  w  ->  ph ) ) )
209, 14, 193bitr4i 211 1  |-  ( [ w  /  z ] [ y  /  x ] ph  <->  [ y  /  x ] [ w  /  z ] ph )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104   A.wal 1341   [wsb 1750
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 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-11 1494  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523
This theorem depends on definitions:  df-bi 116  df-sb 1751
This theorem is referenced by:  sbcom2v2  1974
  Copyright terms: Public domain W3C validator