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

Theorem sb9 1967
Description: Commutation of quantification and substitution variables. (Contributed by NM, 5-Aug-1993.) (Proof rewritten by Jim Kingdon, 23-Mar-2018.)
Assertion
Ref Expression
sb9  |-  ( A. x [ x  /  y ] ph  <->  A. y [ y  /  x ] ph )

Proof of Theorem sb9
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 sb9v 1966 . . 3  |-  ( A. y [ y  /  w ] [ w  /  x ] ph  <->  A. w [ w  /  y ] [
w  /  x ] ph )
2 sbcom 1963 . . . 4  |-  ( [ w  /  y ] [ w  /  x ] ph  <->  [ w  /  x ] [ w  /  y ] ph )
32albii 1458 . . 3  |-  ( A. w [ w  /  y ] [ w  /  x ] ph  <->  A. w [ w  /  x ] [ w  /  y ] ph )
4 sb9v 1966 . . 3  |-  ( A. w [ w  /  x ] [ w  /  y ] ph  <->  A. x [ x  /  w ] [ w  /  y ] ph )
51, 3, 43bitri 205 . 2  |-  ( A. y [ y  /  w ] [ w  /  x ] ph  <->  A. x [ x  /  w ] [ w  /  y ] ph )
6 ax-17 1514 . . . 4  |-  ( ph  ->  A. w ph )
76sbco2h 1952 . . 3  |-  ( [ y  /  w ] [ w  /  x ] ph  <->  [ y  /  x ] ph )
87albii 1458 . 2  |-  ( A. y [ y  /  w ] [ w  /  x ] ph  <->  A. y [ y  /  x ] ph )
96sbco2h 1952 . . 3  |-  ( [ x  /  w ] [ w  /  y ] ph  <->  [ x  /  y ] ph )
109albii 1458 . 2  |-  ( A. x [ x  /  w ] [ w  /  y ] ph  <->  A. x [ x  /  y ] ph )
115, 8, 103bitr3ri 210 1  |-  ( A. x [ x  /  y ] ph  <->  A. y [ y  /  x ] ph )
Colors of variables: wff set class
Syntax hints:    <-> 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-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523
This theorem depends on definitions:  df-bi 116  df-nf 1449  df-sb 1751
This theorem is referenced by:  sb9i  1968
  Copyright terms: Public domain W3C validator