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

Theorem hbnd 2147
Description: Deduction form of bound-variable hypothesis builder hbn 2146. (Contributed by NM, 3-Jan-2002.)
Hypotheses
Ref Expression
hbnd.1  |-  ( ph  ->  A. x ph )
hbnd.2  |-  ( ph  ->  ( ps  ->  A. x ps ) )
Assertion
Ref Expression
hbnd  |-  ( ph  ->  ( -.  ps  ->  A. x  -.  ps )
)

Proof of Theorem hbnd
StepHypRef Expression
1 hbnd.1 . . 3  |-  ( ph  ->  A. x ph )
2 hbnd.2 . . 3  |-  ( ph  ->  ( ps  ->  A. x ps ) )
31, 2alrimih 1751 . 2  |-  ( ph  ->  A. x ( ps 
->  A. x ps )
)
4 hbnt 2144 . 2  |-  ( A. x ( ps  ->  A. x ps )  -> 
( -.  ps  ->  A. x  -.  ps )
)
53, 4syl 17 1  |-  ( ph  ->  ( -.  ps  ->  A. x  -.  ps )
)
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4   A.wal 1481
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-10 2019  ax-12 2047
This theorem depends on definitions:  df-bi 197  df-or 385  df-ex 1705  df-nf 1710
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator