| 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 5007 to recover Enderton's theorem. (Contributed by Mario Carneiro, 30-Aug-2015.) |
| Ref | Expression |
|---|---|
| iunin1 | ⊢ ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = (∪ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iunin2 5019 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) = (𝐵 ∩ ∪ 𝑥 ∈ 𝐴 𝐶) | |
| 2 | incom 4159 | . . . 4 ⊢ (𝐶 ∩ 𝐵) = (𝐵 ∩ 𝐶) | |
| 3 | 2 | a1i 11 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (𝐶 ∩ 𝐵) = (𝐵 ∩ 𝐶)) |
| 4 | 3 | iuneq2i 4963 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) |
| 5 | incom 4159 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵) = (𝐵 ∩ ∪ 𝑥 ∈ 𝐴 𝐶) | |
| 6 | 1, 4, 5 | 3eqtr4i 2764 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = (∪ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 ∈ wcel 2111 ∩ cin 3901 ∪ ciun 4941 |
| 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 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-in 3909 df-ss 3919 df-iun 4943 |
| This theorem is referenced by: 2iunin 5024 resiun1 5948 tgrest 23075 metnrmlem3 24778 limciun 25823 uniin1 32529 disjunsn 32572 measinblem 34231 sstotbnd2 37820 subsaliuncl 46402 sge0iunmptlemre 46459 |
| Copyright terms: Public domain | W3C validator |