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

Theorem axc5sp1 36129
Description: A special case of ax-c5 36089 without using ax-c5 36089 or ax-5 1912. (Contributed by NM, 13-Jan-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
axc5sp1 (∀𝑦 ¬ 𝑥 = 𝑥 → ¬ 𝑥 = 𝑥)

Proof of Theorem axc5sp1
StepHypRef Expression
1 equidqe 36128 . 2 ¬ ∀𝑦 ¬ 𝑥 = 𝑥
21pm2.21i 119 1 (∀𝑦 ¬ 𝑥 = 𝑥 → ¬ 𝑥 = 𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wal 1536
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-c7 36091  ax-c10 36092
This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1782
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator