| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > intssuni2 | Structured version Visualization version GIF version | ||
| Description: Subclass relationship for intersection and union. (Contributed by NM, 29-Jul-2006.) |
| Ref | Expression |
|---|---|
| intssuni2 | ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ⊆ ∪ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | intssuni 4927 | . 2 ⊢ (𝐴 ≠ ∅ → ∩ 𝐴 ⊆ ∪ 𝐴) | |
| 2 | uniss 4872 | . 2 ⊢ (𝐴 ⊆ 𝐵 → ∪ 𝐴 ⊆ ∪ 𝐵) | |
| 3 | 1, 2 | sylan9ssr 3950 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ⊆ ∪ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ≠ wne 2956 ⊆ wss 3904 ∅c0 4285 ∪ cuni 4864 ∩ cint 4904 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3076 df-rex 3086 df-v 3455 df-dif 3907 df-ss 3921 df-nul 4286 df-uni 4865 df-int 4905 |
| This theorem is referenced by: rintn0 5065 fival 9355 mremre 17615 submre 17616 lssintcl 21011 iundifdifd 32710 iundifdif 32711 bj-ismoored2 37562 bj-ismooredr2 37564 ismrcd1 43243 |
| Copyright terms: Public domain | W3C validator |