Theorem dtruALT 5350

Description: Alternate proof of dtru 5405 which requires more axioms but is shorter and may be easier to understand. Like dtruALT2 5332, it uses ax-pow 5327 rather than ax-pr 5391.

Assuming that ZF set theory is consistent, we cannot prove this theorem unless we specify that 𝑥 and 𝑦 be distinct. Specifically, Theorem spcev 3561 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

Step	Hyp	Ref	Expression
1		0inp0 5320	. . . 4 ⊢ (𝑦 = ∅ → ¬ 𝑦 = {∅})
2		p0ex 5346	. . . . 5 ⊢ {∅} ∈ V
3		eqeq2 2773	. . . . . 6 ⊢ (𝑥 = {∅} → (𝑦 = 𝑥 ↔ 𝑦 = {∅}))
4	3	notbid 321	. . . . 5 ⊢ (𝑥 = {∅} → (¬ 𝑦 = 𝑥 ↔ ¬ 𝑦 = {∅}))
5	2, 4	spcev 3561	. . . 4 ⊢ (¬ 𝑦 = {∅} → ∃𝑥 ¬ 𝑦 = 𝑥)
6	1, 5	syl 18	. . 3 ⊢ (𝑦 = ∅ → ∃𝑥 ¬ 𝑦 = 𝑥)
7		0ex 5261	. . . 4 ⊢ ∅ ∈ V
8		eqeq2 2773	. . . . 5 ⊢ (𝑥 = ∅ → (𝑦 = 𝑥 ↔ 𝑦 = ∅))
9	8	notbid 321	. . . 4 ⊢ (𝑥 = ∅ → (¬ 𝑦 = 𝑥 ↔ ¬ 𝑦 = ∅))
10	7, 9	spcev 3561	. . 3 ⊢ (¬ 𝑦 = ∅ → ∃𝑥 ¬ 𝑦 = 𝑥)
11	6, 10	pm2.61i 184	. 2 ⊢ ∃𝑥 ¬ 𝑦 = 𝑥
12		exnal 1860	. . 3 ⊢ (∃𝑥 ¬ 𝑦 = 𝑥 ↔ ¬ ∀𝑥 𝑦 = 𝑥)
13		eqcom 2768	. . . 4 ⊢ (𝑦 = 𝑥 ↔ 𝑥 = 𝑦)
14	13	albii 1852	. . 3 ⊢ (∀𝑥 𝑦 = 𝑥 ↔ ∀𝑥 𝑥 = 𝑦)
15	12, 14	xchbinx 337	. 2 ⊢ (∃𝑥 ¬ 𝑦 = 𝑥 ↔ ¬ ∀𝑥 𝑥 = 𝑦)
16	11, 15	mpbi 233	1 ⊢ ¬ ∀𝑥 𝑥 = 𝑦

This proof depends on syntax axioms:  ¬ wn 3  ∀wal 1568   = wceq 1570  ∃wex 1812  ∅c0 4279  {csn 4584

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 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-v 3453  df-dif 3902  df-ss 3916  df-nul 4280  df-pw 4559  df-sn 4585

This theorem is used by: (None)