![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > uniin1 | 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 |
---|---|
uniin1 | ⊢ ∪ 𝑥 ∈ 𝐴 (𝑥 ∩ 𝐵) = (∪ 𝐴 ∩ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iunin1 4957 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 (𝑥 ∩ 𝐵) = (∪ 𝑥 ∈ 𝐴 𝑥 ∩ 𝐵) | |
2 | uniiun 4945 | . . 3 ⊢ ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 𝑥 | |
3 | 2 | ineq1i 4135 | . 2 ⊢ (∪ 𝐴 ∩ 𝐵) = (∪ 𝑥 ∈ 𝐴 𝑥 ∩ 𝐵) |
4 | 1, 3 | eqtr4i 2824 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 (𝑥 ∩ 𝐵) = (∪ 𝐴 ∩ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1538 ∩ cin 3880 ∪ cuni 4800 ∪ ciun 4881 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-in 3888 df-ss 3898 df-uni 4801 df-iun 4883 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |