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

Theorem dtruALT 5393
Description: Alternate proof of dtru 5446 which requires more axioms but is shorter and may be easier to understand. Like dtruALT2 5375, it uses ax-pow 5370 rather than ax-pr 5437.

Assuming that ZF set theory is consistent, we cannot prove this theorem unless we specify that 𝑥 and 𝑦 be distinct. Specifically, Theorem spcev 3605 requires that 𝑥 must not occur in the subexpression ¬ 𝑦 = {∅} in step 4 nor in the subexpression ¬ 𝑦 = ∅ in step 9. The proof verifier will require that 𝑥 and 𝑦 be in a distinct variable group to ensure this. You can check this by deleting the $d statement in set.mm and rerunning the verifier, which will print a detailed explanation of the distinct variable violation. (Contributed by NM, 15-Jul-1994.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion
Ref Expression
dtruALT ¬ ∀𝑥 𝑥 = 𝑦
Distinct variable group:   𝑥,𝑦

Proof of Theorem dtruALT
StepHypRef Expression
1 0inp0 5364 . . . 4 (𝑦 = ∅ → ¬ 𝑦 = {∅})
2 p0ex 5389 . . . . 5 {∅} ∈ V
3 eqeq2 2746 . . . . . 6 (𝑥 = {∅} → (𝑦 = 𝑥𝑦 = {∅}))
43notbid 318 . . . . 5 (𝑥 = {∅} → (¬ 𝑦 = 𝑥 ↔ ¬ 𝑦 = {∅}))
52, 4spcev 3605 . . . 4 𝑦 = {∅} → ∃𝑥 ¬ 𝑦 = 𝑥)
61, 5syl 17 . . 3 (𝑦 = ∅ → ∃𝑥 ¬ 𝑦 = 𝑥)
7 0ex 5312 . . . 4 ∅ ∈ V
8 eqeq2 2746 . . . . 5 (𝑥 = ∅ → (𝑦 = 𝑥𝑦 = ∅))
98notbid 318 . . . 4 (𝑥 = ∅ → (¬ 𝑦 = 𝑥 ↔ ¬ 𝑦 = ∅))
107, 9spcev 3605 . . 3 𝑦 = ∅ → ∃𝑥 ¬ 𝑦 = 𝑥)
116, 10pm2.61i 182 . 2 𝑥 ¬ 𝑦 = 𝑥
12 exnal 1823 . . 3 (∃𝑥 ¬ 𝑦 = 𝑥 ↔ ¬ ∀𝑥 𝑦 = 𝑥)
13 eqcom 2741 . . . 4 (𝑦 = 𝑥𝑥 = 𝑦)
1413albii 1815 . . 3 (∀𝑥 𝑦 = 𝑥 ↔ ∀𝑥 𝑥 = 𝑦)
1512, 14xchbinx 334 . 2 (∃𝑥 ¬ 𝑦 = 𝑥 ↔ ¬ ∀𝑥 𝑥 = 𝑦)
1611, 15mpbi 230 1 ¬ ∀𝑥 𝑥 = 𝑦
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wal 1534   = wceq 1536  wex 1775  c0 4338  {csn 4630
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-ext 2705  ax-sep 5301  ax-nul 5311  ax-pow 5370
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1539  df-fal 1549  df-ex 1776  df-sb 2062  df-clab 2712  df-cleq 2726  df-clel 2813  df-ne 2938  df-v 3479  df-dif 3965  df-ss 3979  df-nul 4339  df-pw 4606  df-sn 4631
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator