Theorem mosssn 50034

Description: "At most one" element in a subclass of a singleton. (Contributed by Zhi Wang, 23-Sep-2024.)

Assertion

Ref	Expression
mosssn	⊢ (𝐴 ⊆ {𝐵} → ∃*𝑥 𝑥 ∈ 𝐴)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem mosssn

Step	Hyp	Ref	Expression
1		sssn 4781	. 2 ⊢ (𝐴 ⊆ {𝐵} ↔ (𝐴 = ∅ ∨ 𝐴 = {𝐵}))
2		mo0 50033	. . 3 ⊢ (𝐴 = ∅ → ∃*𝑥 𝑥 ∈ 𝐴)
3		mosn 50032	. . 3 ⊢ (𝐴 = {𝐵} → ∃*𝑥 𝑥 ∈ 𝐴)
4	2, 3	jaoi 871	. 2 ⊢ ((𝐴 = ∅ ∨ 𝐴 = {𝐵}) → ∃*𝑥 𝑥 ∈ 𝐴)
5	1, 4	sylbi 220	1 ⊢ (𝐴 ⊆ {𝐵} → ∃*𝑥 𝑥 ∈ 𝐴)

This proof depends on syntax axioms:   → wi 4   ∨ wo 861   = wceq 1569   ∈ wcel 2144  ∃*wmo 2562   ⊆ wss 3896  ∅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-ss 3897  df-dif 4046  df-nul 4278  df-sn 4585

This theorem is used by: (None)