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

Theorem hbnt 1000
Description: Closed theorem version of bound-variable hypothesis builder hbn 1002.
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 993 . 2 |- (A.x(ph -> A.xph) -> (A.x -. A.xph -> A.x -. ph))
3 ax-6o 976 . . 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 952
This theorem is referenced by:  hbn 1002  19.9t 1033  hbnd 1107
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 961  ax-4 971  ax-5o 973  ax-6o 976
Copyright terms: Public domain