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

Theorem un4 4169
Description: A rearrangement of the union of 4 classes. (Contributed by NM, 12-Aug-2004.)
Assertion
Ref Expression
un4 ((𝐴𝐵) ∪ (𝐶𝐷)) = ((𝐴𝐶) ∪ (𝐵𝐷))

Proof of Theorem un4
StepHypRef Expression
1 un12 4167 . . 3 (𝐵 ∪ (𝐶𝐷)) = (𝐶 ∪ (𝐵𝐷))
21uneq2i 4160 . 2 (𝐴 ∪ (𝐵 ∪ (𝐶𝐷))) = (𝐴 ∪ (𝐶 ∪ (𝐵𝐷)))
3 unass 4166 . 2 ((𝐴𝐵) ∪ (𝐶𝐷)) = (𝐴 ∪ (𝐵 ∪ (𝐶𝐷)))
4 unass 4166 . 2 ((𝐴𝐶) ∪ (𝐵𝐷)) = (𝐴 ∪ (𝐶 ∪ (𝐵𝐷)))
52, 3, 43eqtr4i 2771 1 ((𝐴𝐵) ∪ (𝐶𝐷)) = ((𝐴𝐶) ∪ (𝐵𝐷))
Colors of variables: wff setvar class
Syntax hints:   = wceq 1542  cun 3946
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-tru 1545  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-v 3477  df-un 3953
This theorem is referenced by:  unundi  4170  unundir  4171  xpun  5748  resasplit  6759  addsdi  27600  mulsass  27611  ex-pw  29672  iunrelexp0  42439
  Copyright terms: Public domain W3C validator