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

Theorem sb4a 2355
 Description: A version of sb4 2354 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 1881 . 2 ([𝑦 / 𝑥]∀𝑦𝜑 → ∃𝑥(𝑥 = 𝑦 ∧ ∀𝑦𝜑))
2 equs5a 2346 . 2 (∃𝑥(𝑥 = 𝑦 ∧ ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦𝜑))
31, 2syl 17 1 ([𝑦 / 𝑥]∀𝑦𝜑 → ∀𝑥(𝑥 = 𝑦𝜑))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 384  ∀wal 1479  ∃wex 1702  [wsb 1878 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-10 2017  ax-12 2045  ax-13 2244 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-ex 1703  df-nf 1708  df-sb 1879 This theorem is referenced by:  hbsb2a  2359  sb6f  2383  bj-hbsb2av  32735
 Copyright terms: Public domain W3C validator