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

Theorem ax67 994
Description: Proof of a single axiom that can replace both ax-6 953 and ax-7 954. See ax67to6 995 and ax67to7 996 for the re-derivation of those axioms.
Assertion
Ref Expression
ax67 |- (-. A.x -. A.yA.xph -> A.yph)

Proof of Theorem ax67
StepHypRef Expression
1 ax-7 954 . . . . 5 |- (A.yA.xph -> A.xA.yph)
21con3i 98 . . . 4 |- (-. A.xA.yph -> -. A.yA.xph)
3219.20i 968 . . 3 |- (A.x -. A.xA.yph -> A.x -. A.yA.xph)
43con3i 98 . 2 |- (-. A.x -. A.yA.xph -> -. A.x -. A.xA.yph)
5 ax-6 953 . 2 |- (-. A.x -. A.xA.yph -> A.yph)
64, 5syl 10 1 |- (-. A.x -. A.yA.xph -> A.yph)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3  A.wal 950
This theorem is referenced by:  ax67to6 995  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