| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > snidb | Structured version Visualization version GIF version | ||
| Description: A class is a set iff it is a member of its singleton. (Contributed by NM, 5-Apr-2004.) |
| Ref | Expression |
|---|---|
| snidb | ⊢ (𝐴 ∈ V ↔ 𝐴 ∈ {𝐴}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | snidg 4621 | . 2 ⊢ (𝐴 ∈ V → 𝐴 ∈ {𝐴}) | |
| 2 | elex 3477 | . 2 ⊢ (𝐴 ∈ {𝐴} → 𝐴 ∈ V) | |
| 3 | 1, 2 | impbii 211 | 1 ⊢ (𝐴 ∈ V ↔ 𝐴 ∈ {𝐴}) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∈ wcel 2144 Vcvv 3456 {csn 4584 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1565 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-v 3458 df-sn 4585 |
| This theorem is referenced by: snid 4623 dffv2 6964 snen1el 44106 |
| Copyright terms: Public domain | W3C validator |