Theorem ssuniint 46016

Description: Sufficient condition for being a subclass of the union of an intersection. (Contributed by Glauco Siliprandi, 3-Jan-2021.)

Hypotheses

Ref	Expression
ssuniint.x	⊢ Ⅎ𝑥𝜑
ssuniint.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
ssuniint.b	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐴 ∈ 𝑥)

Assertion

Ref	Expression
ssuniint	⊢ (𝜑 → 𝐴 ⊆ ∪ ∩ 𝐵)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hints:   𝜑(𝑥)   𝑉(𝑥)

Proof of Theorem ssuniint

Step	Hyp	Ref	Expression
1		ssuniint.x	. . 3 ⊢ Ⅎ𝑥𝜑
2		ssuniint.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
3		ssuniint.b	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐴 ∈ 𝑥)
4	1, 2, 3	elintd 46012	. 2 ⊢ (𝜑 → 𝐴 ∈ ∩ 𝐵)
5		elssuni 4898	. 2 ⊢ (𝐴 ∈ ∩ 𝐵 → 𝐴 ⊆ ∪ ∩ 𝐵)
6	4, 5	syl 18	1 ⊢ (𝜑 → 𝐴 ⊆ ∪ ∩ 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  Ⅎwnf 1816   ∈ wcel 2145   ⊆ wss 3898  ∪ cuni 4866  ∩ cint 4906

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 2147  ax-9 2155  ax-12 2213  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-v 3452  df-ss 3915  df-uni 4867  df-int 4907

This theorem is used by: (None)