Theorem ax-9 1511

Description: Derive ax-9 1511 from ax-i9 1510, the modified version for intuitionistic logic. Although ax-9 1511 does hold intuistionistically, in intuitionistic logic it is weaker than ax-i9 1510. (Contributed by NM, 3-Feb-2015.)

Assertion

Ref	Expression
ax-9	⊢ ¬ ∀𝑥 ¬ 𝑥 = 𝑦

Proof of Theorem ax-9

Step	Hyp	Ref	Expression
1		ax-i9 1510	. . 3 ⊢ ∃𝑥 𝑥 = 𝑦
2	1	notnoti 634	. 2 ⊢ ¬ ¬ ∃𝑥 𝑥 = 𝑦
3		alnex 1475	. 2 ⊢ (∀𝑥 ¬ 𝑥 = 𝑦 ↔ ¬ ∃𝑥 𝑥 = 𝑦)
4	2, 3	mtbir 660	1 ⊢ ¬ ∀𝑥 ¬ 𝑥 = 𝑦

Syntax hints:  ¬ wn 3  ∀wal 1329   = wceq 1331  ∃wex 1468

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-5 1423  ax-gen 1425  ax-ie2 1470  ax-i9 1510

This theorem depends on definitions:  df-bi 116  df-tru 1334  df-fal 1337

This theorem is referenced by:  equidqe  1512