| 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 4640 | . 2 ⊢ (𝐴 ∈ V → 𝐴 ∈ {𝐴}) | |
| 2 | elex 3484 | . 2 ⊢ (𝐴 ∈ {𝐴} → 𝐴 ∈ V) | |
| 3 | 1, 2 | impbii 209 | 1 ⊢ (𝐴 ∈ V ↔ 𝐴 ∈ {𝐴}) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∈ wcel 2107 Vcvv 3463 {csn 4606 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1542 df-ex 1779 df-sb 2064 df-clab 2713 df-cleq 2726 df-clel 2808 df-v 3465 df-sn 4607 |
| This theorem is referenced by: snid 4642 dffv2 6984 snen1el 43500 |
| Copyright terms: Public domain | W3C validator |