NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  difin0ss GIF version

Theorem difin0ss 3617
Description: Difference, intersection, and subclass relationship. (Contributed by NM, 30-Apr-1994.) (Proof shortened by Wolf Lammen, 30-Sep-2014.)
Assertion
Ref Expression
difin0ss ⊢ (((A ∖ B) ∩ C) = ∅ → (C ⊆ A → C ⊆ B))

Proof of Theorem difin0ss
Dummy variable x is distinct from all other variables.
StepHypRef Expression
1 eq0 3565 . 2 ⊢ (((A ∖ B) ∩ C) = ∅ ↔ ∀x ¬ x ∈ ((A ∖ B) ∩ C))
2 iman 413 . . . . . 6 ⊢ ((x ∈ C → (x ∈ A → x ∈ B)) ↔ ¬ (x ∈ C ∧ ¬ (x ∈ A → x ∈ B)))
3 elin 3220 . . . . . . . 8 ⊢ (x ∈ ((A ∖ B) ∩ C) ↔ (x ∈ (A ∖ B) ∧ x ∈ C))
4 eldif 3222 . . . . . . . . 9 ⊢ (x ∈ (A ∖ B) ↔ (x ∈ A ∧ ¬ x ∈ B))
54anbi1i 676 . . . . . . . 8 ⊢ ((x ∈ (A ∖ B) ∧ x ∈ C) ↔ ((x ∈ A ∧ ¬ x ∈ B) ∧ x ∈ C))
63, 5bitri 240 . . . . . . 7 ⊢ (x ∈ ((A ∖ B) ∩ C) ↔ ((x ∈ A ∧ ¬ x ∈ B) ∧ x ∈ C))
7 ancom 437 . . . . . . 7 ⊢ ((x ∈ C ∧ (x ∈ A ∧ ¬ x ∈ B)) ↔ ((x ∈ A ∧ ¬ x ∈ B) ∧ x ∈ C))
8 annim 414 . . . . . . . 8 ⊢ ((x ∈ A ∧ ¬ x ∈ B) ↔ ¬ (x ∈ A → x ∈ B))
98anbi2i 675 . . . . . . 7 ⊢ ((x ∈ C ∧ (x ∈ A ∧ ¬ x ∈ B)) ↔ (x ∈ C ∧ ¬ (x ∈ A → x ∈ B)))
106, 7, 93bitr2i 264 . . . . . 6 ⊢ (x ∈ ((A ∖ B) ∩ C) ↔ (x ∈ C ∧ ¬ (x ∈ A → x ∈ B)))
112, 10xchbinxr 302 . . . . 5 ⊢ ((x ∈ C → (x ∈ A → x ∈ B)) ↔ ¬ x ∈ ((A ∖ B) ∩ C))
12 ax-2 7 . . . . 5 ⊢ ((x ∈ C → (x ∈ A → x ∈ B)) → ((x ∈ C → x ∈ A) → (x ∈ C → x ∈ B)))
1311, 12sylbir 204 . . . 4 ⊢ (¬ x ∈ ((A ∖ B) ∩ C) → ((x ∈ C → x ∈ A) → (x ∈ C → x ∈ B)))
1413al2imi 1561 . . 3 ⊢ (∀x ¬ x ∈ ((A ∖ B) ∩ C) → (∀x(x ∈ C → x ∈ A) → ∀x(x ∈ C → x ∈ B)))
15 dfss2 3263 . . 3 ⊢ (C ⊆ A ↔ ∀x(x ∈ C → x ∈ A))
16 dfss2 3263 . . 3 ⊢ (C ⊆ B ↔ ∀x(x ∈ C → x ∈ B))
1714, 15, 163imtr4g 261 . 2 ⊢ (∀x ¬ x ∈ ((A ∖ B) ∩ C) → (C ⊆ A → C ⊆ B))
181, 17sylbi 187 1 ⊢ (((A ∖ B) ∩ C) = ∅ → (C ⊆ A → C ⊆ B))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 358  ∀wal 1540   = wceq 1642   ∈ wcel 1710   ∖ cdif 3207   ∩ cin 3209   ⊆ wss 3258  ∅c0 3551
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334
This proof depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-v 2862  df-nin 3212  df-compl 3213  df-in 3214  df-dif 3216  df-ss 3260  df-nul 3552
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator