| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A composition law for substitution. |
| Ref | Expression |
|---|---|
| sbco |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | equsb2 1400 |
. . 3
| |
| 2 | sbequ12 1383 |
. . . . 5
| |
| 3 | 2 | bicomd 577 |
. . . 4
|
| 4 | 3 | sbimi 1375 |
. . 3
|
| 5 | 1, 4 | ax-mp 7 |
. 2
|
| 6 | sbbi 1447 |
. 2
| |
| 7 | 5, 6 | mpbi 205 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: sbid2 1464 sbco3 1469 sb6rfOLD 1474 sb9i 1478 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1142 ax-gen 1143 ax-8 1144 ax-10 1146 ax-12 1148 ax-4 1157 ax-5o 1159 ax-6o 1162 ax-9o 1319 ax-10o 1338 ax-11o 1426 |
| This theorem depends on definitions: df-bi 163 df-an 241 df-ex 1165 df-sb 1374 |