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

Theorem disjel 3975
 Description: A set can't belong to both members of disjoint classes. (Contributed by NM, 28-Feb-2015.)
Assertion
Ref Expression
disjel (((𝐴𝐵) = ∅ ∧ 𝐶𝐴) → ¬ 𝐶𝐵)

Proof of Theorem disjel
StepHypRef Expression
1 disj3 3973 . . 3 ((𝐴𝐵) = ∅ ↔ 𝐴 = (𝐴𝐵))
2 eleq2 2677 . . . 4 (𝐴 = (𝐴𝐵) → (𝐶𝐴𝐶 ∈ (𝐴𝐵)))
3 eldifn 3695 . . . 4 (𝐶 ∈ (𝐴𝐵) → ¬ 𝐶𝐵)
42, 3syl6bi 242 . . 3 (𝐴 = (𝐴𝐵) → (𝐶𝐴 → ¬ 𝐶𝐵))
51, 4sylbi 206 . 2 ((𝐴𝐵) = ∅ → (𝐶𝐴 → ¬ 𝐶𝐵))
65imp 444 1 (((𝐴𝐵) = ∅ ∧ 𝐶𝐴) → ¬ 𝐶𝐵)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977   ∖ cdif 3537   ∩ cin 3539  ∅c0 3874 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-ral 2901  df-v 3175  df-dif 3543  df-in 3547  df-nul 3875 This theorem is referenced by:  disjxun  4581  fvun1  6179  dedekindle  10080  fprodsplit  14535  unelldsys  29548  dvasin  32666
 Copyright terms: Public domain W3C validator