|   | 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 2064. 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 2275, first 𝑦 for 𝑥 then 𝑡 for 𝑦. Compare Definition 2.1'' of [Quine] p. 17, which is obtained from this theorem by applying df-clab 2714. Theorem sb7h 2530 provides a version where 𝜑 and 𝑦 don't have to be distinct. (Contributed by NM, 28-Jan-2004.) Revise df-sb 2064. (Revised by BJ, 25-Dec-2020.) (Proof shortened by Wolf Lammen, 3-Sep-2023.) | 
| Ref | Expression | 
|---|---|
| dfsb7 | ⊢ ([𝑡 / 𝑥]𝜑 ↔ ∃𝑦(𝑦 = 𝑡 ∧ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | sbalex 2241 | . 2 ⊢ (∃𝑦(𝑦 = 𝑡 ∧ ∀𝑥(𝑥 = 𝑦 → 𝜑)) ↔ ∀𝑦(𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑))) | |
| 2 | sbalex 2241 | . . . 4 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑)) | |
| 3 | 2 | anbi2i 623 | . . 3 ⊢ ((𝑦 = 𝑡 ∧ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)) ↔ (𝑦 = 𝑡 ∧ ∀𝑥(𝑥 = 𝑦 → 𝜑))) | 
| 4 | 3 | exbii 1847 | . 2 ⊢ (∃𝑦(𝑦 = 𝑡 ∧ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)) ↔ ∃𝑦(𝑦 = 𝑡 ∧ ∀𝑥(𝑥 = 𝑦 → 𝜑))) | 
| 5 | df-sb 2064 | . 2 ⊢ ([𝑡 / 𝑥]𝜑 ↔ ∀𝑦(𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑))) | |
| 6 | 1, 4, 5 | 3bitr4ri 304 | 1 ⊢ ([𝑡 / 𝑥]𝜑 ↔ ∃𝑦(𝑦 = 𝑡 ∧ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∀wal 1537 ∃wex 1778 [wsb 2063 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-10 2140 ax-12 2176 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1779 df-nf 1783 df-sb 2064 | 
| This theorem is referenced by: sbn 2279 | 
| Copyright terms: Public domain | W3C validator |