| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uniin2 | Structured version Visualization version GIF version | ||
| Description: Union of intersection. Generalization of half of theorem "Distributive laws" in [Enderton] p. 30. (Contributed by Thierry Arnoux, 21-Jun-2020.) |
| Ref | Expression |
|---|---|
| uniin2 | ⊢ ∪ 𝑥 ∈ 𝐵 (𝐴 ∩ 𝑥) = (𝐴 ∩ ∪ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iunin2 5037 | . 2 ⊢ ∪ 𝑥 ∈ 𝐵 (𝐴 ∩ 𝑥) = (𝐴 ∩ ∪ 𝑥 ∈ 𝐵 𝑥) | |
| 2 | uniiun 5025 | . . 3 ⊢ ∪ 𝐵 = ∪ 𝑥 ∈ 𝐵 𝑥 | |
| 3 | 2 | ineq2i 4170 | . 2 ⊢ (𝐴 ∩ ∪ 𝐵) = (𝐴 ∩ ∪ 𝑥 ∈ 𝐵 𝑥) |
| 4 | 1, 3 | eqtr4i 2791 | 1 ⊢ ∪ 𝑥 ∈ 𝐵 (𝐴 ∩ 𝑥) = (𝐴 ∩ ∪ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∩ cin 3905 ∪ cuni 4874 ∪ ciun 4958 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-rex 3092 df-rab 3419 df-v 3459 df-in 3913 df-uni 4875 df-iun 4960 |
| This theorem is used by: ssdifidllem 21513 ldgenpisyslem1 34577 |
| Copyright terms: Public domain | W3C validator |