Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  un12 GIF version

Theorem un12 3235
 Description: A rearrangement of union. (Contributed by NM, 12-Aug-2004.)
Assertion
Ref Expression
un12 (𝐴 ∪ (𝐵𝐶)) = (𝐵 ∪ (𝐴𝐶))

Proof of Theorem un12
StepHypRef Expression
1 uncom 3221 . . 3 (𝐴𝐵) = (𝐵𝐴)
21uneq1i 3227 . 2 ((𝐴𝐵) ∪ 𝐶) = ((𝐵𝐴) ∪ 𝐶)
3 unass 3234 . 2 ((𝐴𝐵) ∪ 𝐶) = (𝐴 ∪ (𝐵𝐶))
4 unass 3234 . 2 ((𝐵𝐴) ∪ 𝐶) = (𝐵 ∪ (𝐴𝐶))
52, 3, 43eqtr3i 2169 1 (𝐴 ∪ (𝐵𝐶)) = (𝐵 ∪ (𝐴𝐶))
 Colors of variables: wff set class Syntax hints:   = wceq 1332   ∪ cun 3070 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122 This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-v 2689  df-un 3076 This theorem is referenced by:  un23  3236  un4  3237
 Copyright terms: Public domain W3C validator