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

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

Proof of Theorem 19.37
StepHypRef Expression
1 19.35 754 . 2 |- (E.x(ph -> ps) <-> (A.xph -> E.xps))
2 19.37.1 . . . 4 |- (ph -> A.xph)
3219.3r 714 . . 3 |- (ph <-> A.xph)
43imbi1i 161 . 2 |- ((ph -> E.xps) <-> (A.xph -> E.xps))
51, 4bitr4 154 1 |- (E.x(ph -> ps) <-> (ph -> E.xps))
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127  A.wal 672  E.wex 678
This theorem is referenced by:  19.37v 961
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