| 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 4097. (Contributed by David Moews, 1-May-2017.) |
| Ref | Expression |
|---|---|
| ssdifd.1 | ⊢ (𝜑 → 𝐴 ⊆ 𝐵) |
| Ref | Expression |
|---|---|
| sscond | ⊢ (𝜑 → (𝐶 ∖ 𝐵) ⊆ (𝐶 ∖ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssdifd.1 | . 2 ⊢ (𝜑 → 𝐴 ⊆ 𝐵) | |
| 2 | sscon 4097 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐶 ∖ 𝐵) ⊆ (𝐶 ∖ 𝐴)) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝜑 → (𝐶 ∖ 𝐵) ⊆ (𝐶 ∖ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∖ cdif 3903 ⊆ wss 3906 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-v 3459 df-dif 3909 df-ss 3923 |
| This theorem is used by: ssdif2d 4102 eldifeldifsn 4779 fin23lem26 10324 isercoll2 15744 fctop 23211 ntrss 23262 iunconnlem 23634 clsconn 23637 regr1lem 23947 blcld 24713 rrxdstprj1 25619 voliunlem1 25760 elrgspnsubrunlem2 33632 elrspunidl 33800 carsgclctunlem2 34774 salexct 47106 meaiininclem 47258 carageniuncllem2 47294 seposep 49761 |
| Copyright terms: Public domain | W3C validator |