Theorem elsnd 4589

Description: There is at most one element in a singleton. (Contributed by Thierry Arnoux, 13-Oct-2025.)

Hypothesis

Ref	Expression
elsnd.1	⊢ (𝜑 → 𝐴 ∈ {𝐵})

Assertion

Ref	Expression
elsnd	⊢ (𝜑 → 𝐴 = 𝐵)

Proof of Theorem elsnd

Step	Hyp	Ref	Expression
1		elsnd.1	. 2 ⊢ (𝜑 → 𝐴 ∈ {𝐵})
2		elsni 4588	. 2 ⊢ (𝐴 ∈ {𝐵} → 𝐴 = 𝐵)
3	1, 2	syl 17	1 ⊢ (𝜑 → 𝐴 = 𝐵)

Syntax hints:   → wi 4   = wceq 1541   ∈ wcel 2111  {csn 4571

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-sn 4572

This theorem is referenced by:  chnccats1  18526  chnccat  18527  ex-chn1  18538  elrgspnsubrunlem2  33207  discsubc  49096