| 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 3133 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶) |
| 3 | iunss 4976 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶) | |
| 4 | 2, 3 | sylibr 236 | 1 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 397 ∈ wcel 2121 ∀wral 3055 ⊆ wss 3884 ∪ ciun 4923 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-11 2170 ax-ext 2713 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-tru 1551 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-ral 3056 df-rex 3066 df-v 3435 df-ss 3901 df-iun 4925 |
| This theorem is referenced by: imasaddfnlem 17487 imasaddflem 17489 subdrgint 20778 bdayiun 27927 precsexlem10 28228 gsumwrd2dccatlem 33160 constrsscn 33934 ttcmin 36737 dfttc2g 36747 oacl2g 43788 omcl2 43791 ofoaf 43813 onsucunifi 43828 meaiininclem 46941 smflim 47232 smfresal 47243 smfmullem4 47249 iunlub 49323 |
| Copyright terms: Public domain | W3C validator |