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

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

Proof of Theorem 19.36
StepHypRef Expression
1 19.35 754 . 2 |- (E.x(ph -> ps) <-> (A.xph -> E.xps))
2 19.36.1 . . . 4 |- (ps -> A.xps)
3219.9r 718 . . 3 |- (ps <-> E.xps)
43imbi2i 160 . 2 |- ((A.xph -> ps) <-> (A.xph -> E.xps))
51, 4bitr4 154 1 |- (E.x(ph -> ps) <-> (A.xph -> ps))
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127  A.wal 672  E.wex 678
This theorem is referenced by:  19.36i 758  19.36v 958  cla4gf 1394
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