| 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 4138 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∩ 𝐶) ⊆ (𝐵 ∩ 𝐶)) | |
| 2 | eqimss 3966 | . . 3 ⊢ ((𝐵 ∩ 𝐶) = ∅ → (𝐵 ∩ 𝐶) ⊆ ∅) | |
| 3 | 1, 2 | sylan9ss 3921 | . 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (𝐴 ∩ 𝐶) ⊆ ∅) |
| 4 | ss0 4351 | . 2 ⊢ ((𝐴 ∩ 𝐶) ⊆ ∅ → (𝐴 ∩ 𝐶) = ∅) | |
| 5 | 3, 4 | syl 18 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (𝐴 ∩ 𝐶) = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ⊆ wss 3895 ∩ cin 4089 ∅c0 4278 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-nul 4279 |
| This theorem is used by: djudisj 6157 fimacnvdisj 6761 marypha1lem 9429 djuin 10003 ackbij1lem16 10316 ackbij1lem18 10318 fin23lem20 10419 fin23lem30 10424 psdmul 22493 elcls3 23407 neindisj 23441 pthhashvtx 30321 imadifxp 33243 ldgenpisyslem1 34843 chtvalz 35305 diophren 43914 |
| Copyright terms: Public domain | W3C validator |