| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iunssd | Structured version Visualization version GIF version | ||
| Description: Subset theorem for an indexed union. (Contributed by Glauco Siliprandi, 8-Apr-2021.) |
| Ref | Expression |
|---|---|
| iunssd.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ 𝐶) |
| Ref | Expression |
|---|---|
| iunssd | ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iunssd.1 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ 𝐶) | |
| 2 | 1 | ralrimiva 3130 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶) |
| 3 | iunss 5002 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶) | |
| 4 | 2, 3 | sylibr 234 | 1 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2114 ∀wral 3052 ⊆ wss 3903 ∪ ciun 4948 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-11 2163 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-v 3444 df-ss 3920 df-iun 4950 |
| This theorem is referenced by: imasaddfnlem 17463 imasaddflem 17465 subdrgint 20753 bdayiun 27928 precsexlem10 28229 gsumwrd2dccatlem 33177 constrsscn 33924 oacl2g 43716 omcl2 43719 ofoaf 43741 onsucunifi 43756 meaiininclem 46873 smflim 47164 smfresal 47175 smfmullem4 47181 iunlub 49209 |
| Copyright terms: Public domain | W3C validator |