| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ss2in | Structured version Visualization version GIF version | ||
| Description: Intersection of subclasses. (Contributed by NM, 5-May-2000.) |
| Ref | Expression |
|---|---|
| ss2in | ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) → (𝐴 ∩ 𝐶) ⊆ (𝐵 ∩ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssrin 4187 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∩ 𝐶) ⊆ (𝐵 ∩ 𝐶)) | |
| 2 | sslin 4188 | . 2 ⊢ (𝐶 ⊆ 𝐷 → (𝐵 ∩ 𝐶) ⊆ (𝐵 ∩ 𝐷)) | |
| 3 | 1, 2 | sylan9ss 3944 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) → (𝐴 ∩ 𝐶) ⊆ (𝐵 ∩ 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∩ cin 3898 ⊆ wss 3899 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-rab 3414 df-v 3453 df-in 3906 df-ss 3916 |
| This theorem is used by: disjxiun 5100 f1un 6843 strleun 17328 dprdss 20238 dprd2da 20251 ablfac1b 20279 tgcl 23280 innei 23436 hausnei2 23664 bwth 23721 fbssfi 24149 fbunfip 24181 fgcl 24190 blin2 24741 vtxdun 30055 vtxdginducedm1 30117 5oai 32256 mayetes3i 32324 mdsl0 32905 neibastop1 37127 ismblfin 38559 heibor1lem 38723 pl42lem2N 41017 pl42lem3N 41018 ntrk2imkb 45022 ssin0 46041 iscnrm3llem2 50027 |
| Copyright terms: Public domain | W3C validator |