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 3182 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶) |
3 | iunss 4961 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶) | |
4 | 2, 3 | sylibr 236 | 1 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∈ wcel 2110 ∀wral 3138 ⊆ wss 3935 ∪ ciun 4911 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-in 3942 df-ss 3951 df-iun 4913 |
This theorem is referenced by: imasaddfnlem 16795 imasaddflem 16797 subdrgint 19576 meaiininclem 42762 smflim 43047 smfresal 43057 smfmullem4 43063 |
Copyright terms: Public domain | W3C validator |