Theorem n0snor2el 4764

Description: A nonempty set is either a singleton or contains at least two different elements. (Contributed by AV, 20-Sep-2020.)

Assertion

Ref	Expression
n0snor2el	⊢ (𝐴 ≠ ∅ → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦 ∨ ∃𝑧 𝐴 = {𝑧}))

Distinct variable groups:   𝑦,𝐴,𝑥   𝑧,𝐴

Proof of Theorem n0snor2el

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		issn 4763	. . . 4 ⊢ (∃𝑤 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑤 = 𝑦 → ∃𝑧 𝐴 = {𝑧})
2	1	olcd 871	. . 3 ⊢ (∃𝑤 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑤 = 𝑦 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦 ∨ ∃𝑧 𝐴 = {𝑧}))
3	2	a1d 25	. 2 ⊢ (∃𝑤 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑤 = 𝑦 → (𝐴 ≠ ∅ → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦 ∨ ∃𝑧 𝐴 = {𝑧})))
4		df-ne 2944	. . . . . . 7 ⊢ (𝑤 ≠ 𝑦 ↔ ¬ 𝑤 = 𝑦)
5	4	rexbii 3181	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐴 𝑤 ≠ 𝑦 ↔ ∃𝑦 ∈ 𝐴 ¬ 𝑤 = 𝑦)
6		rexnal 3169	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐴 ¬ 𝑤 = 𝑦 ↔ ¬ ∀𝑦 ∈ 𝐴 𝑤 = 𝑦)
7	5, 6	bitri 274	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 𝑤 ≠ 𝑦 ↔ ¬ ∀𝑦 ∈ 𝐴 𝑤 = 𝑦)
8	7	ralbii 3092	. . . 4 ⊢ (∀𝑤 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑤 ≠ 𝑦 ↔ ∀𝑤 ∈ 𝐴 ¬ ∀𝑦 ∈ 𝐴 𝑤 = 𝑦)
9		ralnex 3167	. . . 4 ⊢ (∀𝑤 ∈ 𝐴 ¬ ∀𝑦 ∈ 𝐴 𝑤 = 𝑦 ↔ ¬ ∃𝑤 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑤 = 𝑦)
10	8, 9	bitri 274	. . 3 ⊢ (∀𝑤 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑤 ≠ 𝑦 ↔ ¬ ∃𝑤 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑤 = 𝑦)
11		neeq1 3006	. . . . . . . 8 ⊢ (𝑤 = 𝑥 → (𝑤 ≠ 𝑦 ↔ 𝑥 ≠ 𝑦))
12	11	rexbidv 3226	. . . . . . 7 ⊢ (𝑤 = 𝑥 → (∃𝑦 ∈ 𝐴 𝑤 ≠ 𝑦 ↔ ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦))
13	12	rspccva 3560	. . . . . 6 ⊢ ((∀𝑤 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑤 ≠ 𝑦 ∧ 𝑥 ∈ 𝐴) → ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦)
14	13	reximdva0 4285	. . . . 5 ⊢ ((∀𝑤 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑤 ≠ 𝑦 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦)
15	14	orcd 870	. . . 4 ⊢ ((∀𝑤 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑤 ≠ 𝑦 ∧ 𝐴 ≠ ∅) → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦 ∨ ∃𝑧 𝐴 = {𝑧}))
16	15	ex 413	. . 3 ⊢ (∀𝑤 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑤 ≠ 𝑦 → (𝐴 ≠ ∅ → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦 ∨ ∃𝑧 𝐴 = {𝑧})))
17	10, 16	sylbir 234	. 2 ⊢ (¬ ∃𝑤 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑤 = 𝑦 → (𝐴 ≠ ∅ → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦 ∨ ∃𝑧 𝐴 = {𝑧})))
18	3, 17	pm2.61i 182	1 ⊢ (𝐴 ≠ ∅ → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦 ∨ ∃𝑧 𝐴 = {𝑧}))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   ∨ wo 844   = wceq 1539  ∃wex 1782   ≠ wne 2943  ∀wral 3064  ∃wrex 3065  ∅c0 4256  {csn 4561

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ne 2944  df-ral 3069  df-rex 3070  df-v 3434  df-dif 3890  df-in 3894  df-ss 3904  df-nul 4257  df-sn 4562

This theorem is referenced by:  iunopeqop  5435