| 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 4321 | . . . 4 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐵 ∖ 𝐴) = ∅) | |
| 2 | eqss 3953 | . . . . 5 ⊢ (𝐴 = 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴)) | |
| 3 | 2 | simplbi2 506 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → (𝐵 ⊆ 𝐴 → 𝐴 = 𝐵)) |
| 4 | 1, 3 | biimtrrid 246 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → ((𝐵 ∖ 𝐴) = ∅ → 𝐴 = 𝐵)) |
| 5 | 4 | necon3d 2981 | . 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 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: pssdif 4324 tz7.7 6390 domdifsn 9055 inf3lem3 9606 isf32lem6 10357 qsidomlem2 21531 fclscf 24233 flimfnfcls 24236 lebnumlem1 25171 lebnumlem2 25172 lebnumlem3 25173 ig1peu 26383 ig1pdvds 26388 qsdrng 33843 dflringlem3 33850 dflring4 33852 divrngidl 38737 |
| Copyright terms: Public domain | W3C validator |