| 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 4155 | . 2 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 ⊆ (𝐵 ∪ 𝐶)) | |
| 2 | ssun4 4156 | . 2 ⊢ (𝐴 ⊆ 𝐶 → 𝐴 ⊆ (𝐵 ∪ 𝐶)) | |
| 3 | 1, 2 | jaoi 857 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶) → 𝐴 ⊆ (𝐵 ∪ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 847 ∪ cun 3924 ⊆ wss 3926 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2707 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1543 df-ex 1780 df-sb 2065 df-clab 2714 df-cleq 2727 df-clel 2809 df-v 3461 df-un 3931 df-ss 3943 |
| This theorem is referenced by: pwssun 5545 ordssun 6456 padct 32697 |
| Copyright terms: Public domain | W3C validator |