| 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 4946 | . 2 ⊢ (𝐴 ≠ ∅ → ∩ 𝐴 ⊆ ∪ 𝐴) | |
| 2 | uniss 4891 | . 2 ⊢ (𝐴 ⊆ 𝐵 → ∪ 𝐴 ⊆ ∪ 𝐵) | |
| 3 | 1, 2 | sylan9ssr 3973 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ⊆ ∪ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ≠ wne 2932 ⊆ wss 3926 ∅c0 4308 ∪ cuni 4883 ∩ cint 4922 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2707 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2714 df-cleq 2727 df-clel 2809 df-ne 2933 df-ral 3052 df-rex 3061 df-v 3461 df-dif 3929 df-ss 3943 df-nul 4309 df-uni 4884 df-int 4923 |
| This theorem is referenced by: rintn0 5085 fival 9424 mremre 17616 submre 17617 lssintcl 20921 iundifdifd 32542 iundifdif 32543 bj-ismoored2 37126 bj-ismooredr2 37128 ismrcd1 42721 |
| Copyright terms: Public domain | W3C validator |