| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A composition law for substitution. |
| Ref | Expression |
|---|---|
| sbco2.1 |
|
| Ref | Expression |
|---|---|
| sbco2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbequ 1224 |
. . . . 5
| |
| 2 | sbco2.1 |
. . . . . 6
| |
| 3 | 2 | sbid2 1248 |
. . . . 5
|
| 4 | 1, 3 | syl5bbr 532 |
. . . 4
|
| 5 | sbequ12 1177 |
. . . 4
| |
| 6 | 4, 5 | bitr3d 528 |
. . 3
|
| 7 | 6 | a4s 981 |
. 2
|
| 8 | hbnae 1143 |
. . . 4
| |
| 9 | 2 | hbsb3 1202 |
. . . . 5
|
| 10 | 9 | hbsb4 1243 |
. . . 4
|
| 11 | 4 | a1i 8 |
. . . 4
|
| 12 | 8, 10, 11 | sbied 1191 |
. . 3
|
| 13 | 12 | bicomd 519 |
. 2
|
| 14 | 7, 13 | pm2.61i 126 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: sbco2d 1251 equsb3 1325 elsb3 1326 dfsb7 1335 2eu6 1447 sbralie 1931 sbccog 1942 |
| 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-9 962 ax-10 963 ax-11 964 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-or 224 df-an 225 df-ex 978 df-sb 1168 |