| 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 4194 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∩ 𝐶) ⊆ (𝐵 ∩ 𝐶)) | |
| 2 | sslin 4195 | . 2 ⊢ (𝐶 ⊆ 𝐷 → (𝐵 ∩ 𝐶) ⊆ (𝐵 ∩ 𝐷)) | |
| 3 | 1, 2 | sylan9ss 3951 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) → (𝐴 ∩ 𝐶) ⊆ (𝐵 ∩ 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∩ cin 3905 ⊆ wss 3906 |
| 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 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-rab 3419 df-v 3459 df-in 3913 df-ss 3923 |
| This theorem is used by: disjxiun 5108 f1un 6845 strleun 17234 dprdss 20124 dprd2da 20137 ablfac1b 20165 tgcl 23155 innei 23311 hausnei2 23539 bwth 23596 fbssfi 24023 fbunfip 24055 fgcl 24064 blin2 24615 vtxdun 29860 vtxdginducedm1 29922 5oai 32042 mayetes3i 32110 mdsl0 32691 neibastop1 36903 ismblfin 38345 heibor1lem 38493 pl42lem2N 40787 pl42lem3N 40788 ntrk2imkb 44796 ssin0 45808 iscnrm3llem2 49761 |
| Copyright terms: Public domain | W3C validator |