| 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 4572 | . 2 ⊢ (𝐴 ∈ {𝐵} → 𝐴 = 𝐵) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 ∈ wcel 2119 {csn 4555 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-tru 1550 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-sn 4556 |
| This theorem is referenced by: sndisj 5064 chnccats1 18582 chnccat 18583 ex-chn1 18594 elrgspnsubrunlem2 33329 0mplrim 33698 selvply1rhmlemb 33703 evlextv 33726 discsubc 49554 |
| Copyright terms: Public domain | W3C validator |