![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > dfsb7 | GIF version |
Description: An alternate definition of proper substitution df-sb 1686. 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 1808, first 𝑧 for 𝑥 then 𝑦 for 𝑧. Compare Definition 2.1'' of [Quine] p. 17. Theorem sb7f 1909 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 1808 | . . 3 ⊢ ([𝑧 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝑧 ∧ 𝜑)) | |
2 | 1 | sbbii 1688 | . 2 ⊢ ([𝑦 / 𝑧][𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑧]∃𝑥(𝑥 = 𝑧 ∧ 𝜑)) |
3 | ax-17 1459 | . . 3 ⊢ (𝜑 → ∀𝑧𝜑) | |
4 | 3 | sbco2v 1862 | . 2 ⊢ ([𝑦 / 𝑧][𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑) |
5 | sb5 1808 | . 2 ⊢ ([𝑦 / 𝑧]∃𝑥(𝑥 = 𝑧 ∧ 𝜑) ↔ ∃𝑧(𝑧 = 𝑦 ∧ ∃𝑥(𝑥 = 𝑧 ∧ 𝜑))) | |
6 | 2, 4, 5 | 3bitr3i 208 | 1 ⊢ ([𝑦 / 𝑥]𝜑 ↔ ∃𝑧(𝑧 = 𝑦 ∧ ∃𝑥(𝑥 = 𝑧 ∧ 𝜑))) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 102 ↔ wb 103 ∃wex 1421 [wsb 1685 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 |
This theorem depends on definitions: df-bi 115 df-nf 1390 df-sb 1686 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |