Theorem nalset 4130

Description: No set contains all sets. Theorem 41 of [Suppes] p. 30. (Contributed by NM, 23-Aug-1993.)

Assertion

Ref	Expression
nalset	⊢ ¬ ∃𝑥∀𝑦 𝑦 ∈ 𝑥

Distinct variable group:   𝑥,𝑦

Proof of Theorem nalset

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		alexnim 1648	. 2 ⊢ (∀𝑥∃𝑦 ¬ 𝑦 ∈ 𝑥 → ¬ ∃𝑥∀𝑦 𝑦 ∈ 𝑥)
2		ax-sep 4118	. . 3 ⊢ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ (𝑧 ∈ 𝑥 ∧ ¬ 𝑧 ∈ 𝑧))
3		elequ1 2152	. . . . . 6 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝑦 ↔ 𝑦 ∈ 𝑦))
4		elequ1 2152	. . . . . . 7 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝑥 ↔ 𝑦 ∈ 𝑥))
5		elequ1 2152	. . . . . . . . 9 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝑧 ↔ 𝑦 ∈ 𝑧))
6		elequ2 2153	. . . . . . . . 9 ⊢ (𝑧 = 𝑦 → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ 𝑦))
7	5, 6	bitrd 188	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝑧 ↔ 𝑦 ∈ 𝑦))
8	7	notbid 667	. . . . . . 7 ⊢ (𝑧 = 𝑦 → (¬ 𝑧 ∈ 𝑧 ↔ ¬ 𝑦 ∈ 𝑦))
9	4, 8	anbi12d 473	. . . . . 6 ⊢ (𝑧 = 𝑦 → ((𝑧 ∈ 𝑥 ∧ ¬ 𝑧 ∈ 𝑧) ↔ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ 𝑦)))
10	3, 9	bibi12d 235	. . . . 5 ⊢ (𝑧 = 𝑦 → ((𝑧 ∈ 𝑦 ↔ (𝑧 ∈ 𝑥 ∧ ¬ 𝑧 ∈ 𝑧)) ↔ (𝑦 ∈ 𝑦 ↔ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ 𝑦))))
11	10	spv 1860	. . . 4 ⊢ (∀𝑧(𝑧 ∈ 𝑦 ↔ (𝑧 ∈ 𝑥 ∧ ¬ 𝑧 ∈ 𝑧)) → (𝑦 ∈ 𝑦 ↔ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ 𝑦)))
12		pclem6 1374	. . . 4 ⊢ ((𝑦 ∈ 𝑦 ↔ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ 𝑦)) → ¬ 𝑦 ∈ 𝑥)
13	11, 12	syl 14	. . 3 ⊢ (∀𝑧(𝑧 ∈ 𝑦 ↔ (𝑧 ∈ 𝑥 ∧ ¬ 𝑧 ∈ 𝑧)) → ¬ 𝑦 ∈ 𝑥)
14	2, 13	eximii 1602	. 2 ⊢ ∃𝑦 ¬ 𝑦 ∈ 𝑥
15	1, 14	mpg 1451	1 ⊢ ¬ ∃𝑥∀𝑦 𝑦 ∈ 𝑥

Syntax hints:  ¬ wn 3   ∧ wa 104   ↔ wb 105  ∀wal 1351  ∃wex 1492

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-5 1447  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-13 2150  ax-14 2151  ax-sep 4118

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-fal 1359  df-nf 1461

This theorem is referenced by:  vnex  4131