Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ax6fromc10 Structured version   Visualization version   GIF version

Theorem ax6fromc10 40047
Description: Rederivation of Axiom ax-6 1999 from ax-c7 40036, ax-c10 40037, ax-gen 1827 and propositional calculus. See axc10 2414 for the derivation of ax-c10 40037 from ax-6 1999. Lemma L18 in [Megill] p. 446 (p. 14 of the preprint). (Contributed by NM, 14-May-1993.) (Proof modification is discouraged.) Use ax-6 1999 instead. (New usage is discouraged.)
Assertion
Ref Expression
ax6fromc10 ¬ ∀𝑥 ¬ 𝑥 = 𝑦

Proof of Theorem ax6fromc10
StepHypRef Expression
1 ax-c10 40037 . 2 (∀𝑥(𝑥 = 𝑦 → ∀𝑥 ¬ ∀𝑥 ¬ 𝑥 = 𝑦) → ¬ ∀𝑥 ¬ 𝑥 = 𝑦)
2 ax-c7 40036 . . 3 (¬ ∀𝑥 ¬ ∀𝑥 ¬ 𝑥 = 𝑦 → ¬ 𝑥 = 𝑦)
32con4i 115 . 2 (𝑥 = 𝑦 → ∀𝑥 ¬ ∀𝑥 ¬ 𝑥 = 𝑦)
41, 3mpg 1829 1 ¬ ∀𝑥 ¬ 𝑥 = 𝑦
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∀wal 1567
This proof depends on axioms:  ax-mp 5  ax-3 8  ax-gen 1827  ax-c7 40036  ax-c10 40037
This theorem is used by:  equidqe  40073
  Copyright terms: Public domain W3C validator