Theorem intss2 5067

Description: A nonempty intersection of a family of subsets of a class is included in that class. (Contributed by BJ, 7-Dec-2021.)

Assertion

Ref	Expression
intss2	⊢ (𝐴 ⊆ 𝒫 𝑋 → (𝐴 ≠ ∅ → ∩ 𝐴 ⊆ 𝑋))

Proof of Theorem intss2

Step	Hyp	Ref	Expression
1		sspwuni 5059	. . 3 ⊢ (𝐴 ⊆ 𝒫 𝑋 ↔ ∪ 𝐴 ⊆ 𝑋)
2	1	biimpi 219	. 2 ⊢ (𝐴 ⊆ 𝒫 𝑋 → ∪ 𝐴 ⊆ 𝑋)
3		intssuni 4929	. 2 ⊢ (𝐴 ≠ ∅ → ∩ 𝐴 ⊆ ∪ 𝐴)
4		sstr 3916	. . 3 ⊢ ((∩ 𝐴 ⊆ ∪ 𝐴 ∧ ∪ 𝐴 ⊆ 𝑋) → ∩ 𝐴 ⊆ 𝑋)
5	4	expcom 419	. 2 ⊢ (∪ 𝐴 ⊆ 𝑋 → (∩ 𝐴 ⊆ ∪ 𝐴 → ∩ 𝐴 ⊆ 𝑋))
6	2, 3, 5	syl2im 41	1 ⊢ (𝐴 ⊆ 𝒫 𝑋 → (𝐴 ≠ ∅ → ∩ 𝐴 ⊆ 𝑋))

This proof depends on syntax axioms:   → wi 4   ≠ wne 2955   ⊆ wss 3895  ∅c0 4278  𝒫 cpw 4556  ∪ 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-pw 4558  df-uni 4867  df-int 4907

This theorem is used by:  intlidl  34016  bj-0int  38114