| 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 4313 | . . . 4 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐵 ∖ 𝐴) = ∅) | |
| 2 | eqss 3924 | . . . . 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 1569 ≠ wne 2955 ⊆ wss 3896 ∖ cdif 4044 ∅c0 4277 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-v 3452 df-ss 3897 df-dif 4046 df-nul 4278 |
| This theorem is used by: pssdif 4316 tz7.7 6391 domdifsn 9086 inf3lem3 9638 isf32lem6 10443 qsidomlem2 21646 fclscf 24353 flimfnfcls 24356 lebnumlem1 25291 lebnumlem2 25292 lebnumlem3 25293 ig1peu 26502 ig1pdvds 26507 qsdrng 34071 dflringlem3 34078 dflring4 34080 divrngidl 39071 |
| Copyright terms: Public domain | W3C validator |