| 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 4195 | . 2 ⊢ (𝐴 ⊆ (𝐵 ∖ 𝐶) → (𝐴 ∩ 𝐶) ⊆ ((𝐵 ∖ 𝐶) ∩ 𝐶)) | |
| 2 | disjdifr 4426 | . 2 ⊢ ((𝐵 ∖ 𝐶) ∩ 𝐶) = ∅ | |
| 3 | sseq0 4356 | . 2 ⊢ (((𝐴 ∩ 𝐶) ⊆ ((𝐵 ∖ 𝐶) ∩ 𝐶) ∧ ((𝐵 ∖ 𝐶) ∩ 𝐶) = ∅) → (𝐴 ∩ 𝐶) = ∅) | |
| 4 | 1, 2, 3 | sylancl 587 | 1 ⊢ (𝐴 ⊆ (𝐵 ∖ 𝐶) → (𝐴 ∩ 𝐶) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∖ cdif 3899 ∩ cin 3901 ⊆ wss 3902 ∅c0 4286 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3401 df-v 3443 df-dif 3905 df-in 3909 df-ss 3919 df-nul 4287 |
| This theorem is referenced by: ssdifeq0 4440 marypha1lem 9340 numacn 9963 mreexexlem2d 17572 mreexexlem4d 17574 nrmsep2 23304 isnrm3 23307 |
| Copyright terms: Public domain | W3C validator |