| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unss2 | Structured version Visualization version GIF version | ||
| Description: Subclass law for union of classes. Exercise 7 of [TakeutiZaring] p. 18. (Contributed by NM, 14-Oct-1999.) |
| Ref | Expression |
|---|---|
| unss2 | ⊢ (𝐴 ⊆ 𝐵 → (𝐶 ∪ 𝐴) ⊆ (𝐶 ∪ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | unss1 4140 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∪ 𝐶) ⊆ (𝐵 ∪ 𝐶)) | |
| 2 | uncom 4114 | . 2 ⊢ (𝐶 ∪ 𝐴) = (𝐴 ∪ 𝐶) | |
| 3 | uncom 4114 | . 2 ⊢ (𝐶 ∪ 𝐵) = (𝐵 ∪ 𝐶) | |
| 4 | 1, 2, 3 | 3sstr4g 3992 | 1 ⊢ (𝐴 ⊆ 𝐵 → (𝐶 ∪ 𝐴) ⊆ (𝐶 ∪ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∪ cun 3905 ⊆ wss 3907 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1566 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-v 3459 df-un 3912 df-ss 3924 |
| This theorem is referenced by: unss12 4143 ord3ex 5348 xpider 8774 fin1a2lem13 10384 canthp1lem2 10626 seqexw 14041 uniioombllem3 25701 volcn 25722 dvres2lem 26026 mulsproplem13 28275 mulsproplem14 28276 bnj1413 35335 bnj1408 35336 |
| Copyright terms: Public domain | W3C validator |