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

Theorem hbnd 2333
Description: Deduction form of bound-variable hypothesis builder hbn 2332. (Contributed by NM, 3-Jan-2002.)
Hypotheses
Ref Expression
hbnd.1 (𝜑 → ∀𝑥𝜑)
hbnd.2 (𝜑 → (𝜓 → ∀𝑥𝜓))
Assertion
Ref Expression
hbnd (𝜑 → (¬ 𝜓 → ∀𝑥 ¬ 𝜓))

Proof of Theorem hbnd
StepHypRef Expression
1 hbnd.1 . . 3 (𝜑 → ∀𝑥𝜑)
2 hbnd.2 . . 3 (𝜑 → (𝜓 → ∀𝑥𝜓))
31, 2alrimih 1857 . 2 (𝜑 → ∀𝑥(𝜓 → ∀𝑥𝜓))
4 hbnt 2331 . 2 (∀𝑥(𝜓 → ∀𝑥𝜓) → (¬ 𝜓 → ∀𝑥 ¬ 𝜓))
53, 4syl 18 1 (𝜑 → (¬ 𝜓 → ∀𝑥 ¬ 𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wal 1568
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-10 2179  ax-12 2216
This proof depends on definitions:  df-bi 210  df-or 862  df-ex 1813  df-nf 1817
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator