Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ssuni | Structured version Visualization version GIF version |
Description: Subclass relationship for class union. (Contributed by NM, 24-May-1994.) (Proof shortened by Andrew Salmon, 29-Jun-2011.) (Proof shortened by JJ, 26-Jul-2021.) |
Ref | Expression |
---|---|
ssuni | ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ⊆ ∪ 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elunii 4845 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝑥 ∈ ∪ 𝐶) | |
2 | 1 | expcom 416 | . . . . 5 ⊢ (𝐵 ∈ 𝐶 → (𝑥 ∈ 𝐵 → 𝑥 ∈ ∪ 𝐶)) |
3 | 2 | imim2d 57 | . . . 4 ⊢ (𝐵 ∈ 𝐶 → ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵) → (𝑥 ∈ 𝐴 → 𝑥 ∈ ∪ 𝐶))) |
4 | 3 | alimdv 1917 | . . 3 ⊢ (𝐵 ∈ 𝐶 → (∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵) → ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ ∪ 𝐶))) |
5 | dfss2 3957 | . . 3 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)) | |
6 | dfss2 3957 | . . 3 ⊢ (𝐴 ⊆ ∪ 𝐶 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ ∪ 𝐶)) | |
7 | 4, 5, 6 | 3imtr4g 298 | . 2 ⊢ (𝐵 ∈ 𝐶 → (𝐴 ⊆ 𝐵 → 𝐴 ⊆ ∪ 𝐶)) |
8 | 7 | impcom 410 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ⊆ ∪ 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∀wal 1535 ∈ wcel 2114 ⊆ wss 3938 ∪ cuni 4840 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-v 3498 df-in 3945 df-ss 3954 df-uni 4841 |
This theorem is referenced by: elssuni 4870 uniss2 4873 ssorduni 7502 filssufilg 22521 alexsubALTlem2 22658 utoptop 22845 locfinreflem 31106 bj-sselpwuni 34345 setrec1 44801 |
Copyright terms: Public domain | W3C validator |