![]() |
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 4250 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∩ 𝐶) ⊆ (𝐵 ∩ 𝐶)) | |
2 | eqimss 4054 | . . 3 ⊢ ((𝐵 ∩ 𝐶) = ∅ → (𝐵 ∩ 𝐶) ⊆ ∅) | |
3 | 1, 2 | sylan9ss 4009 | . 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (𝐴 ∩ 𝐶) ⊆ ∅) |
4 | ss0 4408 | . 2 ⊢ ((𝐴 ∩ 𝐶) ⊆ ∅ → (𝐴 ∩ 𝐶) = ∅) | |
5 | 3, 4 | syl 17 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (𝐴 ∩ 𝐶) = ∅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∩ cin 3962 ⊆ wss 3963 ∅c0 4339 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 |
This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1540 df-fal 1550 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-v 3480 df-dif 3966 df-in 3970 df-ss 3980 df-nul 4340 |
This theorem is referenced by: djudisj 6189 fimacnvdisj 6787 marypha1lem 9471 djuin 9956 ackbij1lem16 10272 ackbij1lem18 10274 fin23lem20 10375 fin23lem30 10380 psdmul 22188 elcls3 23107 neindisj 23141 imadifxp 32621 ldgenpisyslem1 34144 chtvalz 34623 pthhashvtx 35112 diophren 42801 |
Copyright terms: Public domain | W3C validator |