![]() |
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 3360 | . 2 ⊢ (𝐴 ⊆ (𝐵 ∖ 𝐶) → (𝐴 ∩ 𝐶) ⊆ ((𝐵 ∖ 𝐶) ∩ 𝐶)) | |
2 | incom 3327 | . . 3 ⊢ ((𝐵 ∖ 𝐶) ∩ 𝐶) = (𝐶 ∩ (𝐵 ∖ 𝐶)) | |
3 | disjdif 3495 | . . 3 ⊢ (𝐶 ∩ (𝐵 ∖ 𝐶)) = ∅ | |
4 | 2, 3 | eqtri 2198 | . 2 ⊢ ((𝐵 ∖ 𝐶) ∩ 𝐶) = ∅ |
5 | sseq0 3464 | . 2 ⊢ (((𝐴 ∩ 𝐶) ⊆ ((𝐵 ∖ 𝐶) ∩ 𝐶) ∧ ((𝐵 ∖ 𝐶) ∩ 𝐶) = ∅) → (𝐴 ∩ 𝐶) = ∅) | |
6 | 1, 4, 5 | sylancl 413 | 1 ⊢ (𝐴 ⊆ (𝐵 ∖ 𝐶) → (𝐴 ∩ 𝐶) = ∅) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1353 ∖ cdif 3126 ∩ cin 3128 ⊆ wss 3129 ∅c0 3422 |
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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-v 2739 df-dif 3131 df-in 3135 df-ss 3142 df-nul 3423 |
This theorem is referenced by: ssdifeq0 3505 |
Copyright terms: Public domain | W3C validator |