| 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 4178 | . 2 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 ⊆ (𝐵 ∪ 𝐶)) | |
| 2 | ssun4 4179 | . 2 ⊢ (𝐴 ⊆ 𝐶 → 𝐴 ⊆ (𝐵 ∪ 𝐶)) | |
| 3 | 1, 2 | jaoi 871 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶) → 𝐴 ⊆ (𝐵 ∪ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∨ wo 861 ⊆ wss 3895 ∪ cun 4149 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1572 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-v 3452 df-ss 3896 df-un 4151 |
| This theorem is used by: trun 5222 pwssun 5542 ordssun 6467 |
| Copyright terms: Public domain | W3C validator |