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

Theorem sb4a 2357
Description: A version of sb4 2356 that doesn't require a distinctor antecedent. (Contributed by NM, 2-Feb-2007.)
Assertion
Ref Expression
sb4a ([𝑦 / 𝑥]∀𝑦𝜑 → ∀𝑥(𝑥 = 𝑦𝜑))

Proof of Theorem sb4a
StepHypRef Expression
1 sb1 1883 . 2 ([𝑦 / 𝑥]∀𝑦𝜑 → ∃𝑥(𝑥 = 𝑦 ∧ ∀𝑦𝜑))
2 equs5a 2348 . 2 (∃𝑥(𝑥 = 𝑦 ∧ ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦𝜑))
31, 2syl 17 1 ([𝑦 / 𝑥]∀𝑦𝜑 → ∀𝑥(𝑥 = 𝑦𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384  wal 1481  wex 1704  [wsb 1880
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-10 2019  ax-12 2047  ax-13 2246
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-ex 1705  df-nf 1710  df-sb 1881
This theorem is referenced by:  hbsb2a  2361  sb6f  2385  bj-hbsb2av  32760
  Copyright terms: Public domain W3C validator