NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  hbnd GIF version

Theorem hbnd 1883
Description: Deduction form of bound-variable hypothesis builder hbn 1776. (Contributed by NM, 3-Jan-2002.)
Hypotheses
Ref Expression
hbnd.1 ⊢ (φ → ∀xφ)
hbnd.2 ⊢ (φ → (ψ → ∀xψ))
Assertion
Ref Expression
hbnd ⊢ (φ → (¬ ψ → ∀x ¬ ψ))

Proof of Theorem hbnd
StepHypRef Expression
1 hbnd.1 . . 3 ⊢ (φ → ∀xφ)
2 hbnd.2 . . 3 ⊢ (φ → (ψ → ∀xψ))
31, 2alrimih 1565 . 2 ⊢ (φ → ∀x(ψ → ∀xψ))
4 hbnt 1775 . 2 ⊢ (∀x(ψ → ∀xψ) → (¬ ψ → ∀x ¬ ψ))
53, 4syl 15 1 ⊢ (φ → (¬ ψ → ∀x ¬ ψ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∀wal 1540
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-11 1746
This proof depends on definitions:  df-bi 177  df-ex 1542
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator