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

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

Proof of Theorem 19.25
StepHypRef Expression
1 19.35 754 . . . 4 |- (E.x(ph -> ps) <-> (A.xph -> E.xps))
21biimp 133 . . 3 |- (E.x(ph -> ps) -> (A.xph -> E.xps))
3219.20i 691 . 2 |- (A.yE.x(ph -> ps) -> A.y(A.xph -> E.xps))
4 19.22 722 . 2 |- (A.y(A.xph -> E.xps) -> (E.yA.xph -> E.yE.xps))
53, 4syl 12 1 |- (A.yE.x(ph -> ps) -> (E.yA.xph -> E.yE.xps))
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-gen 677
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679
metamath.org