| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ssdifin0 | 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 3406 | . 2 ⊢ (𝐴 ⊆ (𝐵 ∖ 𝐶) → (𝐴 ∩ 𝐶) ⊆ ((𝐵 ∖ 𝐶) ∩ 𝐶)) | |
| 2 | incom 3373 | . . 3 ⊢ ((𝐵 ∖ 𝐶) ∩ 𝐶) = (𝐶 ∩ (𝐵 ∖ 𝐶)) | |
| 3 | disjdif 3541 | . . 3 ⊢ (𝐶 ∩ (𝐵 ∖ 𝐶)) = ∅ | |
| 4 | 2, 3 | eqtri 2228 | . 2 ⊢ ((𝐵 ∖ 𝐶) ∩ 𝐶) = ∅ |
| 5 | sseq0 3510 | . 2 ⊢ (((𝐴 ∩ 𝐶) ⊆ ((𝐵 ∖ 𝐶) ∩ 𝐶) ∧ ((𝐵 ∖ 𝐶) ∩ 𝐶) = ∅) → (𝐴 ∩ 𝐶) = ∅) | |
| 6 | 1, 4, 5 | sylancl 413 | 1 ⊢ (𝐴 ⊆ (𝐵 ∖ 𝐶) → (𝐴 ∩ 𝐶) = ∅) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1373 ∖ cdif 3171 ∩ cin 3173 ⊆ wss 3174 ∅c0 3468 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2189 |
| This theorem depends on definitions: df-bi 117 df-tru 1376 df-nf 1485 df-sb 1787 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-v 2778 df-dif 3176 df-in 3180 df-ss 3187 df-nul 3469 |
| This theorem is referenced by: ssdifeq0 3551 |
| Copyright terms: Public domain | W3C validator |