| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > difsn | Structured version Visualization version GIF version | ||
| Description: An element not in a set can be removed without affecting the set. (Contributed by NM, 16-Mar-2006.) (Proof shortened by Andrew Salmon, 29-Jun-2011.) |
| Ref | Expression |
|---|---|
| difsn | ⊢ (¬ 𝐴 ∈ 𝐵 → (𝐵 ∖ {𝐴}) = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eldifsn 4748 | . . 3 ⊢ (𝑥 ∈ (𝐵 ∖ {𝐴}) ↔ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 𝐴)) | |
| 2 | simpl 488 | . . . 4 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 𝐴) → 𝑥 ∈ 𝐵) | |
| 3 | nelelne 3057 | . . . . 5 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝑥 ∈ 𝐵 → 𝑥 ≠ 𝐴)) | |
| 4 | 3 | ancld 560 | . . . 4 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 𝐴))) |
| 5 | 2, 4 | impbid2 229 | . . 3 ⊢ (¬ 𝐴 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 𝐴) ↔ 𝑥 ∈ 𝐵)) |
| 6 | 1, 5 | bitrid 286 | . 2 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝑥 ∈ (𝐵 ∖ {𝐴}) ↔ 𝑥 ∈ 𝐵)) |
| 7 | 6 | eqrdv 2759 | 1 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝐵 ∖ {𝐴}) = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ∖ cdif 3896 {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-ne 2957 df-v 3453 df-dif 3902 df-sn 4585 |
| This theorem is used by: difsnb 4769 difsnexi 7775 domdifsn 9079 domunsncan 9096 frfi 9276 infdifsn 9658 dfn2 12619 hashgt23el 14569 chnccat 18800 lindsenlbs 22157 clslp 23466 xrge00 33575 lindsadd 38536 poimirlem2 38540 poimirlem4 38542 poimirlem6 38544 poimirlem7 38545 poimirlem8 38546 poimirlem19 38557 poimirlem23 38561 supxrmnf2 46442 infxrpnf2 46472 dvmptfprodlem 46953 hoiprodp1 47597 |
| Copyright terms: Public domain | W3C validator |