Theorem intssuni2 4937

Description: Subclass relationship for intersection and union. (Contributed by NM, 29-Jul-2006.)

Assertion

Ref	Expression
intssuni2	⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ⊆ ∪ 𝐵)

Proof of Theorem intssuni2

Step	Hyp	Ref	Expression
1		intssuni 4934	. 2 ⊢ (𝐴 ≠ ∅ → ∩ 𝐴 ⊆ ∪ 𝐴)
2		uniss 4879	. 2 ⊢ (𝐴 ⊆ 𝐵 → ∪ 𝐴 ⊆ ∪ 𝐵)
3	1, 2	sylan9ssr 3961	1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ⊆ ∪ 𝐵)

Syntax hints:   → wi 4   ∧ wa 395   ≠ wne 2925   ⊆ wss 3914  ∅c0 4296  ∪ cuni 4871  ∩ cint 4910

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 2008  ax-8 2111  ax-9 2119  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ne 2926  df-ral 3045  df-rex 3054  df-v 3449  df-dif 3917  df-ss 3931  df-nul 4297  df-uni 4872  df-int 4911

This theorem is referenced by:  rintn0  5073  fival  9363  mremre  17565  submre  17566  lssintcl  20870  iundifdifd  32490  iundifdif  32491  bj-ismoored2  37096  bj-ismooredr2  37098  ismrcd1  42686