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

Theorem dtruALT 5289
Description: Alternate proof of dtru 5271 which requires more axioms but is shorter and may be easier to understand.

Assuming that ZF set theory is consistent, we cannot prove this theorem unless we specify that 𝑥 and 𝑦 be distinct. Specifically, theorem spcev 3607 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 5259 . . . 4 (𝑦 = ∅ → ¬ 𝑦 = {∅})
2 p0ex 5285 . . . . 5 {∅} ∈ V
3 eqeq2 2833 . . . . . 6 (𝑥 = {∅} → (𝑦 = 𝑥𝑦 = {∅}))
43notbid 320 . . . . 5 (𝑥 = {∅} → (¬ 𝑦 = 𝑥 ↔ ¬ 𝑦 = {∅}))
52, 4spcev 3607 . . . 4 𝑦 = {∅} → ∃𝑥 ¬ 𝑦 = 𝑥)
61, 5syl 17 . . 3 (𝑦 = ∅ → ∃𝑥 ¬ 𝑦 = 𝑥)
7 0ex 5211 . . . 4 ∅ ∈ V
8 eqeq2 2833 . . . . 5 (𝑥 = ∅ → (𝑦 = 𝑥𝑦 = ∅))
98notbid 320 . . . 4 (𝑥 = ∅ → (¬ 𝑦 = 𝑥 ↔ ¬ 𝑦 = ∅))
107, 9spcev 3607 . . 3 𝑦 = ∅ → ∃𝑥 ¬ 𝑦 = 𝑥)
116, 10pm2.61i 184 . 2 𝑥 ¬ 𝑦 = 𝑥
12 exnal 1827 . . 3 (∃𝑥 ¬ 𝑦 = 𝑥 ↔ ¬ ∀𝑥 𝑦 = 𝑥)
13 eqcom 2828 . . . 4 (𝑦 = 𝑥𝑥 = 𝑦)
1413albii 1820 . . 3 (∀𝑥 𝑦 = 𝑥 ↔ ∀𝑥 𝑥 = 𝑦)
1512, 14xchbinx 336 . 2 (∃𝑥 ¬ 𝑦 = 𝑥 ↔ ¬ ∀𝑥 𝑥 = 𝑦)
1611, 15mpbi 232 1 ¬ ∀𝑥 𝑥 = 𝑦
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wal 1535   = wceq 1537  wex 1780  c0 4291  {csn 4567
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-v 3496  df-dif 3939  df-in 3943  df-ss 3952  df-nul 4292  df-pw 4541  df-sn 4568
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator