| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elsnd | Structured version Visualization version GIF version | ||
| Description: There is at most one element in a singleton. (Contributed by Thierry Arnoux, 13-Oct-2025.) |
| Ref | Expression |
|---|---|
| elsnd.1 | ⊢ (𝜑 → 𝐴 ∈ {𝐵}) |
| Ref | Expression |
|---|---|
| elsnd | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elsnd.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ {𝐵}) | |
| 2 | elsni 4599 | . 2 ⊢ (𝐴 ∈ {𝐵} → 𝐴 = 𝐵) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 {csn 4582 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-sn 4583 |
| This theorem is referenced by: chnccats1 18560 chnccat 18561 ex-chn1 18572 elrgspnsubrunlem2 33342 evlextv 33719 discsubc 49423 |
| Copyright terms: Public domain | W3C validator |