| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Define proper
substitution. Remark 9.1 in [Megill] p. 447
(p. 15 of the
preprint). For our notation, we use In most books, proper substitution has a somewhat complicated recursive definition with multiple cases based on the occurrences of free and bound variables in the wff. Instead we use a remarkable little formula that is exactly equivalent and gives us a single direct definition. We later prove that our definition has the properties we expect of proper substitution (see theorems sbequ 877, sbcom2 992 and sbid2v 993).
Note that our definition is valid even when
There are no restrictions on what variables may occur in |
| Ref | Expression |
|---|---|
| df-sb |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wph |
. . 3
| |
| 2 | vx |
. . 3
| |
| 3 | vy |
. . 3
| |
| 4 | 1, 2, 3 | wsb 852 |
. 2
|
| 5 | 2, 3 | weq 797 |
. . . 4
|
| 6 | 5, 1 | wi 2 |
. . 3
|
| 7 | 5, 1 | wa 196 |
. . . 4
|
| 8 | 7, 2 | wex 678 |
. . 3
|
| 9 | 6, 8 | wa 196 |
. 2
|
| 10 | 4, 9 | wb 127 |
1
|
| Colors of variables: wff set class |
| This definition is referenced by: sbimi 854 del43 856 sb1 858 sb2 859 sbequ1 863 sbequ2 864 sbn2 881 |