Theorem hbnt 1632

Description: Closed theorem version of bound-variable hypothesis builder hbn 1633. (Contributed by NM, 5-Aug-1993.) (Revised by NM, 2-Feb-2015.)

Assertion

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

Proof of Theorem hbnt

Step	Hyp	Ref	Expression
1		ax-4 1488	. . . 4 ⊢ (∀𝑥𝜑 → 𝜑)
2	1	con3i 622	. . 3 ⊢ (¬ 𝜑 → ¬ ∀𝑥𝜑)
3		ax6b 1630	. . 3 ⊢ (¬ ∀𝑥𝜑 → ∀𝑥 ¬ ∀𝑥𝜑)
4	2, 3	syl 14	. 2 ⊢ (¬ 𝜑 → ∀𝑥 ¬ ∀𝑥𝜑)
5		con3 632	. . 3 ⊢ ((𝜑 → ∀𝑥𝜑) → (¬ ∀𝑥𝜑 → ¬ 𝜑))
6	5	al2imi 1435	. 2 ⊢ (∀𝑥(𝜑 → ∀𝑥𝜑) → (∀𝑥 ¬ ∀𝑥𝜑 → ∀𝑥 ¬ 𝜑))
7	4, 6	syl5 32	1 ⊢ (∀𝑥(𝜑 → ∀𝑥𝜑) → (¬ 𝜑 → ∀𝑥 ¬ 𝜑))

Syntax hints:  ¬ wn 3   → wi 4  ∀wal 1330

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-5 1424  ax-gen 1426  ax-ie2 1471  ax-4 1488  ax-ial 1515

This theorem depends on definitions:  df-bi 116  df-tru 1335  df-fal 1338

This theorem is referenced by:  hbn  1633  hbnd  1634  nfnt  1635