| 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 1822 |
. 2
| |
| 2 | dfsn2 1819 |
. . . 4
| |
| 3 | 2 | cleqcomi 1105 |
. . 3
|
| 4 | 3 | eleq2i 1153 |
. 2
|
| 5 | oridm 208 |
. 2
| |
| 6 | 1, 4, 5 | 3bitr3g 427 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: elsnc 1826 elsni 1827 snidg 1828 elsucg 2290 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-16 922 ax-17 925 ax-ext 1074 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-v 1349 df-un 1490 df-sn 1811 df-pr 1812 |