Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ssdif | Structured version Visualization version GIF version |
Description: Difference law for subsets. (Contributed by NM, 28-May-1998.) |
Ref | Expression |
---|---|
ssdif | ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∖ 𝐶) ⊆ (𝐵 ∖ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssel 3562 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)) | |
2 | 1 | anim1d 586 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐶) → (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶))) |
3 | eldif 3550 | . . 3 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐶)) | |
4 | eldif 3550 | . . 3 ⊢ (𝑥 ∈ (𝐵 ∖ 𝐶) ↔ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)) | |
5 | 2, 3, 4 | 3imtr4g 284 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ (𝐴 ∖ 𝐶) → 𝑥 ∈ (𝐵 ∖ 𝐶))) |
6 | 5 | ssrdv 3574 | 1 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∖ 𝐶) ⊆ (𝐵 ∖ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 383 ∈ wcel 1977 ∖ cdif 3537 ⊆ wss 3540 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-v 3175 df-dif 3543 df-in 3547 df-ss 3554 |
This theorem is referenced by: ssdifd 3708 php 8029 pssnn 8063 fin1a2lem13 9117 axcclem 9162 isercolllem3 14245 mvdco 17688 dprdres 18250 dpjidcl 18280 ablfac1eulem 18294 lspsnat 18966 lbsextlem2 18980 lbsextlem3 18981 mplmonmul 19285 cnsubdrglem 19616 clscon 21043 2ndcdisj2 21070 kqdisj 21345 nulmbl2 23111 i1f1 23263 itg11 23264 itg1climres 23287 limcresi 23455 dvreslem 23479 dvres2lem 23480 dvaddbr 23507 dvmulbr 23508 lhop 23583 elqaa 23881 difres 28795 imadifxp 28796 xrge00 29017 eulerpartlemmf 29764 eulerpartlemgf 29768 bj-2upln1upl 32205 mblfinlem3 32618 mblfinlem4 32619 ismblfin 32620 cnambfre 32628 divrngidl 32997 cntzsdrg 36791 radcnvrat 37535 fourierdlem62 39061 |
Copyright terms: Public domain | W3C validator |