Theorem distel 36367

Description: Distinctors in terms of membership. (NOTE: this only works with relations where we can prove el 5417 and elirrv 9572.) (Contributed by Scott Fenton, 15-Dec-2010.)

Assertion

Ref	Expression
distel	⊢ (¬ ∀𝑦 𝑦 = 𝑥 ↔ ¬ ∀𝑦 ¬ 𝑥 ∈ 𝑦)

Proof of Theorem distel

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		el 5417	. . 3 ⊢ ∃𝑧 𝑥 ∈ 𝑧
2		df-ex 1813	. . . 4 ⊢ (∃𝑧 𝑥 ∈ 𝑧 ↔ ¬ ∀𝑧 ¬ 𝑥 ∈ 𝑧)
3		nfnae 2465	. . . . . 6 ⊢ Ⅎ𝑦 ¬ ∀𝑦 𝑦 = 𝑥
4		dveel1 2492	. . . . . . . 8 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (𝑥 ∈ 𝑧 → ∀𝑦 𝑥 ∈ 𝑧))
5	3, 4	nf5d 2319	. . . . . . 7 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦 𝑥 ∈ 𝑧)
6	5	nfnd 1891	. . . . . 6 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦 ¬ 𝑥 ∈ 𝑧)
7		elequ2 2160	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ 𝑦))
8	7	notbid 321	. . . . . . 7 ⊢ (𝑧 = 𝑦 → (¬ 𝑥 ∈ 𝑧 ↔ ¬ 𝑥 ∈ 𝑦))
9	8	a1i 11	. . . . . 6 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (𝑧 = 𝑦 → (¬ 𝑥 ∈ 𝑧 ↔ ¬ 𝑥 ∈ 𝑦)))
10	3, 6, 9	cbvald 2438	. . . . 5 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (∀𝑧 ¬ 𝑥 ∈ 𝑧 ↔ ∀𝑦 ¬ 𝑥 ∈ 𝑦))
11	10	notbid 321	. . . 4 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (¬ ∀𝑧 ¬ 𝑥 ∈ 𝑧 ↔ ¬ ∀𝑦 ¬ 𝑥 ∈ 𝑦))
12	2, 11	bitrid 286	. . 3 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (∃𝑧 𝑥 ∈ 𝑧 ↔ ¬ ∀𝑦 ¬ 𝑥 ∈ 𝑦))
13	1, 12	mpbii 236	. 2 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → ¬ ∀𝑦 ¬ 𝑥 ∈ 𝑦)
14		elirrv 9572	. . . . 5 ⊢ ¬ 𝑦 ∈ 𝑦
15		elequ1 2152	. . . . 5 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ 𝑦 ↔ 𝑥 ∈ 𝑦))
16	14, 15	mtbii 329	. . . 4 ⊢ (𝑦 = 𝑥 → ¬ 𝑥 ∈ 𝑦)
17	16	alimi 1844	. . 3 ⊢ (∀𝑦 𝑦 = 𝑥 → ∀𝑦 ¬ 𝑥 ∈ 𝑦)
18	17	con3i 155	. 2 ⊢ (¬ ∀𝑦 ¬ 𝑥 ∈ 𝑦 → ¬ ∀𝑦 𝑦 = 𝑥)
19	13, 18	impbii 212	1 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 ↔ ¬ ∀𝑦 ¬ 𝑥 ∈ 𝑦)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209  ∀wal 1568  ∃wex 1812

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-10 2178  ax-11 2194  ax-12 2215  ax-13 2403  ax-sep 5255  ax-pr 5402  ax-reg 9567

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817

This theorem is used by: (None)