Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sscond | Structured version Visualization version GIF version |
Description: If 𝐴 is contained in 𝐵, then (𝐶 ∖ 𝐵) is contained in (𝐶 ∖ 𝐴). Deduction form of sscon 4114. (Contributed by David Moews, 1-May-2017.) |
Ref | Expression |
---|---|
ssdifd.1 | ⊢ (𝜑 → 𝐴 ⊆ 𝐵) |
Ref | Expression |
---|---|
sscond | ⊢ (𝜑 → (𝐶 ∖ 𝐵) ⊆ (𝐶 ∖ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssdifd.1 | . 2 ⊢ (𝜑 → 𝐴 ⊆ 𝐵) | |
2 | sscon 4114 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐶 ∖ 𝐵) ⊆ (𝐶 ∖ 𝐴)) | |
3 | 1, 2 | syl 17 | 1 ⊢ (𝜑 → (𝐶 ∖ 𝐵) ⊆ (𝐶 ∖ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∖ cdif 3932 ⊆ wss 3935 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-v 3496 df-dif 3938 df-in 3942 df-ss 3951 |
This theorem is referenced by: ssdif2d 4119 eldifeldifsn 4737 fin23lem26 9741 isercoll2 15019 fctop 21606 ntrss 21657 iunconnlem 22029 clsconn 22032 regr1lem 22341 blcld 23109 rrxdstprj1 24006 voliunlem1 24145 carsgclctunlem2 31572 salexct 42611 meaiininclem 42762 carageniuncllem2 42798 |
Copyright terms: Public domain | W3C validator |