MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ssdifin0 Structured version   Visualization version   GIF version

Theorem ssdifin0 4430
Description: A subset of a difference does not intersect the subtrahend. (Contributed by Jeff Hankins, 1-Sep-2013.) (Proof shortened by Mario Carneiro, 24-Aug-2015.)
Assertion
Ref Expression
ssdifin0 (𝐴 ⊆ (𝐵𝐶) → (𝐴𝐶) = ∅)

Proof of Theorem ssdifin0
StepHypRef Expression
1 ssrin 4209 . 2 (𝐴 ⊆ (𝐵𝐶) → (𝐴𝐶) ⊆ ((𝐵𝐶) ∩ 𝐶))
2 incom 4177 . . 3 ((𝐵𝐶) ∩ 𝐶) = (𝐶 ∩ (𝐵𝐶))
3 disjdif 4420 . . 3 (𝐶 ∩ (𝐵𝐶)) = ∅
42, 3eqtri 2844 . 2 ((𝐵𝐶) ∩ 𝐶) = ∅
5 sseq0 4352 . 2 (((𝐴𝐶) ⊆ ((𝐵𝐶) ∩ 𝐶) ∧ ((𝐵𝐶) ∩ 𝐶) = ∅) → (𝐴𝐶) = ∅)
61, 4, 5sylancl 588 1 (𝐴 ⊆ (𝐵𝐶) → (𝐴𝐶) = ∅)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1533  cdif 3932  cin 3934  wss 3935  c0 4290
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-rab 3147  df-v 3496  df-dif 3938  df-in 3942  df-ss 3951  df-nul 4291
This theorem is referenced by:  ssdifeq0  4431  marypha1lem  8891  numacn  9469  mreexexlem2d  16910  mreexexlem4d  16912  nrmsep2  21958  isnrm3  21961
  Copyright terms: Public domain W3C validator