Theorem ssdifin0 4446

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

Step	Hyp	Ref	Expression
1		ssrin 4194	. 2 ⊢ (𝐴 ⊆ (𝐵 ∖ 𝐶) → (𝐴 ∩ 𝐶) ⊆ ((𝐵 ∖ 𝐶) ∩ 𝐶))
2		disjdifr 4434	. 2 ⊢ ((𝐵 ∖ 𝐶) ∩ 𝐶) = ∅
3		sseq0 4361	. 2 ⊢ (((𝐴 ∩ 𝐶) ⊆ ((𝐵 ∖ 𝐶) ∩ 𝐶) ∧ ((𝐵 ∖ 𝐶) ∩ 𝐶) = ∅) → (𝐴 ∩ 𝐶) = ∅)
4	1, 2, 3	sylancl 597	1 ⊢ (𝐴 ⊆ (𝐵 ∖ 𝐶) → (𝐴 ∩ 𝐶) = ∅)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∖ cdif 3902   ∩ cin 3904   ⊆ wss 3905  ∅c0 4286

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3417  df-v 3457  df-dif 3908  df-in 3912  df-ss 3922  df-nul 4287

This theorem is used by:  ssdifeq0  4447  marypha1lem  9389  numacn  10038  mreexexlem2d  17705  mreexexlem4d  17707  nrmsep2  23522  isnrm3  23525