| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pssdifn0 | Structured version Visualization version GIF version | ||
| Description: A proper subclass has a nonempty difference. (Contributed by NM, 3-May-1994.) |
| Ref | Expression |
|---|---|
| pssdifn0 | ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ 𝐵) → (𝐵 ∖ 𝐴) ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssdif0 4314 | . . . 4 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐵 ∖ 𝐴) = ∅) | |
| 2 | eqss 3946 | . . . . 5 ⊢ (𝐴 = 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴)) | |
| 3 | 2 | simplbi2 506 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → (𝐵 ⊆ 𝐴 → 𝐴 = 𝐵)) |
| 4 | 1, 3 | biimtrrid 246 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → ((𝐵 ∖ 𝐴) = ∅ → 𝐴 = 𝐵)) |
| 5 | 4 | necon3d 2977 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ≠ 𝐵 → (𝐵 ∖ 𝐴) ≠ ∅)) |
| 6 | 5 | imp 412 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ 𝐵) → (𝐵 ∖ 𝐴) ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ≠ wne 2956 ∖ cdif 3896 ⊆ wss 3899 ∅c0 4279 |
| 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-fal 1583 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-ss 3916 df-nul 4280 |
| This theorem is used by: pssdif 4317 tz7.7 6387 domdifsn 9072 inf3lem3 9624 isf32lem6 10429 qsidomlem2 21630 fclscf 24337 flimfnfcls 24340 lebnumlem1 25275 lebnumlem2 25276 lebnumlem3 25277 ig1peu 26486 ig1pdvds 26491 qsdrng 34014 dflringlem3 34021 dflring4 34023 divrngidl 38942 |
| Copyright terms: Public domain | W3C validator |