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

Axiom ax-6 675
Description: Axiom of Quantified Negation. This axiom is used to manipulate negated quantifiers. One of the 4 axioms of pure predicate calculus. Equivalent to axiom scheme C7' in [Megill] p. 448 (p. 16 of the preprint). Another equivalent variant ax6 711 appears as Axiom C5-2 of [Monk2] p. 113.
Assertion
Ref Expression
ax-6 |- (-. A.x -. A.xph -> ph)

Detailed syntax breakdown of Axiom ax-6
StepHypRef Expression
1 wph . . . . . 6 wff ph
2 vx . . . . . 6 set x
31, 2wal 672 . . . . 5 wff A.xph
43wn 1 . . . 4 wff -. A.xph
54, 2wal 672 . . 3 wff A.x -. A.xph
65wn 1 . 2 wff -. A.x -. A.xph
76, 1wi 2 1 wff (-. A.x -. A.xph -> ph)
Colors of variables: wff set class
This axiom is referenced by:  a6e 688  hbne 699  hbnt 710  19.9r 718  ax9a 808  eqid 810
metamath.org