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

Theorem a4sd 683
Description: Deduction generalizing antecedent.
Hypothesis
Ref Expression
a4sd.1 |- (ph -> (ps -> ch))
Assertion
Ref Expression
a4sd |- (ph -> (A.xps -> ch))

Proof of Theorem a4sd
StepHypRef Expression
1 a4sd.1 . 2 |- (ph -> (ps -> ch))
2 ax-4 673 . 2 |- (A.xps -> ps)
31, 2syl5 22 1 |- (ph -> (A.xps -> ch))
Colors of variables: wff set class
Syntax hints:   -> wi 2  A.wal 672
This theorem is referenced by:  moexex 1058  zornlem4 3606  zornlem5 3607  axpowndlem3 3745  axacndlem5 3757  suppsr3 4018
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-mp 6  ax-4 673
metamath.org