![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > iunin1f | Structured version Visualization version GIF version |
Description: Indexed union of intersection. Generalization of half of theorem "Distributive laws" in [Enderton] p. 30. Use uniiun 5055 to recover Enderton's theorem. (Contributed by NM, 26-Mar-2004.) (Revised by Thierry Arnoux, 2-May-2020.) |
Ref | Expression |
---|---|
iunin1f.1 | ⊢ Ⅎ𝑥𝐶 |
Ref | Expression |
---|---|
iunin1f | ⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) = (∪ 𝑥 ∈ 𝐴 𝐵 ∩ 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iunin1f.1 | . . . . . 6 ⊢ Ⅎ𝑥𝐶 | |
2 | 1 | nfcri 2885 | . . . . 5 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐶 |
3 | 2 | r19.41 3255 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) ↔ (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) |
4 | elin 3960 | . . . . 5 ⊢ (𝑦 ∈ (𝐵 ∩ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) | |
5 | 4 | rexbii 3089 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∩ 𝐶) ↔ ∃𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) |
6 | eliun 4995 | . . . . 5 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) | |
7 | 6 | anbi1i 623 | . . . 4 ⊢ ((𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ∧ 𝑦 ∈ 𝐶) ↔ (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) |
8 | 3, 5, 7 | 3bitr4i 303 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∩ 𝐶) ↔ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ∧ 𝑦 ∈ 𝐶)) |
9 | eliun 4995 | . . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∩ 𝐶)) | |
10 | elin 3960 | . . 3 ⊢ (𝑦 ∈ (∪ 𝑥 ∈ 𝐴 𝐵 ∩ 𝐶) ↔ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ∧ 𝑦 ∈ 𝐶)) | |
11 | 8, 9, 10 | 3bitr4i 303 | . 2 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) ↔ 𝑦 ∈ (∪ 𝑥 ∈ 𝐴 𝐵 ∩ 𝐶)) |
12 | 11 | eqriv 2724 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) = (∪ 𝑥 ∈ 𝐴 𝐵 ∩ 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 395 = wceq 1534 ∈ wcel 2099 Ⅎwnfc 2878 ∃wrex 3065 ∩ cin 3943 ∪ ciun 4991 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-12 2164 ax-ext 2698 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1537 df-ex 1775 df-nf 1779 df-sb 2061 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-rex 3066 df-v 3471 df-in 3951 df-iun 4993 |
This theorem is referenced by: esum2dlem 33701 |
Copyright terms: Public domain | W3C validator |