| 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 3472 | . 2 ⊢ (𝐴 ∈ {𝐴} → 𝐴 ∈ V) | |
| 3 | 1, 2 | impbii 212 | 1 ⊢ (𝐴 ∈ V ↔ 𝐴 ∈ {𝐴}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∈ wcel 2145 Vcvv 3451 {csn 4584 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-v 3453 df-sn 4585 |
| This theorem is used by: snid 4623 dffv2 6980 snen1el 44525 |
| Copyright terms: Public domain | W3C validator |