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

Theorem sbco3 1241
Description: A composition law for substitution.
Assertion
Ref Expression
sbco3 |- ([z / y][y / x]ph <-> [z / x][x / y]ph)

Proof of Theorem sbco3
StepHypRef Expression
1 drsb1 1158 . . 3 |- (A.x x = y -> ([z / x][y / x]ph <-> [z / y][y / x]ph))
2 sbequ12a 1166 . . . . 5 |- (x = y -> ([y / x]ph <-> [x / y]ph))
3219.20i 968 . . . 4 |- (A.x x = y -> A.x([y / x]ph <-> [x / y]ph))
4 sbba4 1229 . . . 4 |- (A.x([y / x]ph <-> [x / y]ph) -> ([z / x][y / x]ph <-> [z / x][x / y]ph))
53, 4syl 10 . . 3 |- (A.x x = y -> ([z / x][y / x]ph <-> [z / x][x / y]ph))
61, 5bitr3d 528 . 2 |- (A.x x = y -> ([z / y][y / x]ph <-> [z / x][x / y]ph))
7 hbnae 1130 . . . 4 |- (-. A.x x = y -> A.y -. A.x x = y)
8 hbnae 1130 . . . 4 |- (-. A.x x = y -> A.x -. A.x x = y)
9 hbsb2 1211 . . . 4 |- (-. A.x x = y -> ([y / x]ph -> A.x[y / x]ph))
107, 8, 9sbco2d 1240 . . 3 |- (-. A.x x = y -> ([z / x][x / y][y / x]ph <-> [z / y][y / x]ph))
11 sbco 1236 . . . 4 |- ([x / y][y / x]ph <-> [x / y]ph)
1211sbbii 1157 . . 3 |- ([z / x][x / y][y / x]ph <-> [z / x][x / y]ph)
1310, 12syl5rbbr 533 . 2 |- (-. A.x x = y -> ([z / y][y / x]ph <-> [z / x][x / y]ph))
146, 13pm2.61i 126 1 |- ([z / y][y / x]ph <-> [z / x][x / y]ph)
Colors of variables: wff set class
Syntax hints:  -. wn 2   <-> wb 146  A.wal 950  [wsbc 1153
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