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

Theorem un23 3755
Description: A rearrangement of union. (Contributed by NM, 12-Aug-2004.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Assertion
Ref Expression
un23 ((𝐴𝐵) ∪ 𝐶) = ((𝐴𝐶) ∪ 𝐵)

Proof of Theorem un23
StepHypRef Expression
1 unass 3753 . 2 ((𝐴𝐵) ∪ 𝐶) = (𝐴 ∪ (𝐵𝐶))
2 un12 3754 . 2 (𝐴 ∪ (𝐵𝐶)) = (𝐵 ∪ (𝐴𝐶))
3 uncom 3740 . 2 (𝐵 ∪ (𝐴𝐶)) = ((𝐴𝐶) ∪ 𝐵)
41, 2, 33eqtri 2652 1 ((𝐴𝐵) ∪ 𝐶) = ((𝐴𝐶) ∪ 𝐵)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1480  cun 3558
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1841  ax-6 1890  ax-7 1937  ax-9 2001  ax-10 2021  ax-11 2036  ax-12 2049  ax-13 2250  ax-ext 2606
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1883  df-clab 2613  df-cleq 2619  df-clel 2622  df-nfc 2756  df-v 3193  df-un 3565
This theorem is referenced by:  ssunpr  4338  setscom  15819  poimirlem6  33033  poimirlem7  33034  poimirlem16  33043  poimirlem19  33046  iocunico  37263  dfrcl2  37433
  Copyright terms: Public domain W3C validator