| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > un12 | Structured version Visualization version GIF version | ||
| Description: A rearrangement of union. (Contributed by NM, 12-Aug-2004.) |
| Ref | Expression |
|---|---|
| un12 | ⊢ (𝐴 ∪ (𝐵 ∪ 𝐶)) = (𝐵 ∪ (𝐴 ∪ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uncom 4107 | . . 3 ⊢ (𝐴 ∪ 𝐵) = (𝐵 ∪ 𝐴) | |
| 2 | 1 | uneq1i 4113 | . 2 ⊢ ((𝐴 ∪ 𝐵) ∪ 𝐶) = ((𝐵 ∪ 𝐴) ∪ 𝐶) |
| 3 | unass 4121 | . 2 ⊢ ((𝐴 ∪ 𝐵) ∪ 𝐶) = (𝐴 ∪ (𝐵 ∪ 𝐶)) | |
| 4 | unass 4121 | . 2 ⊢ ((𝐵 ∪ 𝐴) ∪ 𝐶) = (𝐵 ∪ (𝐴 ∪ 𝐶)) | |
| 5 | 2, 3, 4 | 3eqtr3i 2764 | 1 ⊢ (𝐴 ∪ (𝐵 ∪ 𝐶)) = (𝐵 ∪ (𝐴 ∪ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 ∪ cun 3896 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2705 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2712 df-cleq 2725 df-clel 2808 df-v 3439 df-un 3903 |
| This theorem is referenced by: un23 4123 un4 4124 fresaun 6702 unfi 9091 reconnlem1 24762 poimirlem6 37739 poimirlem7 37740 asindmre 37816 frege133d 43922 |
| Copyright terms: Public domain | W3C validator |