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

Theorem disjel 4409
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 4406 . . 3 ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 = (𝐴 ∖ 𝐵))
2 eleq2 2849 . . . 4 (𝐴 = (𝐴 ∖ 𝐵) → (𝐶 ∈ 𝐴 ↔ 𝐶 ∈ (𝐴 ∖ 𝐵)))
3 eldifn 4068 . . . 4 (𝐶 ∈ (𝐴 ∖ 𝐵) → ¬ 𝐶 ∈ 𝐵)
42, 3biimtrdi 256 . . 3 (𝐴 = (𝐴 ∖ 𝐵) → (𝐶 ∈ 𝐴 → ¬ 𝐶 ∈ 𝐵))
51, 4sylbi 220 . 2 ((𝐴 ∩ 𝐵) = ∅ → (𝐶 ∈ 𝐴 → ¬ 𝐶 ∈ 𝐵))
65imp 412 1 (((𝐴 ∩ 𝐵) = ∅ ∧ 𝐶 ∈ 𝐴) → ¬ 𝐶 ∈ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ∖ cdif 4045   ∩ cin 4089  ∅c0 4278
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-v 3452  df-dif 4047  df-in 4091  df-nul 4279
This theorem is used by:  disjxun  5100  fvun1  6977  dedekindle  11478  fprodsplit  16139  prlngpln3  29433  unelldsys  34838  dvasin  38716
  Copyright terms: Public domain W3C validator