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

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

Proof of Theorem 19.39
StepHypRef Expression
1 19.2 1377 . . 3 |- (A.xph -> E.xph)
21imim1i 19 . 2 |- ((E.xph -> E.xps) -> (A.xph -> E.xps))
3 19.35 1426 . 2 |- (E.x(ph -> ps) <-> (A.xph -> E.xps))
42, 3sylibr 217 1 |- ((E.xph -> E.xps) -> E.x(ph -> ps))
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 1296  E.wex 1326
This theorem is referenced by:  iununi 3331  iununiOLD 3332
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 1305  ax-4 1319  ax-5o 1321
This theorem depends on definitions:  df-bi 164  df-an 242  df-ex 1327
Copyright terms: Public domain