| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: An equality theorem for substitution. |
| Ref | Expression |
|---|---|
| sbequi |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hbsb2 1597 |
. . . . . 6
| |
| 2 | equvini 1531 |
. . . . . . . 8
| |
| 3 | stdpc7 1544 |
. . . . . . . . . 10
| |
| 4 | sbequ1 1542 |
. . . . . . . . . 10
| |
| 5 | 3, 4 | sylan9 517 |
. . . . . . . . 9
|
| 6 | 5 | eximi 1387 |
. . . . . . . 8
|
| 7 | 2, 6 | syl 12 |
. . . . . . 7
|
| 8 | 19.35 1426 |
. . . . . . 7
| |
| 9 | 7, 8 | sylib 215 |
. . . . . 6
|
| 10 | 1, 9 | sylan9 517 |
. . . . 5
|
| 11 | hbnae 1507 |
. . . . . 6
| |
| 12 | hbsb2 1597 |
. . . . . 6
| |
| 13 | 11, 12 | 19.9d 1384 |
. . . . 5
|
| 14 | 10, 13 | syl9 71 |
. . . 4
|
| 15 | 14 | ex 402 |
. . 3
|
| 16 | 15 | com23 36 |
. 2
|
| 17 | sbequ2 1543 |
. . . . . 6
| |
| 18 | 17 | a4s 1330 |
. . . . 5
|
| 19 | 18 | adantr 425 |
. . . 4
|
| 20 | sbequ1 1542 |
. . . . 5
| |
| 21 | drsb1 1539 |
. . . . . . 7
| |
| 22 | 21 | biimpd 170 |
. . . . . 6
|
| 23 | 22 | alequcoms 1503 |
. . . . 5
|
| 24 | 20, 23 | sylan9r 519 |
. . . 4
|
| 25 | 19, 24 | syld 30 |
. . 3
|
| 26 | 25 | ex 402 |
. 2
|
| 27 | drsb1 1539 |
. . . . . 6
| |
| 28 | 27 | biimpd 170 |
. . . . 5
|
| 29 | stdpc7 1544 |
. . . . 5
| |
| 30 | 28, 29 | sylan9 517 |
. . . 4
|
| 31 | 4 | a4s 1330 |
. . . . 5
|
| 32 | 31 | adantr 425 |
. . . 4
|
| 33 | 30, 32 | syld 30 |
. . 3
|
| 34 | 33 | ex 402 |
. 2
|
| 35 | 16, 26, 34 | pm2.61ii 144 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: sbequ 1599 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1304 ax-gen 1305 ax-8 1306 ax-9 1307 ax-10 1308 ax-12 1310 ax-4 1319 ax-5o 1321 ax-6o 1324 ax-9o 1481 ax-10o 1500 ax-11o 1588 |
| This theorem depends on definitions: df-bi 164 df-or 241 df-an 242 df-ex 1327 df-sb 1536 |