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

Theorem dfsb3 2362
Description: An alternate definition of proper substitution df-sb 1868 that uses only primitive connectives (no defined terms) on the right-hand side. (Contributed by NM, 6-Mar-2007.)
Assertion
Ref Expression
dfsb3 ([𝑦 / 𝑥]𝜑 ↔ ((𝑥 = 𝑦 → ¬ 𝜑) → ∀𝑥(𝑥 = 𝑦𝜑)))

Proof of Theorem dfsb3
StepHypRef Expression
1 df-or 384 . 2 (((𝑥 = 𝑦𝜑) ∨ ∀𝑥(𝑥 = 𝑦𝜑)) ↔ (¬ (𝑥 = 𝑦𝜑) → ∀𝑥(𝑥 = 𝑦𝜑)))
2 dfsb2 2361 . 2 ([𝑦 / 𝑥]𝜑 ↔ ((𝑥 = 𝑦𝜑) ∨ ∀𝑥(𝑥 = 𝑦𝜑)))
3 imnan 437 . . 3 ((𝑥 = 𝑦 → ¬ 𝜑) ↔ ¬ (𝑥 = 𝑦𝜑))
43imbi1i 338 . 2 (((𝑥 = 𝑦 → ¬ 𝜑) → ∀𝑥(𝑥 = 𝑦𝜑)) ↔ (¬ (𝑥 = 𝑦𝜑) → ∀𝑥(𝑥 = 𝑦𝜑)))
51, 2, 43bitr4i 291 1 ([𝑦 / 𝑥]𝜑 ↔ ((𝑥 = 𝑦 → ¬ 𝜑) → ∀𝑥(𝑥 = 𝑦𝜑)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 195  wo 382  wa 383  wal 1473  [wsb 1867
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-12 2034  ax-13 2234
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868
This theorem is referenced by:  sbn  2379
  Copyright terms: Public domain W3C validator