New Foundations Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > NFE Home > Th. List > dfsb7 | Unicode version |
Description: An alternate definition of proper substitution df-sb 1649. By introducing a dummy variable in the definiens, we are able to eliminate any distinct variable restrictions among the variables , , and of the definiendum. No distinct variable conflicts arise because effectively insulates from . To achieve this, we use a chain of two substitutions in the form of sb5 2100, first for then for . Compare Definition 2.1'' of [Quine] p. 17, which is obtained from this theorem by applying df-clab 2340. Theorem sb7h 2121 provides a version where and don't have to be distinct. (Contributed by NM, 28-Jan-2004.) |
Ref | Expression |
---|---|
dfsb7 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sb5 2100 | . . 3 | |
2 | 1 | sbbii 1653 | . 2 |
3 | nfv 1619 | . . 3 | |
4 | 3 | sbco2 2086 | . 2 |
5 | sb5 2100 | . 2 | |
6 | 2, 4, 5 | 3bitr3i 266 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wb 176 wa 358 wex 1541 wsb 1648 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1546 ax-5 1557 ax-17 1616 ax-9 1654 ax-8 1675 ax-6 1729 ax-7 1734 ax-11 1746 ax-12 1925 |
This theorem depends on definitions: df-bi 177 df-or 359 df-an 360 df-tru 1319 df-ex 1542 df-nf 1545 df-sb 1649 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |