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

Theorem hbn1w 1960
 Description: Weak version of hbn1 2007. Uses only Tarski's FOL axiom schemes. (Contributed by NM, 9-Apr-2017.)
Hypothesis
Ref Expression
hbn1w.1 (𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
hbn1w (¬ ∀𝑥𝜑 → ∀𝑥 ¬ ∀𝑥𝜑)
Distinct variable groups:   𝜑,𝑦   𝜓,𝑥   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem hbn1w
StepHypRef Expression
1 ax-5 1827 . 2 (∀𝑥𝜑 → ∀𝑦𝑥𝜑)
2 ax-5 1827 . 2 𝜓 → ∀𝑥 ¬ 𝜓)
3 ax-5 1827 . 2 (∀𝑦𝜓 → ∀𝑥𝑦𝜓)
4 ax-5 1827 . 2 𝜑 → ∀𝑦 ¬ 𝜑)
5 ax-5 1827 . 2 (¬ ∀𝑦𝜓 → ∀𝑥 ¬ ∀𝑦𝜓)
6 hbn1w.1 . 2 (𝑥 = 𝑦 → (𝜑𝜓))
71, 2, 3, 4, 5, 6hbn1fw 1959 1 (¬ ∀𝑥𝜑 → ∀𝑥 ¬ ∀𝑥𝜑)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 195  ∀wal 1473 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 This theorem depends on definitions:  df-bi 196  df-an 385  df-ex 1696 This theorem is referenced by:  hba1w  1961  hba1wOLD  1962  hbe1w  1963  ax10w  1993  wl-naevhba1v  32483
 Copyright terms: Public domain W3C validator