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

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

Proof of Theorem 19.18
StepHypRef Expression
1 bi1 148 . . . 4 |- ((ph <-> ps) -> (ph -> ps))
2119.20i 992 . . 3 |- (A.x(ph <-> ps) -> A.x(ph -> ps))
3 19.22 1039 . . 3 |- (A.x(ph -> ps) -> (E.xph -> E.xps))
42, 3syl 10 . 2 |- (A.x(ph <-> ps) -> (E.xph -> E.xps))
5 bi2 149 . . . 4 |- ((ph <-> ps) -> (ps -> ph))
6519.20i 992 . . 3 |- (A.x(ph <-> ps) -> A.x(ps -> ph))
7 19.22 1039 . . 3 |- (A.x(ps -> ph) -> (E.xps -> E.xph))
86, 7syl 10 . 2 |- (A.x(ph <-> ps) -> (E.xps -> E.xph))
94, 8impbid 516 1 |- (A.x(ph <-> ps) -> (E.xph <-> E.xps))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146  A.wal 954  E.wex 980
This theorem is referenced by:  exbii 1051  19.19 1055  exbid 1105  exintrbi 1118
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
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981
Copyright terms: Public domain