Theorem intssuni2 4932

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 4929	. 2 ⊢ (𝐴 ≠ ∅ → ∩ 𝐴 ⊆ ∪ 𝐴)
2		uniss 4874	. 2 ⊢ (𝐴 ⊆ 𝐵 → ∪ 𝐴 ⊆ ∪ 𝐵)
3	1, 2	sylan9ssr 3922	1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ⊆ ∪ 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ≠ wne 2955   ⊆ wss 3895  ∅c0 4278  ∪ cuni 4866  ∩ cint 4906

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-v 3452  df-ss 3896  df-dif 4047  df-nul 4279  df-uni 4867  df-int 4907

This theorem is used by:  rintn0  5068  fival  9407  mremre  17779  submre  17780  lssintcl  21244  iundifdifd  33203  iundifdif  33204  bj-ismoored2  38121  bj-ismooredr2  38123  ismrcd1  43802