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

Theorem hbn1 1015
Description: x is not free in -. A.xph.
Assertion
Ref Expression
hbn1 |- (-. A.xph -> A.x -. A.xph)

Proof of Theorem hbn1
StepHypRef Expression
1 hba1 1003 . 2 |- (A.xph -> A.xA.xph)
21hbn 1004 1 |- (-. A.xph -> A.x -. A.xph)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3  A.wal 954
This theorem is referenced by:  hbe1 1016  ax467 1023  modal-5 1027  equs4 1150  equs5e 1198  ax15 1359  ax11indn 1366  a12lem1 1376  a12study 1378  a12studyALT 1379
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 963  ax-4 973  ax-5o 975  ax-6o 978
Copyright terms: Public domain