| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iunin1 | Structured version Visualization version GIF version | ||
| Description: Indexed union of intersection. Generalization of half of theorem "Distributive laws" in [Enderton] p. 30. Use uniiun 5025 to recover Enderton's theorem. (Contributed by Mario Carneiro, 30-Aug-2015.) |
| Ref | Expression |
|---|---|
| iunin1 | ⊢ ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = (∪ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iunin2 5038 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) = (𝐵 ∩ ∪ 𝑥 ∈ 𝐴 𝐶) | |
| 2 | incom 4175 | . . . 4 ⊢ (𝐶 ∩ 𝐵) = (𝐵 ∩ 𝐶) | |
| 3 | 2 | a1i 11 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (𝐶 ∩ 𝐵) = (𝐵 ∩ 𝐶)) |
| 4 | 3 | iuneq2i 4980 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) |
| 5 | incom 4175 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵) = (𝐵 ∩ ∪ 𝑥 ∈ 𝐴 𝐶) | |
| 6 | 1, 4, 5 | 3eqtr4i 2763 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = (∪ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 ∈ wcel 2109 ∩ cin 3916 ∪ ciun 4958 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2702 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1543 df-ex 1780 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-in 3924 df-ss 3934 df-iun 4960 |
| This theorem is referenced by: 2iunin 5043 resiun1 5973 tgrest 23053 metnrmlem3 24757 limciun 25802 uniin1 32487 disjunsn 32530 measinblem 34217 sstotbnd2 37775 subsaliuncl 46363 sge0iunmptlemre 46420 |
| Copyright terms: Public domain | W3C validator |