| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssun | Structured version Visualization version GIF version | ||
| Description: A condition that implies inclusion in the union of two classes. (Contributed by NM, 23-Nov-2003.) |
| Ref | Expression |
|---|---|
| ssun | ⊢ ((𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶) → 𝐴 ⊆ (𝐵 ∪ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssun3 4132 | . 2 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 ⊆ (𝐵 ∪ 𝐶)) | |
| 2 | ssun4 4133 | . 2 ⊢ (𝐴 ⊆ 𝐶 → 𝐴 ⊆ (𝐵 ∪ 𝐶)) | |
| 3 | 1, 2 | jaoi 857 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶) → 𝐴 ⊆ (𝐵 ∪ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 847 ∪ cun 3899 ⊆ wss 3901 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-v 3442 df-un 3906 df-ss 3918 |
| This theorem is referenced by: pwssun 5516 ordssun 6421 padct 32797 |
| Copyright terms: Public domain | W3C validator |