| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A variable not free remains so after substitution with a distinct variable (closed form of hbsb4 1620). |
| Ref | Expression |
|---|---|
| hbsb4tOLD |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-4 1319 |
. . . . . 6
| |
| 2 | 1 | biantru 793 |
. . . . 5
|
| 3 | dfbi2 572 |
. . . . 5
| |
| 4 | 2, 3 | bitr4i 193 |
. . . 4
|
| 5 | 4 | 2albii 1347 |
. . 3
|
| 6 | a4sbbi 1616 |
. . . . . 6
| |
| 7 | 6 | a4s 1330 |
. . . . 5
|
| 8 | hba1 1350 |
. . . . . 6
| |
| 9 | 8, 7 | albid 1459 |
. . . . 5
|
| 10 | 7, 9 | imbi12d 688 |
. . . 4
|
| 11 | 10 | a7s 1337 |
. . 3
|
| 12 | 5, 11 | sylbi 216 |
. 2
|
| 13 | hba1 1350 |
. . 3
| |
| 14 | 13 | hbsb4 1620 |
. 2
|
| 15 | 12, 14 | syl5bir 227 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| 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-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-an 242 df-ex 1327 df-sb 1536 |