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

Theorem a4sd 1331
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 1319 . 2 |- (A.xps -> ps)
31, 2syl5 20 1 |- (ph -> (A.xps -> ch))
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 1296
This theorem is referenced by:  alim 1340  moexex 1841  moi2 2435  ordtypelem4 5687  zorn2lem4 5953  zorn2lem5 5954  axpowndlem3 6103  axacndlem5 6115  suppsr3 6376  ordtypelem4OLD 15378  ax4567 16359
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-mp 7  ax-4 1319
Copyright terms: Public domain