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

Theorem sbcom4 2446
Description: Commutativity law for substitution. This theorem was incorrectly used as our previous version of pm11.07 2447 but may still be useful. (Contributed by Andrew Salmon, 17-Jun-2011.) (Proof shortened by Jim Kingdon, 22-Jan-2018.)
Assertion
Ref Expression
sbcom4  |-  ( [ w  /  x ] [ y  /  z ] ph  <->  [ y  /  x ] [ w  /  z ] ph )
Distinct variable groups:    ph, x, y, z    x, w, z
Allowed substitution hint:    ph( w)

Proof of Theorem sbcom4
StepHypRef Expression
1 nfv 1843 . . 3  |-  F/ x ph
21sbf 2380 . 2  |-  ( [ w  /  x ] ph 
<-> 
ph )
3 nfv 1843 . . . 4  |-  F/ z
ph
43sbf 2380 . . 3  |-  ( [ y  /  z ]
ph 
<-> 
ph )
54sbbii 1887 . 2  |-  ( [ w  /  x ] [ y  /  z ] ph  <->  [ w  /  x ] ph )
63sbf 2380 . . . 4  |-  ( [ w  /  z ]
ph 
<-> 
ph )
76sbbii 1887 . . 3  |-  ( [ y  /  x ] [ w  /  z ] ph  <->  [ y  /  x ] ph )
81sbf 2380 . . 3  |-  ( [ y  /  x ] ph 
<-> 
ph )
97, 8bitri 264 . 2  |-  ( [ y  /  x ] [ w  /  z ] ph  <->  ph )
102, 5, 93bitr4i 292 1  |-  ( [ w  /  x ] [ y  /  z ] ph  <->  [ y  /  x ] [ w  /  z ] ph )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 196   [wsb 1880
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-12 2047  ax-13 2246
This theorem depends on definitions:  df-bi 197  df-an 386  df-ex 1705  df-nf 1710  df-sb 1881
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator