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

Theorem hbnt 2298
Description: Closed theorem version of bound-variable hypothesis builder hbn 2299. (Contributed by NM, 10-May-1993.) (Proof shortened by Wolf Lammen, 14-Oct-2021.)
Assertion
Ref Expression
hbnt (∀𝑥(𝜑 → ∀𝑥𝜑) → (¬ 𝜑 → ∀𝑥 ¬ 𝜑))

Proof of Theorem hbnt
StepHypRef Expression
1 nf5-1 2146 . . 3 (∀𝑥(𝜑 → ∀𝑥𝜑) → Ⅎ𝑥𝜑)
21nfnd 1859 . 2 (∀𝑥(𝜑 → ∀𝑥𝜑) → Ⅎ𝑥 ¬ 𝜑)
32nf5rd 2194 1 (∀𝑥(𝜑 → ∀𝑥𝜑) → (¬ 𝜑 → ∀𝑥 ¬ 𝜑))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wal 1536
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-10 2142  ax-12 2175
This theorem depends on definitions:  df-bi 210  df-or 845  df-ex 1782  df-nf 1786
This theorem is referenced by:  hbn  2299  hbnd  2300  bj-hbext  34464
  Copyright terms: Public domain W3C validator