 New Foundations Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  NFE Home  >  Th. List  >  un23 GIF version

Theorem un23 3422
 Description: A rearrangement of union. (Contributed by NM, 12-Aug-2004.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Assertion
Ref Expression
un23 ((AB) ∪ C) = ((AC) ∪ B)

Proof of Theorem un23
StepHypRef Expression
1 unass 3420 . 2 ((AB) ∪ C) = (A ∪ (BC))
2 un12 3421 . 2 (A ∪ (BC)) = (B ∪ (AC))
3 uncom 3408 . 2 (B ∪ (AC)) = ((AC) ∪ B)
41, 2, 33eqtri 2377 1 ((AB) ∪ C) = ((AC) ∪ B)
 Colors of variables: wff setvar class Syntax hints:   = wceq 1642   ∪ cun 3207 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-v 2861  df-nin 3211  df-compl 3212  df-un 3214 This theorem is referenced by:  ssunpr  3868
 Copyright terms: Public domain W3C validator