Theorem mo0sn 50035

Description: Two ways of expressing "at most one" element in a class. (Contributed by Zhi Wang, 19-Sep-2024.)

Assertion

Ref	Expression
mo0sn	⊢ (∃*𝑥 𝑥 ∈ 𝐴 ↔ (𝐴 = ∅ ∨ ∃𝑦 𝐴 = {𝑦}))

Distinct variable groups:   𝑥,𝐴   𝑦,𝐴

Proof of Theorem mo0sn

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1946	. . 3 ⊢ Ⅎ𝑧 𝑥 ∈ 𝐴
2		nfv 1946	. . 3 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐴
3		eleq1w 2843	. . 3 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
4	1, 2, 3	cbvmow 2628	. 2 ⊢ (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∃*𝑧 𝑧 ∈ 𝐴)
5		neq0 4298	. . . . . . . 8 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑧 𝑧 ∈ 𝐴)
6	5	anbi1i 636	. . . . . . 7 ⊢ ((¬ 𝐴 = ∅ ∧ ∃*𝑧 𝑧 ∈ 𝐴) ↔ (∃𝑧 𝑧 ∈ 𝐴 ∧ ∃*𝑧 𝑧 ∈ 𝐴))
7		df-eu 2594	. . . . . . 7 ⊢ (∃!𝑧 𝑧 ∈ 𝐴 ↔ (∃𝑧 𝑧 ∈ 𝐴 ∧ ∃*𝑧 𝑧 ∈ 𝐴))
8		eu6 2599	. . . . . . 7 ⊢ (∃!𝑧 𝑧 ∈ 𝐴 ↔ ∃𝑦∀𝑧(𝑧 ∈ 𝐴 ↔ 𝑧 = 𝑦))
9	6, 7, 8	3bitr2i 302	. . . . . 6 ⊢ ((¬ 𝐴 = ∅ ∧ ∃*𝑧 𝑧 ∈ 𝐴) ↔ ∃𝑦∀𝑧(𝑧 ∈ 𝐴 ↔ 𝑧 = 𝑦))
10		dfcleq 2753	. . . . . . . 8 ⊢ (𝐴 = {𝑦} ↔ ∀𝑧(𝑧 ∈ 𝐴 ↔ 𝑧 ∈ {𝑦}))
11		velsn 4596	. . . . . . . . . 10 ⊢ (𝑧 ∈ {𝑦} ↔ 𝑧 = 𝑦)
12	11	bibi2i 340	. . . . . . . . 9 ⊢ ((𝑧 ∈ 𝐴 ↔ 𝑧 ∈ {𝑦}) ↔ (𝑧 ∈ 𝐴 ↔ 𝑧 = 𝑦))
13	12	albii 1851	. . . . . . . 8 ⊢ (∀𝑧(𝑧 ∈ 𝐴 ↔ 𝑧 ∈ {𝑦}) ↔ ∀𝑧(𝑧 ∈ 𝐴 ↔ 𝑧 = 𝑦))
14	10, 13	sylbbr 239	. . . . . . 7 ⊢ (∀𝑧(𝑧 ∈ 𝐴 ↔ 𝑧 = 𝑦) → 𝐴 = {𝑦})
15	14	eximi 1867	. . . . . 6 ⊢ (∃𝑦∀𝑧(𝑧 ∈ 𝐴 ↔ 𝑧 = 𝑦) → ∃𝑦 𝐴 = {𝑦})
16	9, 15	sylbi 220	. . . . 5 ⊢ ((¬ 𝐴 = ∅ ∧ ∃*𝑧 𝑧 ∈ 𝐴) → ∃𝑦 𝐴 = {𝑦})
17	16	expcom 419	. . . 4 ⊢ (∃*𝑧 𝑧 ∈ 𝐴 → (¬ 𝐴 = ∅ → ∃𝑦 𝐴 = {𝑦}))
18	17	orrd 877	. . 3 ⊢ (∃*𝑧 𝑧 ∈ 𝐴 → (𝐴 = ∅ ∨ ∃𝑦 𝐴 = {𝑦}))
19		mo0 50033	. . . 4 ⊢ (𝐴 = ∅ → ∃*𝑧 𝑧 ∈ 𝐴)
20		mosn 50032	. . . . 5 ⊢ (𝐴 = {𝑦} → ∃*𝑧 𝑧 ∈ 𝐴)
21	20	exlimiv 1962	. . . 4 ⊢ (∃𝑦 𝐴 = {𝑦} → ∃*𝑧 𝑧 ∈ 𝐴)
22	19, 21	jaoi 871	. . 3 ⊢ ((𝐴 = ∅ ∨ ∃𝑦 𝐴 = {𝑦}) → ∃*𝑧 𝑧 ∈ 𝐴)
23	18, 22	impbii 212	. 2 ⊢ (∃*𝑧 𝑧 ∈ 𝐴 ↔ (𝐴 = ∅ ∨ ∃𝑦 𝐴 = {𝑦}))
24	4, 23	bitri 278	1 ⊢ (∃*𝑥 𝑥 ∈ 𝐴 ↔ (𝐴 = ∅ ∨ ∃𝑦 𝐴 = {𝑦}))

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   ∨ wo 861  ∀wal 1567   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃*wmo 2562  ∃!weu 2593  ∅c0 4277  {csn 4584

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-v 3452  df-sbc 3739  df-dif 4046  df-nul 4278  df-sn 4585

This theorem is used by:  mosssn2  50036  mofmo  50066  mofeu  50067  f1mo  50072  setc2othin  50709