Theorem axc5sp1 36937

Description: A special case of ax-c5 36897 without using ax-c5 36897 or ax-5 1913. (Contributed by NM, 13-Jan-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
axc5sp1	⊢ (∀𝑦 ¬ 𝑥 = 𝑥 → ¬ 𝑥 = 𝑥)

Proof of Theorem axc5sp1

Step	Hyp	Ref	Expression
1		equidqe 36936	. 2 ⊢ ¬ ∀𝑦 ¬ 𝑥 = 𝑥
2	1	pm2.21i 119	1 ⊢ (∀𝑦 ¬ 𝑥 = 𝑥 → ¬ 𝑥 = 𝑥)

Syntax hints:  ¬ wn 3   → wi 4  ∀wal 1537

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-c7 36899  ax-c10 36900

This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1783

This theorem is referenced by: (None)