| 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 4913 | . 2 ⊢ (𝐴 ≠ ∅ → ∩ 𝐴 ⊆ ∪ 𝐴) | |
| 2 | uniss 4859 | . 2 ⊢ (𝐴 ⊆ 𝐵 → ∪ 𝐴 ⊆ ∪ 𝐵) | |
| 3 | 1, 2 | sylan9ssr 3937 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ⊆ ∪ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ≠ wne 2933 ⊆ wss 3890 ∅c0 4274 ∪ cuni 4851 ∩ cint 4890 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-v 3432 df-dif 3893 df-ss 3907 df-nul 4275 df-uni 4852 df-int 4891 |
| This theorem is referenced by: rintn0 5052 fival 9318 mremre 17557 submre 17558 lssintcl 20950 iundifdifd 32646 iundifdif 32647 bj-ismoored2 37436 bj-ismooredr2 37438 ismrcd1 43144 |
| Copyright terms: Public domain | W3C validator |