| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssdisj | Structured version Visualization version GIF version | ||
| Description: Intersection with a subclass of a disjoint class. (Contributed by FL, 24-Jan-2007.) (Proof shortened by JJ, 14-Jul-2021.) |
| Ref | Expression |
|---|---|
| ssdisj | ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (𝐴 ∩ 𝐶) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssrin 4182 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∩ 𝐶) ⊆ (𝐵 ∩ 𝐶)) | |
| 2 | eqimss 3980 | . . 3 ⊢ ((𝐵 ∩ 𝐶) = ∅ → (𝐵 ∩ 𝐶) ⊆ ∅) | |
| 3 | 1, 2 | sylan9ss 3935 | . 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (𝐴 ∩ 𝐶) ⊆ ∅) |
| 4 | ss0 4342 | . 2 ⊢ ((𝐴 ∩ 𝐶) ⊆ ∅ → (𝐴 ∩ 𝐶) = ∅) | |
| 5 | 3, 4 | syl 17 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (𝐴 ∩ 𝐶) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∩ cin 3888 ⊆ wss 3889 ∅c0 4273 |
| 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 2708 |
| 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 2715 df-cleq 2728 df-clel 2811 df-v 3431 df-dif 3892 df-in 3896 df-ss 3906 df-nul 4274 |
| This theorem is referenced by: djudisj 6131 fimacnvdisj 6718 marypha1lem 9346 djuin 9842 ackbij1lem16 10156 ackbij1lem18 10158 fin23lem20 10259 fin23lem30 10264 psdmul 22132 elcls3 23048 neindisj 23082 imadifxp 32671 ldgenpisyslem1 34307 chtvalz 34773 pthhashvtx 35310 diophren 43241 |
| Copyright terms: Public domain | W3C validator |