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

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

Proof of Theorem undisj1
StepHypRef Expression
1 un00 4360 . 2 (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐶) = ∅) ↔ ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) = ∅)
2 indir 4234 . . 3 ((𝐴 ∪ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶))
32eqeq1i 2768 . 2 (((𝐴 ∪ 𝐵) ∩ 𝐶) = ∅ ↔ ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) = ∅)
41, 3bitr4i 281 1 (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐶) = ∅) ↔ ((𝐴 ∪ 𝐵) ∩ 𝐶) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∩ cin 4092   ∪ cun 4152  ∅c0 4281
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282
This theorem is used by:  disjtpsn  4677  disjtp2  4679  funtp  6627  prinfzo0  13873  hash7g  14672  f1oun2prg  15111  cnfldfunALT  21745
  Copyright terms: Public domain W3C validator