Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > 2iunin | GIF version |
Description: Rearrange indexed unions over intersection. (Contributed by NM, 18-Dec-2008.) |
Ref | Expression |
---|---|
2iunin | ⊢ ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 (𝐶 ∩ 𝐷) = (∪ 𝑥 ∈ 𝐴 𝐶 ∩ ∪ 𝑦 ∈ 𝐵 𝐷) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iunin2 3720 | . . . 4 ⊢ ∪ 𝑦 ∈ 𝐵 (𝐶 ∩ 𝐷) = (𝐶 ∩ ∪ 𝑦 ∈ 𝐵 𝐷) | |
2 | 1 | a1i 9 | . . 3 ⊢ (𝑥 ∈ 𝐴 → ∪ 𝑦 ∈ 𝐵 (𝐶 ∩ 𝐷) = (𝐶 ∩ ∪ 𝑦 ∈ 𝐵 𝐷)) |
3 | 2 | iuneq2i 3675 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 (𝐶 ∩ 𝐷) = ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ ∪ 𝑦 ∈ 𝐵 𝐷) |
4 | iunin1 3721 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ ∪ 𝑦 ∈ 𝐵 𝐷) = (∪ 𝑥 ∈ 𝐴 𝐶 ∩ ∪ 𝑦 ∈ 𝐵 𝐷) | |
5 | 3, 4 | eqtri 2060 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 (𝐶 ∩ 𝐷) = (∪ 𝑥 ∈ 𝐴 𝐶 ∩ ∪ 𝑦 ∈ 𝐵 𝐷) |
Colors of variables: wff set class |
Syntax hints: = wceq 1243 ∈ wcel 1393 ∩ cin 2916 ∪ ciun 3657 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-rex 2312 df-v 2559 df-in 2924 df-ss 2931 df-iun 3659 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |