Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dfsb7 | Structured version Visualization version GIF version |
Description: An alternate definition of proper substitution df-sb 2068. 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 2268, first 𝑦 for 𝑥 then 𝑡 for 𝑦. Compare Definition 2.1'' of [Quine] p. 17, which is obtained from this theorem by applying df-clab 2716. Theorem sb7h 2531 provides a version where 𝜑 and 𝑦 don't have to be distinct. (Contributed by NM, 28-Jan-2004.) Revise df-sb 2068. (Revised by BJ, 25-Dec-2020.) (Proof shortened by Wolf Lammen, 3-Sep-2023.) |
Ref | Expression |
---|---|
dfsb7 | ⊢ ([𝑡 / 𝑥]𝜑 ↔ ∃𝑦(𝑦 = 𝑡 ∧ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbalex 2235 | . 2 ⊢ (∃𝑦(𝑦 = 𝑡 ∧ ∀𝑥(𝑥 = 𝑦 → 𝜑)) ↔ ∀𝑦(𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑))) | |
2 | sbalex 2235 | . . . 4 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑)) | |
3 | 2 | anbi2i 623 | . . 3 ⊢ ((𝑦 = 𝑡 ∧ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)) ↔ (𝑦 = 𝑡 ∧ ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
4 | 3 | exbii 1850 | . 2 ⊢ (∃𝑦(𝑦 = 𝑡 ∧ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)) ↔ ∃𝑦(𝑦 = 𝑡 ∧ ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
5 | df-sb 2068 | . 2 ⊢ ([𝑡 / 𝑥]𝜑 ↔ ∀𝑦(𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑))) | |
6 | 1, 4, 5 | 3bitr4ri 304 | 1 ⊢ ([𝑡 / 𝑥]𝜑 ↔ ∃𝑦(𝑦 = 𝑡 ∧ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∀wal 1537 ∃wex 1782 [wsb 2067 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-10 2137 ax-12 2171 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-ex 1783 df-nf 1787 df-sb 2068 |
This theorem is referenced by: sbn 2277 |
Copyright terms: Public domain | W3C validator |