| 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 5018 to recover Enderton's theorem. (Contributed by Mario Carneiro, 30-Aug-2015.) |
| Ref | Expression |
|---|---|
| iunin1 | ⊢ ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = (∪ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iunin2 5030 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) = (𝐵 ∩ ∪ 𝑥 ∈ 𝐴 𝐶) | |
| 2 | incom 4164 | . . . 4 ⊢ (𝐶 ∩ 𝐵) = (𝐵 ∩ 𝐶) | |
| 3 | 2 | a1i 11 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (𝐶 ∩ 𝐵) = (𝐵 ∩ 𝐶)) |
| 4 | 3 | iuneq2i 4973 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) |
| 5 | incom 4164 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵) = (𝐵 ∩ ∪ 𝑥 ∈ 𝐴 𝐶) | |
| 6 | 1, 4, 5 | 3eqtr4i 2798 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = (∪ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1563 ∈ wcel 2145 ∩ cin 3906 ∪ ciun 4951 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1566 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-in 3914 df-ss 3924 df-iun 4953 |
| This theorem is referenced by: uniin1 5034 2iunin 5037 resiun1 5988 tgrest 23273 metnrmlem3 24976 limciun 26010 disjunsn 32845 measinblem 34522 sstotbnd2 38280 subsaliuncl 46931 sge0iunmptlemre 46988 |
| Copyright terms: Public domain | W3C validator |