| 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 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-in 3906 df-ss 3916 |
| This theorem is used by: disjxiun 5100 f1un 6838 strleun 17249 dprdss 20158 dprd2da 20171 ablfac1b 20199 tgcl 23194 innei 23350 hausnei2 23578 bwth 23635 fbssfi 24063 fbunfip 24095 fgcl 24104 blin2 24655 vtxdun 29941 vtxdginducedm1 30003 5oai 32142 mayetes3i 32210 mdsl0 32791 neibastop1 36978 ismblfin 38410 heibor1lem 38559 pl42lem2N 40853 pl42lem3N 40854 ntrk2imkb 44877 ssin0 45889 iscnrm3llem2 49876 |
| Copyright terms: Public domain | W3C validator |