| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: If the singletons of two sets are equal, the two sets are equal. Part of Exercise 4 of [TakeutiZaring] p. 15. |
| Ref | Expression |
|---|---|
| sneqr.1 |
|
| Ref | Expression |
|---|---|
| sneqr |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sneqr.1 |
. . . 4
| |
| 2 | 1 | snid 2425 |
. . 3
|
| 3 | eleq2 1527 |
. . 3
| |
| 4 | 2, 3 | mpbii 193 |
. 2
|
| 5 | 1 | elsnc 2421 |
. 2
|
| 6 | 4, 5 | sylib 198 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: snsssn 2469 opth2 2789 opthwiener 2796 canth2 4464 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 959 ax-gen 960 ax-8 961 ax-10 963 ax-12 965 ax-17 968 ax-4 970 ax-5o 972 ax-6o 975 ax-9o 1119 ax-10o 1136 ax-16 1206 ax-11o 1213 ax-ext 1452 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 978 df-sb 1168 df-clab 1457 df-cleq 1462 df-clel 1465 df-v 1803 df-un 2040 df-sn 2402 df-pr 2403 |