| 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 4758 | . . 3 ⊢ (𝑥 ∈ (𝐵 ∖ {𝐴}) ↔ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 𝐴)) | |
| 2 | simpl 487 | . . . 4 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 𝐴) → 𝑥 ∈ 𝐵) | |
| 3 | nelelne 3065 | . . . . 5 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝑥 ∈ 𝐵 → 𝑥 ≠ 𝐴)) | |
| 4 | 3 | ancld 559 | . . . 4 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 𝐴))) |
| 5 | 2, 4 | impbid2 229 | . . 3 ⊢ (¬ 𝐴 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 𝐴) ↔ 𝑥 ∈ 𝐵)) |
| 6 | 1, 5 | bitrid 286 | . 2 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝑥 ∈ (𝐵 ∖ {𝐴}) ↔ 𝑥 ∈ 𝐵)) |
| 7 | 6 | eqrdv 2767 | 1 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝐵 ∖ {𝐴}) = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∖ cdif 3910 {csn 4594 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1570 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 df-v 3465 df-dif 3916 df-sn 4595 |
| This theorem is referenced by: difsnb 4778 difsnexi 7760 domdifsn 9048 domunsncan 9065 frfi 9245 infdifsn 9626 dfn2 12517 hashgt23el 14461 chnccat 18682 clslp 23274 xrge00 33275 lindsadd 38186 lindsenlbs 38188 poimirlem2 38195 poimirlem4 38197 poimirlem6 38199 poimirlem7 38200 poimirlem8 38201 poimirlem19 38212 poimirlem23 38216 supxrmnf2 46073 infxrpnf2 46103 dvmptfprodlem 46584 hoiprodp1 47228 |
| Copyright terms: Public domain | W3C validator |