| 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 4141 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∩ 𝐶) ⊆ (𝐵 ∩ 𝐶)) | |
| 2 | sslin 4142 | . 2 ⊢ (𝐶 ⊆ 𝐷 → (𝐵 ∩ 𝐶) ⊆ (𝐵 ∩ 𝐷)) | |
| 3 | 1, 2 | sylan9ss 3926 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) → (𝐴 ∩ 𝐶) ⊆ (𝐵 ∩ 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ⊆ wss 3900 ∩ cin 4092 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-ss 3901 df-in 4094 |
| This theorem is used by: disjxiun 5105 f1un 6875 strleun 17379 dprdss 20296 dprd2da 20309 ablfac1b 20337 tgcl 23342 innei 23498 hausnei2 23726 bwth 23783 fbssfi 24211 fbunfip 24243 fgcl 24252 blin2 24803 vtxdun 30119 vtxdginducedm1 30181 5oai 32320 mayetes3i 32388 mdsl0 32969 neibastop1 37362 ismblfin 38847 heibor1lem 39009 pl42lem2N 41303 pl42lem3N 41304 ntrk2imkb 45298 ssin0 46346 iscnrm3llem2 50395 |
| Copyright terms: Public domain | W3C validator |