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

Theorem sb5 2300
Description: Alternate definition of substitution when variables are disjoint. Similar to Theorem 6.1 of [Quine] p. 40. The implication "to the right" is sb1v 2110 and even needs no disjoint variable condition, see sb1 2499. Theorem sb5f 2519 replaces the disjoint variable condition with a nonfreeness hypothesis. (Contributed by NM, 18-Aug-1993.) (Revised by Wolf Lammen, 4-Sep-2023.)
Assertion
Ref Expression
sb5 ([𝑦 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝑦𝜑))
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem sb5
StepHypRef Expression
1 sb6 2108 . 2 ([𝑦 / 𝑥]𝜑 ↔ ∀𝑥(𝑥 = 𝑦𝜑))
2 sbalex 2267 . 2 (∃𝑥(𝑥 = 𝑦𝜑) ↔ ∀𝑥(𝑥 = 𝑦𝜑))
31, 2bitr4i 280 1 ([𝑦 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝑦𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  wal 1548  wex 1789  [wsb 2080
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-10 2165  ax-12 2202
This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1790  df-nf 1794  df-sb 2081
This theorem is referenced by:  2sb5  2302  sb7f  2546  clelab  2896  sbc2or  3744  sbc5ALT  3764  bj-axseprep  37497
  Copyright terms: Public domain W3C validator