| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssdifin0 | Structured version Visualization version GIF version | ||
| Description: A subset of a difference does not intersect the subtrahend. (Contributed by Jeff Hankins, 1-Sep-2013.) (Proof shortened by Mario Carneiro, 24-Aug-2015.) |
| Ref | Expression |
|---|---|
| ssdifin0 | ⊢ (𝐴 ⊆ (𝐵 ∖ 𝐶) → (𝐴 ∩ 𝐶) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssrin 4187 | . 2 ⊢ (𝐴 ⊆ (𝐵 ∖ 𝐶) → (𝐴 ∩ 𝐶) ⊆ ((𝐵 ∖ 𝐶) ∩ 𝐶)) | |
| 2 | disjdifr 4427 | . 2 ⊢ ((𝐵 ∖ 𝐶) ∩ 𝐶) = ∅ | |
| 3 | sseq0 4354 | . 2 ⊢ (((𝐴 ∩ 𝐶) ⊆ ((𝐵 ∖ 𝐶) ∩ 𝐶) ∧ ((𝐵 ∖ 𝐶) ∩ 𝐶) = ∅) → (𝐴 ∩ 𝐶) = ∅) | |
| 4 | 1, 2, 3 | sylancl 598 | 1 ⊢ (𝐴 ⊆ (𝐵 ∖ 𝐶) → (𝐴 ∩ 𝐶) = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∖ cdif 3896 ∩ cin 3898 ⊆ 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-rab 3413 df-v 3452 df-dif 3902 df-in 3906 df-ss 3916 df-nul 4280 |
| This theorem is used by: ssdifeq0 4442 marypha1lem 9407 numacn 10074 mreexexlem2d 17755 mreexexlem4d 17757 nrmsep2 23610 isnrm3 23613 |
| Copyright terms: Public domain | W3C validator |