MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfsb7OLDOLD Structured version   Visualization version   GIF version

Theorem dfsb7OLDOLD 2569
Description: Obsolete version of dfsb7 2284 as of 8-Jul-2023.

An alternate definition of proper substitution df-sb 2069. 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 2799. Theorem sb7h 2568 provides a version where 𝜑 and 𝑧 don't have to be distinct. (Contributed by NM, 28-Jan-2004.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion
Ref Expression
dfsb7OLDOLD ([𝑦 / 𝑥]𝜑 ↔ ∃𝑧(𝑧 = 𝑦 ∧ ∃𝑥(𝑥 = 𝑧𝜑)))
Distinct variable groups:   𝑦,𝑧   𝜑,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem dfsb7OLDOLD
StepHypRef Expression
1 nfv 1914 . 2 𝑧𝜑
21sb7f 2567 1 ([𝑦 / 𝑥]𝜑 ↔ ∃𝑧(𝑧 = 𝑦 ∧ ∃𝑥(𝑥 = 𝑧𝜑)))
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 398  wex 1779  [wsb 2068
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-10 2144  ax-11 2160  ax-12 2176  ax-13 2389
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator