| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: An alternate definition
of proper substitution df-sb 853. By
introducing a dummy variable |
| Ref | Expression |
|---|---|
| sb7 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sb5 988 |
. . 3
| |
| 2 | 1 | bisb 855 |
. 2
|
| 3 | ax-17 925 |
. . 3
| |
| 4 | 3 | sbco2 913 |
. 2
|
| 5 | sb5 988 |
. 2
| |
| 6 | 2, 4, 5 | 3bitr3 156 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| 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 ax-16 922 ax-17 925 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 |