| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elsn2g | 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, 28-Oct-2003.) |
| Ref | Expression |
|---|---|
| elsn2g | ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elsni 4597 | . 2 ⊢ (𝐴 ∈ {𝐵} → 𝐴 = 𝐵) | |
| 2 | snidg 4617 | . . 3 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ {𝐵}) | |
| 3 | eleq1 2824 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ {𝐵} ↔ 𝐵 ∈ {𝐵})) | |
| 4 | 2, 3 | syl5ibrcom 247 | . 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴 = 𝐵 → 𝐴 ∈ {𝐵})) |
| 5 | 1, 4 | impbid2 226 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1541 ∈ wcel 2113 {csn 4580 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-sn 4581 |
| This theorem is referenced by: elsn2 4622 mptiniseg 6197 elsuc2g 6388 extmptsuppeq 8130 fzosplitsni 13695 1nsgtrivd 19103 limcco 25850 ply1termlem 26164 mptprop 32777 bj-elsn12g 37261 elpmapat 40024 stirlinglem8 46325 dirkercncflem2 46348 clnbgrel 48074 |
| Copyright terms: Public domain | W3C validator |