| 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 905). |
| Ref | Expression |
|---|---|
| hbsb4t |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-4 673 |
. . . . . 6
| |
| 2 | 1 | biantru 543 |
. . . . 5
|
| 3 | bi 396 |
. . . . 5
| |
| 4 | 2, 3 | bitr4 154 |
. . . 4
|
| 5 | 4 | bi2al 696 |
. . 3
|
| 6 | sbba4 896 |
. . . . . 6
| |
| 7 | 6 | a4s 682 |
. . . . 5
|
| 8 | hba1 698 |
. . . . . 6
| |
| 9 | 8, 7 | biald 782 |
. . . . 5
|
| 10 | 7, 9 | imbi12d 474 |
. . . 4
|
| 11 | 10 | a7s 689 |
. . 3
|
| 12 | 5, 11 | sylbi 174 |
. 2
|
| 13 | hba1 698 |
. . 3
| |
| 14 | 13 | hbsb4 905 |
. 2
|
| 15 | 12, 14 | syl5bir 184 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: ddelimdf 909 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 |
| This theorem depends on definitions: df-bi 128 df-an 198 df-ex 679 df-sb 853 |