| 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 1570 ∈ wcel 2147 Vcvv 3454 {csn 4588 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-sn 4589 |
| This theorem is used by: fparlem1 8153 fparlem2 8154 el1o 8534 fin1a2lem11 10518 fin1a2lem12 10519 elnn0 12638 elxnn0 12711 elfzp1 13738 fsumss 15923 fprodss 16147 elhoma 18239 rnglidl0 21542 prmidl0 21667 islpidl 21682 zrhrhmb 21849 rest0 23520 qustgphaus 24475 taylfval 26719 eqcuts3 28223 elch0 31889 atoml2i 33018 bj-eltag 38081 bj-rest10b 38214 dibopelvalN 42403 dibopelval2 42405 aks4d1p1p4 43324 climrec 46830 tmachlem-agreesn 48172 parhomel 50959 parhomcl2 50960 |
| Copyright terms: Public domain | W3C validator |