HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem hbnt 1004
Description: Closed theorem version of bound-variable hypothesis builder hbn 1006.
Assertion
Ref Expression
hbnt |- (A.x(ph -> A.xph) -> (-. ph -> A.x -. ph))

Proof of Theorem hbnt
StepHypRef Expression
1 con3 94 . . 3 |- ((ph -> A.xph) -> (-. A.xph -> -. ph))
2119.20ii 997 . 2 |- (A.x(ph -> A.xph) -> (A.x -. A.xph -> A.x -. ph))
3 ax-6o 980 . . 3 |- (-. A.x -. A.xph -> ph)
43con1i 96 . 2 |- (-. ph -> A.x -. A.xph)
52, 4syl5 21 1 |- (A.x(ph -> A.xph) -> (-. ph -> A.x -. ph))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3  A.wal 956
This theorem is referenced by:  hbn 1006  19.9t 1037  hbnd 1111
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 965  ax-4 975  ax-5o 977  ax-6o 980
Copyright terms: Public domain