Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iinin1 | Structured version Visualization version GIF version |
Description: Indexed intersection of intersection. Generalization of half of theorem "Distributive laws" in [Enderton] p. 30. Use intiin 4510 to recover Enderton's theorem. (Contributed by Mario Carneiro, 19-Mar-2015.) |
Ref | Expression |
---|---|
iinin1 | ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = (∩ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iinin2 4526 | . 2 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) = (𝐵 ∩ ∩ 𝑥 ∈ 𝐴 𝐶)) | |
2 | incom 3767 | . . . 4 ⊢ (𝐶 ∩ 𝐵) = (𝐵 ∩ 𝐶) | |
3 | 2 | a1i 11 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (𝐶 ∩ 𝐵) = (𝐵 ∩ 𝐶)) |
4 | 3 | iineq2i 4476 | . 2 ⊢ ∩ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) |
5 | incom 3767 | . 2 ⊢ (∩ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵) = (𝐵 ∩ ∩ 𝑥 ∈ 𝐴 𝐶) | |
6 | 1, 4, 5 | 3eqtr4g 2669 | 1 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = (∩ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 ∩ cin 3539 ∅c0 3874 ∩ ciin 4456 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-v 3175 df-dif 3543 df-in 3547 df-nul 3875 df-iin 4458 |
This theorem is referenced by: firest 15916 |
Copyright terms: Public domain | W3C validator |