| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssun3 | Structured version Visualization version GIF version | ||
| Description: Subclass law for union of classes. (Contributed by NM, 5-Aug-1993.) |
| Ref | Expression |
|---|---|
| ssun3 | ⊢ (𝐴 ⊆ 𝐵 → 𝐴 ⊆ (𝐵 ∪ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssun1 4175 | . 2 ⊢ 𝐵 ⊆ (𝐵 ∪ 𝐶) | |
| 2 | sstr2 3916 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐵 ⊆ (𝐵 ∪ 𝐶) → 𝐴 ⊆ (𝐵 ∪ 𝐶))) | |
| 3 | 1, 2 | mpi 21 | 1 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 ⊆ (𝐵 ∪ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ⊆ wss 3896 ∪ cun 4148 |
| 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 3897 df-un 4150 |
| This theorem is used by: ssun 4192 ssunsn2 4782 xpsspw 5788 uncmp 23730 alexsubALTlem3 24377 constrextdg2lem 34430 sxbrsigalem0 34953 bnj1450 35730 fineqvac 35852 altxpsspw 36866 ttcuniun 37422 ttciunun 37423 pibt2 38477 superuncl 44706 cnvtrcl0 44763 |
| Copyright terms: Public domain | W3C validator |