Theorem ax10w 2164

Description: Weak version of ax-10 2176 from which we can prove any ax-10 2176 instance not involving wff variables or bundling. Uses only Tarski's FOL axiom schemes. It is an alias of hbn1w 2078 introduced for labeling consistency. (Contributed by NM, 9-Apr-2017.) Use hbn1w 2078 instead. (New usage is discouraged.)

Hypothesis

Ref	Expression
ax10w.1	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
ax10w	⊢ (¬ ∀𝑥𝜑 → ∀𝑥 ¬ ∀𝑥𝜑)

Distinct variable groups:   𝜑,𝑦   𝜓,𝑥   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem ax10w

Step	Hyp	Ref	Expression
1		ax10w.1	. 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
2	1	hbn1w 2078	1 ⊢ (¬ ∀𝑥𝜑 → ∀𝑥 ¬ ∀𝑥𝜑)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209  ∀wal 1568

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038

This proof depends on definitions:  df-bi 210  df-an 401  df-ex 1810

This theorem is used by: (None)