| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unundi | Structured version Visualization version GIF version | ||
| Description: Union distributes over itself. (Contributed by NM, 17-Aug-2004.) |
| Ref | Expression |
|---|---|
| unundi | ⊢ (𝐴 ∪ (𝐵 ∪ 𝐶)) = ((𝐴 ∪ 𝐵) ∪ (𝐴 ∪ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | unidm 4111 | . . 3 ⊢ (𝐴 ∪ 𝐴) = 𝐴 | |
| 2 | 1 | uneq1i 4118 | . 2 ⊢ ((𝐴 ∪ 𝐴) ∪ (𝐵 ∪ 𝐶)) = (𝐴 ∪ (𝐵 ∪ 𝐶)) |
| 3 | un4 4128 | . 2 ⊢ ((𝐴 ∪ 𝐴) ∪ (𝐵 ∪ 𝐶)) = ((𝐴 ∪ 𝐵) ∪ (𝐴 ∪ 𝐶)) | |
| 4 | 2, 3 | eqtr3i 2790 | 1 ⊢ (𝐴 ∪ (𝐵 ∪ 𝐶)) = ((𝐴 ∪ 𝐵) ∪ (𝐴 ∪ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∪ cun 3904 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-v 3459 df-un 3911 |
| This theorem is used by: dfif5 4506 |
| Copyright terms: Public domain | W3C validator |