| 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 4740 | . . 3 ⊢ (𝑥 ∈ (𝐵 ∖ {𝐴}) ↔ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 𝐴)) | |
| 2 | simpl 482 | . . . 4 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 𝐴) → 𝑥 ∈ 𝐵) | |
| 3 | nelelne 3029 | . . . . 5 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝑥 ∈ 𝐵 → 𝑥 ≠ 𝐴)) | |
| 4 | 3 | ancld 550 | . . . 4 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 𝐴))) |
| 5 | 2, 4 | impbid2 226 | . . 3 ⊢ (¬ 𝐴 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 𝐴) ↔ 𝑥 ∈ 𝐵)) |
| 6 | 1, 5 | bitrid 283 | . 2 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝑥 ∈ (𝐵 ∖ {𝐴}) ↔ 𝑥 ∈ 𝐵)) |
| 7 | 6 | eqrdv 2732 | 1 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝐵 ∖ {𝐴}) = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 ∖ cdif 3896 {csn 4578 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-ne 2931 df-v 3440 df-dif 3902 df-sn 4579 |
| This theorem is referenced by: difsnb 4760 difsnexi 7704 domdifsn 8986 domunsncan 9003 frfi 9183 infdifsn 9564 dfn2 12412 hashgt23el 14345 chnccat 18547 clslp 23090 xrge00 33045 lindsadd 37753 lindsenlbs 37755 poimirlem2 37762 poimirlem4 37764 poimirlem6 37766 poimirlem7 37767 poimirlem8 37768 poimirlem19 37779 poimirlem23 37783 supxrmnf2 45619 infxrpnf2 45649 dvmptfprodlem 46130 hoiprodp1 46774 |
| Copyright terms: Public domain | W3C validator |