Theorem intss2 5079

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 5071	. . 3 ⊢ (𝐴 ⊆ 𝒫 𝑋 ↔ ∪ 𝐴 ⊆ 𝑋)
2	1	biimpi 219	. 2 ⊢ (𝐴 ⊆ 𝒫 𝑋 → ∪ 𝐴 ⊆ 𝑋)
3		intssuni 4940	. 2 ⊢ (𝐴 ≠ ∅ → ∩ 𝐴 ⊆ ∪ 𝐴)
4		sstr 3948	. . 3 ⊢ ((∩ 𝐴 ⊆ ∪ 𝐴 ∧ ∪ 𝐴 ⊆ 𝑋) → ∩ 𝐴 ⊆ 𝑋)
5	4	expcom 419	. 2 ⊢ (∪ 𝐴 ⊆ 𝑋 → (∩ 𝐴 ⊆ ∪ 𝐴 → ∩ 𝐴 ⊆ 𝑋))
6	2, 3, 5	syl2im 41	1 ⊢ (𝐴 ⊆ 𝒫 𝑋 → (𝐴 ≠ ∅ → ∩ 𝐴 ⊆ 𝑋))

This proof depends on syntax axioms:   → wi 4   ≠ wne 2961   ⊆ wss 3908  ∅c0 4289  𝒫 cpw 4567  ∪ cuni 4877  ∩ cint 4917

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-rex 3093  df-v 3460  df-dif 3911  df-ss 3925  df-nul 4290  df-pw 4569  df-uni 4878  df-int 4918

This theorem is used by:  intlidl  33759  bj-0int  37784