| 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 4317 | . . . 4 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐵 ∖ 𝐴) = ∅) | |
| 2 | eqss 3928 | . . . . 5 ⊢ (𝐴 = 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴)) | |
| 3 | 2 | simplbi2 506 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → (𝐵 ⊆ 𝐴 → 𝐴 = 𝐵)) |
| 4 | 1, 3 | biimtrrid 246 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → ((𝐵 ∖ 𝐴) = ∅ → 𝐴 = 𝐵)) |
| 5 | 4 | necon3d 2980 | . 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 2959 ⊆ wss 3900 ∖ cdif 4048 ∅c0 4281 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-v 3456 df-ss 3901 df-dif 4050 df-nul 4282 |
| This theorem is used by: pssdif 4320 tz7.7 6414 domdifsn 9117 inf3lem3 9668 isf32lem6 10475 qsidomlem2 21688 fclscf 24399 flimfnfcls 24402 lebnumlem1 25337 lebnumlem2 25338 lebnumlem3 25339 ig1peu 26548 ig1pdvds 26553 edompidlem 33960 qsdrng 34125 dflringlem3 34132 dflring4 34134 divrngidl 39228 |
| Copyright terms: Public domain | W3C validator |