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

Theorem a6e 688
Description: Abbreviated version of ax-6 675.
Assertion
Ref Expression
a6e |- (E.xA.xph -> ph)

Proof of Theorem a6e
StepHypRef Expression
1 df-ex 679 . 2 |- (E.xA.xph <-> -. A.x -. A.xph)
2 ax-6 675 . 2 |- (-. A.x -. A.xph -> ph)
31, 2sylbi 174 1 |- (E.xA.xph -> ph)
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2  A.wal 672  E.wex 678
This theorem is referenced by:  ax9 807
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-6 675
This theorem depends on definitions:  df-bi 128  df-ex 679
metamath.org