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

Theorem equidq 36938
Description: equid 2015 with universal quantifier 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
equidq 𝑦 𝑥 = 𝑥

Proof of Theorem equidq
StepHypRef Expression
1 equidqe 36936 . 2 ¬ ∀𝑦 ¬ 𝑥 = 𝑥
2 ax10fromc7 36909 . . 3 (¬ ∀𝑦 𝑥 = 𝑥 → ∀𝑦 ¬ ∀𝑦 𝑥 = 𝑥)
3 hbequid 36923 . . . 4 (𝑥 = 𝑥 → ∀𝑦 𝑥 = 𝑥)
43con3i 154 . . 3 (¬ ∀𝑦 𝑥 = 𝑥 → ¬ 𝑥 = 𝑥)
52, 4alrimih 1826 . 2 (¬ ∀𝑦 𝑥 = 𝑥 → ∀𝑦 ¬ 𝑥 = 𝑥)
61, 5mt3 200 1 𝑦 𝑥 = 𝑥
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  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-c5 36897  ax-c4 36898  ax-c7 36899  ax-c10 36900  ax-c9 36904
This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1783
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator