| 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 2976 | . 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 2955 ∖ 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 2732 |
| 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 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-v 3452 df-dif 3902 df-ss 3916 df-nul 4280 |
| This theorem is used by: pssdif 4317 tz7.7 6383 domdifsn 9058 inf3lem3 9609 isf32lem6 10360 qsidomlem2 21544 fclscf 24251 flimfnfcls 24254 lebnumlem1 25189 lebnumlem2 25190 lebnumlem3 25191 ig1peu 26400 ig1pdvds 26405 qsdrng 33899 dflringlem3 33906 dflring4 33908 divrngidl 38778 |
| Copyright terms: Public domain | W3C validator |