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

Theorem un4 3735
 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 3733 . . 3 (𝐵 ∪ (𝐶𝐷)) = (𝐶 ∪ (𝐵𝐷))
21uneq2i 3726 . 2 (𝐴 ∪ (𝐵 ∪ (𝐶𝐷))) = (𝐴 ∪ (𝐶 ∪ (𝐵𝐷)))
3 unass 3732 . 2 ((𝐴𝐵) ∪ (𝐶𝐷)) = (𝐴 ∪ (𝐵 ∪ (𝐶𝐷)))
4 unass 3732 . 2 ((𝐴𝐶) ∪ (𝐵𝐷)) = (𝐴 ∪ (𝐶 ∪ (𝐵𝐷)))
52, 3, 43eqtr4i 2642 1 ((𝐴𝐵) ∪ (𝐶𝐷)) = ((𝐴𝐶) ∪ (𝐵𝐷))
 Colors of variables: wff setvar class Syntax hints:   = wceq 1475   ∪ cun 3538 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-v 3175  df-un 3545 This theorem is referenced by:  unundi  3736  unundir  3737  xpun  5099  resasplit  5987  ex-pw  26678  iunrelexp0  37013
 Copyright terms: Public domain W3C validator