| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: There is only one element in a singleton. Exercise 2 of [TakeutiZaring] p. 15 (generalized). |
| Ref | Expression |
|---|---|
| elsncg |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elprg 2421 |
. 2
| |
| 2 | dfsn2 2418 |
. . . 4
| |
| 3 | 2 | eqcomi 1478 |
. . 3
|
| 4 | 3 | eleq2i 1537 |
. 2
|
| 5 | oridm 243 |
. 2
| |
| 6 | 1, 4, 5 | 3bitr3g 553 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: elsnc 2429 elsni 2430 snidg 2431 eldifsn 2460 elsucg 3033 ltxrt 5482 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 961 ax-gen 962 ax-8 963 ax-10 965 ax-12 967 ax-17 970 ax-4 972 ax-5o 974 ax-6o 977 ax-9o 1122 ax-10o 1139 ax-16 1210 ax-11o 1218 ax-ext 1459 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 980 df-sb 1172 df-clab 1464 df-cleq 1469 df-clel 1472 df-v 1810 df-un 2048 df-sn 2410 df-pr 2411 |