Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 2iunin | Structured version Visualization version GIF version |
Description: Rearrange indexed unions over intersection. (Contributed by NM, 18-Dec-2008.) |
Ref | Expression |
---|---|
2iunin | ⊢ ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 (𝐶 ∩ 𝐷) = (∪ 𝑥 ∈ 𝐴 𝐶 ∩ ∪ 𝑦 ∈ 𝐵 𝐷) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iunin2 4993 | . . . 4 ⊢ ∪ 𝑦 ∈ 𝐵 (𝐶 ∩ 𝐷) = (𝐶 ∩ ∪ 𝑦 ∈ 𝐵 𝐷) | |
2 | 1 | a1i 11 | . . 3 ⊢ (𝑥 ∈ 𝐴 → ∪ 𝑦 ∈ 𝐵 (𝐶 ∩ 𝐷) = (𝐶 ∩ ∪ 𝑦 ∈ 𝐵 𝐷)) |
3 | 2 | iuneq2i 4940 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 (𝐶 ∩ 𝐷) = ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ ∪ 𝑦 ∈ 𝐵 𝐷) |
4 | iunin1 4994 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ ∪ 𝑦 ∈ 𝐵 𝐷) = (∪ 𝑥 ∈ 𝐴 𝐶 ∩ ∪ 𝑦 ∈ 𝐵 𝐷) | |
5 | 3, 4 | eqtri 2844 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 (𝐶 ∩ 𝐷) = (∪ 𝑥 ∈ 𝐴 𝐶 ∩ ∪ 𝑦 ∈ 𝐵 𝐷) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∈ wcel 2114 ∩ cin 3935 ∪ ciun 4919 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-in 3943 df-ss 3952 df-iun 4921 |
This theorem is referenced by: fpar 7811 |
Copyright terms: Public domain | W3C validator |