| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > difn0 | Structured version Visualization version GIF version | ||
| Description: If the difference of two sets is not empty, then the sets are not equal. (Contributed by Thierry Arnoux, 28-Feb-2017.) |
| Ref | Expression |
|---|---|
| difn0 | ⊢ ((𝐴 ∖ 𝐵) ≠ ∅ → 𝐴 ≠ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqimss 3996 | . . 3 ⊢ (𝐴 = 𝐵 → 𝐴 ⊆ 𝐵) | |
| 2 | ssdif0 4321 | . . 3 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∖ 𝐵) = ∅) | |
| 3 | 1, 2 | sylib 221 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ∖ 𝐵) = ∅) |
| 4 | 3 | necon3i 2992 | 1 ⊢ ((𝐴 ∖ 𝐵) ≠ ∅ → 𝐴 ≠ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ≠ wne 2960 ∖ cdif 3903 ⊆ wss 3906 ∅c0 4286 |
| 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 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-v 3459 df-dif 3909 df-ss 3923 df-nul 4287 |
| This theorem is used by: disjdsct 33119 bj-2upln1upl 37717 |
| Copyright terms: Public domain | W3C validator |