| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A composition law for substitution. |
| Ref | Expression |
|---|---|
| sbco |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | equsb2 1190 |
. . 3
| |
| 2 | sbequ12 1177 |
. . . . 5
| |
| 3 | 2 | bicomd 519 |
. . . 4
|
| 4 | 3 | sbimi 1169 |
. . 3
|
| 5 | 1, 4 | ax-mp 7 |
. 2
|
| 6 | sbbi 1234 |
. 2
| |
| 7 | 5, 6 | mpbi 189 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: sbid2 1248 sbco3 1252 sb6rf 1255 sb9i 1258 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 959 ax-gen 960 ax-8 961 ax-10 963 ax-12 965 ax-4 970 ax-5o 972 ax-6o 975 ax-9o 1119 ax-10o 1136 ax-11o 1213 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 978 df-sb 1168 |