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

Theorem disjel 4405
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 4402 . . 3 ((𝐴𝐵) = ∅ ↔ 𝐴 = (𝐴𝐵))
2 eleq2 2901 . . . 4 (𝐴 = (𝐴𝐵) → (𝐶𝐴𝐶 ∈ (𝐴𝐵)))
3 eldifn 4103 . . . 4 (𝐶 ∈ (𝐴𝐵) → ¬ 𝐶𝐵)
42, 3syl6bi 255 . . 3 (𝐴 = (𝐴𝐵) → (𝐶𝐴 → ¬ 𝐶𝐵))
51, 4sylbi 219 . 2 ((𝐴𝐵) = ∅ → (𝐶𝐴 → ¬ 𝐶𝐵))
65imp 409 1 (((𝐴𝐵) = ∅ ∧ 𝐶𝐴) → ¬ 𝐶𝐵)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 398   = wceq 1533  wcel 2110  cdif 3932  cin 3934  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-ral 3143  df-v 3496  df-dif 3938  df-in 3942  df-nul 4291
This theorem is referenced by:  disjxun  5056  fvun1  6748  dedekindle  10798  fprodsplit  15314  unelldsys  31412  dvasin  34972
  Copyright terms: Public domain W3C validator