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

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

Proof of Theorem 19.19
StepHypRef Expression
1 19.18 1048 . 2 |- (A.x(ph <-> ps) -> (E.xph <-> E.xps))
2 19.19.1 . . 3 |- (ph -> A.xph)
3219.9 1034 . 2 |- (E.xph <-> ph)
41, 3syl5bbr 533 1 |- (A.x(ph <-> ps) -> (ph <-> E.xps))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146  A.wal 952  E.wex 978
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 961  ax-4 971  ax-5o 973  ax-6o 976
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 979
Copyright terms: Public domain