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

Theorem ax10w 2046
 Description: Weak version of ax-10 2059 from which we can prove any ax-10 2059 instance not involving wff variables or bundling. Uses only Tarski's FOL axiom schemes. It is an alias of hbn1w 2015 introduced for labeling consistency. (Contributed by NM, 9-Apr-2017.) Use hbn1w 2015 instead. (New usage is discouraged.)
Hypothesis
Ref Expression
ax10w.1 (𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
ax10w (¬ ∀𝑥𝜑 → ∀𝑥 ¬ ∀𝑥𝜑)
Distinct variable groups:   𝜑,𝑦   𝜓,𝑥   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem ax10w
StepHypRef Expression
1 ax10w.1 . 2 (𝑥 = 𝑦 → (𝜑𝜓))
21hbn1w 2015 1 (¬ ∀𝑥𝜑 → ∀𝑥 ¬ ∀𝑥𝜑)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196  ∀wal 1521 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981 This theorem depends on definitions:  df-bi 197  df-an 385  df-ex 1745 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator