MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dtruALT2 Structured version   Visualization version   GIF version

Theorem dtruALT2 5343
Description: Alternate proof of dtru 5420 using ax-pow 5338 instead of ax-pr 5406. See dtruALT 5361 for another proof using ax-pow 5338 instead of ax-pr 5406. (Contributed by NM, 7-Nov-2006.) Avoid ax-13 2406. (Revised by BJ, 31-May-2019.) Avoid ax-12 2216. (Revised by Rohan Ridenour, 9-Oct-2024.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
dtruALT2 ¬ ∀𝑥 𝑥 = 𝑦
Distinct variable group:   𝑥,𝑦

Proof of Theorem dtruALT2
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elALT2 5342 . . . 4 𝑤 𝑥𝑤
2 ax-nul 5271 . . . . 5 𝑧𝑥 ¬ 𝑥𝑧
3 elequ1 2153 . . . . . . 7 (𝑥 = 𝑤 → (𝑥𝑧𝑤𝑧))
43notbid 321 . . . . . 6 (𝑥 = 𝑤 → (¬ 𝑥𝑧 ↔ ¬ 𝑤𝑧))
54spw 2067 . . . . 5 (∀𝑥 ¬ 𝑥𝑧 → ¬ 𝑥𝑧)
62, 5eximii 1870 . . . 4 𝑧 ¬ 𝑥𝑧
7 exdistrv 1988 . . . 4 (∃𝑤𝑧(𝑥𝑤 ∧ ¬ 𝑥𝑧) ↔ (∃𝑤 𝑥𝑤 ∧ ∃𝑧 ¬ 𝑥𝑧))
81, 6, 7mpbir2an 724 . . 3 𝑤𝑧(𝑥𝑤 ∧ ¬ 𝑥𝑧)
9 ax9v2 2159 . . . . . 6 (𝑤 = 𝑧 → (𝑥𝑤𝑥𝑧))
109com12 33 . . . . 5 (𝑥𝑤 → (𝑤 = 𝑧𝑥𝑧))
1110con3dimp 414 . . . 4 ((𝑥𝑤 ∧ ¬ 𝑥𝑧) → ¬ 𝑤 = 𝑧)
12112eximi 1869 . . 3 (∃𝑤𝑧(𝑥𝑤 ∧ ¬ 𝑥𝑧) → ∃𝑤𝑧 ¬ 𝑤 = 𝑧)
13 equequ2 2059 . . . . . . 7 (𝑧 = 𝑦 → (𝑤 = 𝑧𝑤 = 𝑦))
1413notbid 321 . . . . . 6 (𝑧 = 𝑦 → (¬ 𝑤 = 𝑧 ↔ ¬ 𝑤 = 𝑦))
15 ax7v1 2043 . . . . . . . 8 (𝑥 = 𝑤 → (𝑥 = 𝑦𝑤 = 𝑦))
1615con3d 153 . . . . . . 7 (𝑥 = 𝑤 → (¬ 𝑤 = 𝑦 → ¬ 𝑥 = 𝑦))
1716spimevw 2018 . . . . . 6 𝑤 = 𝑦 → ∃𝑥 ¬ 𝑥 = 𝑦)
1814, 17biimtrdi 256 . . . . 5 (𝑧 = 𝑦 → (¬ 𝑤 = 𝑧 → ∃𝑥 ¬ 𝑥 = 𝑦))
19 ax7v1 2043 . . . . . . . 8 (𝑥 = 𝑧 → (𝑥 = 𝑦𝑧 = 𝑦))
2019con3d 153 . . . . . . 7 (𝑥 = 𝑧 → (¬ 𝑧 = 𝑦 → ¬ 𝑥 = 𝑦))
2120spimevw 2018 . . . . . 6 𝑧 = 𝑦 → ∃𝑥 ¬ 𝑥 = 𝑦)
2221a1d 26 . . . . 5 𝑧 = 𝑦 → (¬ 𝑤 = 𝑧 → ∃𝑥 ¬ 𝑥 = 𝑦))
2318, 22pm2.61i 184 . . . 4 𝑤 = 𝑧 → ∃𝑥 ¬ 𝑥 = 𝑦)
2423exlimivv 1965 . . 3 (∃𝑤𝑧 ¬ 𝑤 = 𝑧 → ∃𝑥 ¬ 𝑥 = 𝑦)
258, 12, 24mp2b 10 . 2 𝑥 ¬ 𝑥 = 𝑦
26 exnal 1860 . 2 (∃𝑥 ¬ 𝑥 = 𝑦 ↔ ¬ ∀𝑥 𝑥 = 𝑦)
2725, 26mpbi 233 1 ¬ ∀𝑥 𝑥 = 𝑦
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401  wal 1568   = wceq 1570  wex 1812  wcel 2146
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-nul 5271  ax-pow 5338
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813
This theorem is used by:  dtrucor  5344  dvdemo1  5346  nfnid  5348  axc16b  5362  eunex  5363  brprcneuALT  6876
  Copyright terms: Public domain W3C validator