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

Theorem hbia1 1014
Description: Lemma 23 of [Monk2] p. 114.
Assertion
Ref Expression
hbia1 |- ((A.xph -> A.xps) -> A.x(A.xph -> A.xps))

Proof of Theorem hbia1
StepHypRef Expression
1 hba1 1003 . 2 |- (A.xph -> A.xA.xph)
2 hba1 1003 . 2 |- (A.xps -> A.xA.xps)
31, 2hbim 1007 1 |- ((A.xph -> A.xps) -> A.x(A.xph -> A.xps))
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 954
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