Theorem elsnd 4609

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 4608	. 2 ⊢ (𝐴 ∈ {𝐵} → 𝐴 = 𝐵)
3	1, 2	syl 18	1 ⊢ (𝜑 → 𝐴 = 𝐵)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  {csn 4591

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-sn 4592

This theorem is used by:  sndisj  5103  xpdifcnvepel  6168  chnccats1  18699  chnccat  18700  ex-chn1  18711  lnincplng  29097  elrgspnsubrunlem2  33608  0mplrim  33944  selvply1rhmlemb  33949  evlextv  33972  discsubc  49875