Theorem ax6dgen 2164

Description: Tarski's system uses the weaker ax6v 2000 instead of the bundled ax-6 1999, so here we show that the degenerate case of ax-6 1999 can be derived. Even though ax-6 1999 is in the list of axioms used, recall that in set.mm, the only statement referencing ax-6 1999 is ax6v 2000. We later rederive from ax6v 2000 the bundled form as ax6 2413 with the help of the auxiliary axiom schemes. (Contributed by NM, 23-Apr-2017.)

Assertion

Ref	Expression
ax6dgen	⊢ ¬ ∀𝑥 ¬ 𝑥 = 𝑥

Proof of Theorem ax6dgen

Step	Hyp	Ref	Expression
1		equid 2044	. 2 ⊢ 𝑥 = 𝑥
2	1	notnoti 144	. . 3 ⊢ ¬ ¬ 𝑥 = 𝑥
3	2	spfalw 2012	. 2 ⊢ (∀𝑥 ¬ 𝑥 = 𝑥 → ¬ 𝑥 = 𝑥)
4	1, 3	mt2 203	1 ⊢ ¬ ∀𝑥 ¬ 𝑥 = 𝑥

This proof depends on syntax axioms:  ¬ wn 3  ∀wal 1567

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040

This proof depends on definitions:  df-bi 210  df-ex 1812

This theorem is used by: (None)