| 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 5059 to recover Enderton's theorem. (Contributed by Mario Carneiro, 19-Mar-2015.) |
| Ref | Expression |
|---|---|
| iinin1 | ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = (∩ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iinin2 5078 | . 2 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) = (𝐵 ∩ ∩ 𝑥 ∈ 𝐴 𝐶)) | |
| 2 | incom 4209 | . . . 4 ⊢ (𝐶 ∩ 𝐵) = (𝐵 ∩ 𝐶) | |
| 3 | 2 | a1i 11 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (𝐶 ∩ 𝐵) = (𝐵 ∩ 𝐶)) |
| 4 | 3 | iineq2i 5014 | . 2 ⊢ ∩ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) |
| 5 | incom 4209 | . 2 ⊢ (∩ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵) = (𝐵 ∩ ∩ 𝑥 ∈ 𝐴 𝐶) | |
| 6 | 1, 4, 5 | 3eqtr4g 2802 | 1 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = (∩ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2108 ≠ wne 2940 ∩ cin 3950 ∅c0 4333 ∩ ciin 4992 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-12 2177 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-clab 2715 df-cleq 2729 df-clel 2816 df-ne 2941 df-ral 3062 df-rab 3437 df-v 3482 df-dif 3954 df-in 3958 df-nul 4334 df-iin 4994 |
| This theorem is referenced by: firest 17477 iniin1 45130 |
| Copyright terms: Public domain | W3C validator |