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

Theorem ax67 1367
Description: Proof of a single axiom that can replace both ax-6o 1324 and ax-7 1304. See ax67to6 1368 and ax67to7 1369 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 1304 . . . . 5 |- (A.yA.xph -> A.xA.yph)
21con3i 114 . . . 4 |- (-. A.xA.yph -> -. A.yA.xph)
32alimi 1338 . . 3 |- (A.x -. A.xA.yph -> A.x -. A.yA.xph)
43con3i 114 . 2 |- (-. A.x -. A.yA.xph -> -. A.x -. A.xA.yph)
5 ax-6o 1324 . 2 |- (-. A.x -. A.xA.yph -> A.yph)
64, 5syl 12 1 |- (-. A.x -. A.yA.xph -> A.yph)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3  A.wal 1296
This theorem is referenced by:  ax67to6 1368  ax67to7 1369
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-4 1319  ax-5o 1321  ax-6o 1324
Copyright terms: Public domain