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

Theorem 19.38 760
Description: Theorem 19.38 of [Margaris] p. 90.
Assertion
Ref Expression
19.38 |- ((E.xph -> A.xps) -> A.x(ph -> ps))

Proof of Theorem 19.38
StepHypRef Expression
1 hbe1 709 . . 3 |- (E.xph -> A.xE.xph)
2 hba1 698 . . 3 |- (A.xps -> A.xA.xps)
31, 2hbim 702 . 2 |- ((E.xph -> A.xps) -> A.x(E.xph -> A.xps))
4 19.8a 712 . . 3 |- (ph -> E.xph)
5 ax-4 673 . . 3 |- (A.xps -> ps)
64, 5syl34 20 . 2 |- ((E.xph -> A.xps) -> (ph -> ps))
73, 619.21ai 740 1 |- ((E.xph -> A.xps) -> A.x(ph -> ps))
Colors of variables: wff set class
Syntax hints:   -> wi 2  A.wal 672  E.wex 678
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-gen 677
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679
metamath.org