Theorem mosssn 50257

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 4787	. 2 ⊢ (𝐴 ⊆ {𝐵} ↔ (𝐴 = ∅ ∨ 𝐴 = {𝐵}))
2		mo0 50256	. . 3 ⊢ (𝐴 = ∅ → ∃*𝑥 𝑥 ∈ 𝐴)
3		mosn 50255	. . 3 ⊢ (𝐴 = {𝐵} → ∃*𝑥 𝑥 ∈ 𝐴)
4	2, 3	jaoi 871	. 2 ⊢ ((𝐴 = ∅ ∨ 𝐴 = {𝐵}) → ∃*𝑥 𝑥 ∈ 𝐴)
5	1, 4	sylbi 220	1 ⊢ (𝐴 ⊆ {𝐵} → ∃*𝑥 𝑥 ∈ 𝐴)

This proof depends on syntax axioms:   → wi 4   ∨ wo 861   = wceq 1570   ∈ wcel 2147  ∃*wmo 2565   ⊆ wss 3900  ∅c0 4281  {csn 4588

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-nul 4282  df-sn 4589

This theorem is used by: (None)