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

Theorem undisj2 4415
Description: The union of disjoint classes is disjoint. (Contributed by NM, 13-Sep-2004.)
Assertion
Ref Expression
undisj2 (((𝐴 ∩ 𝐵) = ∅ ∧ (𝐴 ∩ 𝐶) = ∅) ↔ (𝐴 ∩ (𝐵 ∪ 𝐶)) = ∅)

Proof of Theorem undisj2
StepHypRef Expression
1 un00 4356 . 2 (((𝐴 ∩ 𝐵) = ∅ ∧ (𝐴 ∩ 𝐶) = ∅) ↔ ((𝐴 ∩ 𝐵) ∪ (𝐴 ∩ 𝐶)) = ∅)
2 indi 4229 . . 3 (𝐴 ∩ (𝐵 ∪ 𝐶)) = ((𝐴 ∩ 𝐵) ∪ (𝐴 ∩ 𝐶))
32eqeq1i 2765 . 2 ((𝐴 ∩ (𝐵 ∪ 𝐶)) = ∅ ↔ ((𝐴 ∩ 𝐵) ∪ (𝐴 ∩ 𝐶)) = ∅)
41, 3bitr4i 281 1 (((𝐴 ∩ 𝐵) = ∅ ∧ (𝐴 ∩ 𝐶) = ∅) ↔ (𝐴 ∩ (𝐵 ∪ 𝐶)) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∩ cin 4089   ∪ cun 4149  ∅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-or 862  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279
This theorem is used by:  disjtp2  4673  f1oun2prg  15074  cnfldfunALT  21699  dfttc4lem2  37410
  Copyright terms: Public domain W3C validator