Theorem iunssd 5073

Description: Subset theorem for an indexed union. (Contributed by Glauco Siliprandi, 8-Apr-2021.)

Hypothesis

Ref	Expression
iunssd.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ 𝐶)

Assertion

Ref	Expression
iunssd	⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)

Distinct variable groups:   𝑥,𝐶   𝜑,𝑥

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem iunssd

Step	Hyp	Ref	Expression
1		iunssd.1	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ 𝐶)
2	1	ralrimiva 3152	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
3		iunss 5068	. 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
4	2, 3	sylibr 234	1 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)

Syntax hints:   → wi 4   ∧ wa 395   ∈ wcel 2108  ∀wral 3067   ⊆ wss 3976  ∪ ciun 5015

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ral 3068  df-rex 3077  df-ss 3993  df-iun 5017

This theorem is referenced by:  imasaddfnlem  17590  imasaddflem  17592  subdrgint  20828  precsexlem10  28260  constrsscn  33732  oacl2g  43294  omcl2  43297  ofoaf  43319  onsucunifi  43334  meaiininclem  46409  smflim  46700  smfresal  46711  smfmullem4  46717