Theorem nf5-1 2010

Description: One direction of nf5 2102 can be proved with a smaller footprint on axiom usage. (Contributed by Wolf Lammen, 16-Sep-2021.)

Assertion

Ref	Expression
nf5-1	⊢ (∀𝑥(𝜑 → ∀𝑥𝜑) → Ⅎ𝑥𝜑)

Proof of Theorem nf5-1

Step	Hyp	Ref	Expression
1		exim 1751	. . 3 ⊢ (∀𝑥(𝜑 → ∀𝑥𝜑) → (∃𝑥𝜑 → ∃𝑥∀𝑥𝜑))
2		hbe1a 2009	. . 3 ⊢ (∃𝑥∀𝑥𝜑 → ∀𝑥𝜑)
3	1, 2	syl6 34	. 2 ⊢ (∀𝑥(𝜑 → ∀𝑥𝜑) → (∃𝑥𝜑 → ∀𝑥𝜑))
4	3	nfd 1707	1 ⊢ (∀𝑥(𝜑 → ∀𝑥𝜑) → Ⅎ𝑥𝜑)

Syntax hints:   → wi 4  ∀wal 1473  ∃wex 1695  Ⅎwnf 1699

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-10 2006

This theorem depends on definitions:  df-bi 196  df-ex 1696  df-nf 1701

This theorem is referenced by:  nf5i  2011  nf5dv  2012  nf5dh  2013  nf5d  2104  hbnt  2129