HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem sbco2 1239
Description: A composition law for substitution.
Hypothesis
Ref Expression
sbco2.1 |- (ph -> A.zph)
Assertion
Ref Expression
sbco2 |- ([y / z][z / x]ph <-> [y / x]ph)

Proof of Theorem sbco2
StepHypRef Expression
1 sbequ 1213 . . . . 5 |- (x = y -> ([x / z][z / x]ph <-> [y / z][z / x]ph))
2 sbco2.1 . . . . . 6 |- (ph -> A.zph)
32sbid2 1237 . . . . 5 |- ([x / z][z / x]ph <-> ph)
41, 3syl5bbr 532 . . . 4 |- (x = y -> (ph <-> [y / z][z / x]ph))
5 sbequ12 1164 . . . 4 |- (x = y -> (ph <-> [y / x]ph))
64, 5bitr3d 528 . . 3 |- (x = y -> ([y / z][z / x]ph <-> [y / x]ph))
76a4s 960 . 2 |- (A.x x = y -> ([y / z][z / x]ph <-> [y / x]ph))
8 hbnae 1130 . . . 4 |- (-. A.x x = y -> A.x -. A.x x = y)
92hbsb3 1189 . . . . 5 |- ([z / x]ph -> A.x[z / x]ph)
109hbsb4 1232 . . . 4 |- (-. A.x x = y -> ([y / z][z / x]ph -> A.x[y / z][z / x]ph))
114a1i 8 . . . 4 |- (-. A.x x = y -> (x = y -> (ph <-> [y / z][z / x]ph)))
128, 10, 11sbied 1178 . . 3 |- (-. A.x x = y -> ([y / x]ph <-> [y / z][z / x]ph))
1312bicomd 519 . 2 |- (-. A.x x = y -> ([y / z][z / x]ph <-> [y / x]ph))
147, 13pm2.61i 126 1 |- ([y / z][z / x]ph <-> [y / x]ph)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 146  A.wal 950  [wsbc 1153
This theorem is referenced by:  sbco2d 1240  equsb3 1312  elsb3 1313  sb7 1322  2eu6 1431  sbralie 1912  sbccog 1923
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-4 951  ax-5 952  ax-6 953  ax-7 954  ax-gen 955  ax-8 1101  ax-9 1102  ax-10 1103  ax-12 1104  ax-11 1180  ax-11o 1202
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 957  df-sb 1155
Copyright terms: Public domain