| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elsn2 | Structured version Visualization version GIF version | ||
| Description: There is exactly one element in a singleton. Exercise 2 of [TakeutiZaring] p. 15. This variation requires only that 𝐵, rather than 𝐴, be a set. (Contributed by NM, 12-Jun-1994.) |
| Ref | Expression |
|---|---|
| elsn2.1 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| elsn2 | ⊢ (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elsn2.1 | . 2 ⊢ 𝐵 ∈ V | |
| 2 | elsn2g 4625 | . 2 ⊢ (𝐵 ∈ V → (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1572 ∈ wcel 2150 Vcvv 3453 {csn 4587 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1575 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-sn 4588 |
| This theorem is used by: fparlem1 8159 fparlem2 8160 el1o 8540 fin1a2lem11 10526 fin1a2lem12 10527 elnn0 12647 elxnn0 12720 elfzp1 13747 fsumss 15934 fprodss 16158 elhoma 18259 rnglidl0 21562 prmidl0 21687 islpidl 21702 zrhrhmb 21873 rest0 23544 qustgphaus 24499 taylfval 26745 eqcuts3 28249 elch0 31915 atoml2i 33044 bj-eltag 38107 bj-rest10b 38282 dibopelvalN 42468 dibopelval2 42470 aks4d1p1p4 43389 climrec 46948 tmachlem-agreesn 48290 parhomel 51165 parhomcl2 51166 |
| Copyright terms: Public domain | W3C validator |