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

Theorem ssdifin0 4050
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 3838 . 2 (𝐴 ⊆ (𝐵𝐶) → (𝐴𝐶) ⊆ ((𝐵𝐶) ∩ 𝐶))
2 incom 3805 . . 3 ((𝐵𝐶) ∩ 𝐶) = (𝐶 ∩ (𝐵𝐶))
3 disjdif 4040 . . 3 (𝐶 ∩ (𝐵𝐶)) = ∅
42, 3eqtri 2644 . 2 ((𝐵𝐶) ∩ 𝐶) = ∅
5 sseq0 3975 . 2 (((𝐴𝐶) ⊆ ((𝐵𝐶) ∩ 𝐶) ∧ ((𝐵𝐶) ∩ 𝐶) = ∅) → (𝐴𝐶) = ∅)
61, 4, 5sylancl 694 1 (𝐴 ⊆ (𝐵𝐶) → (𝐴𝐶) = ∅)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1483  cdif 3571  cin 3573  wss 3574  c0 3915
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-v 3202  df-dif 3577  df-in 3581  df-ss 3588  df-nul 3916
This theorem is referenced by:  ssdifeq0  4051  marypha1lem  8339  numacn  8872  mreexexlem2d  16305  mreexexlem4d  16307  nrmsep2  21160  isnrm3  21163
  Copyright terms: Public domain W3C validator