| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: An element not in a set can be removed without affecting the set. |
| Ref | Expression |
|---|---|
| difsn |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | difss 2157 |
. . 3
| |
| 2 | 1 | a1i 8 |
. 2
|
| 3 | nelneq 1553 |
. . . . . . 7
| |
| 4 | df-ne 1579 |
. . . . . . 7
| |
| 5 | 3, 4 | sylibr 200 |
. . . . . 6
|
| 6 | 5 | expcom 374 |
. . . . 5
|
| 7 | 6 | ancld 298 |
. . . 4
|
| 8 | eldifsn 2453 |
. . . 4
| |
| 9 | 7, 8 | syl6ibr 213 |
. . 3
|
| 10 | 9 | ssrdv 2060 |
. 2
|
| 11 | 2, 10 | eqssd 2069 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: sspr 2466 clslp 7689 |
| 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-ne 1579 df-v 1803 df-dif 2039 df-un 2040 df-in 2041 df-ss 2043 df-sn 2402 df-pr 2403 |