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

Theorem ax67to6 995
Description: Re-derivation of ax-6 953 from ax67 994. Note that ax-6 953 and ax-7 954 are not used by the re-derivation.
Assertion
Ref Expression
ax67to6 |- (-. A.x -. A.xph -> ph)

Proof of Theorem ax67to6
StepHypRef Expression
1 hba1 979 . . . . 5 |- (A.xph -> A.xA.xph)
21con3i 98 . . . 4 |- (-. A.xA.xph -> -. A.xph)
3219.20i 968 . . 3 |- (A.x -. A.xA.xph -> A.x -. A.xph)
43con3i 98 . 2 |- (-. A.x -. A.xph -> -. A.x -. A.xA.xph)
5 ax67 994 . 2 |- (-. A.x -. A.xA.xph -> A.xph)
6 ax-4 951 . 2 |- (A.xph -> ph)
74, 5, 63syl 20 1 |- (-. A.x -. A.xph -> ph)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3  A.wal 950
This theorem is referenced by:  ax67to7 996
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-4 951  ax-5 952  ax-6 953  ax-7 954  ax-gen 955
Copyright terms: Public domain