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 4945 to recover Enderton's theorem. (Contributed by Mario Carneiro, 19-Mar-2015.) |
Ref | Expression |
---|---|
iinin1 | ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = (∩ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iinin2 4963 | . 2 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) = (𝐵 ∩ ∩ 𝑥 ∈ 𝐴 𝐶)) | |
2 | incom 4091 | . . . 4 ⊢ (𝐶 ∩ 𝐵) = (𝐵 ∩ 𝐶) | |
3 | 2 | a1i 11 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (𝐶 ∩ 𝐵) = (𝐵 ∩ 𝐶)) |
4 | 3 | iineq2i 4903 | . 2 ⊢ ∩ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) |
5 | incom 4091 | . 2 ⊢ (∩ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵) = (𝐵 ∩ ∩ 𝑥 ∈ 𝐴 𝐶) | |
6 | 1, 4, 5 | 3eqtr4g 2798 | 1 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = (∩ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ≠ wne 2934 ∩ cin 3842 ∅c0 4211 ∩ ciin 4882 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-12 2179 ax-ext 2710 |
This theorem depends on definitions: df-bi 210 df-an 400 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-clab 2717 df-cleq 2730 df-clel 2811 df-ne 2935 df-ral 3058 df-rab 3062 df-v 3400 df-dif 3846 df-in 3850 df-nul 4212 df-iin 4884 |
This theorem is referenced by: firest 16811 iniin1 42234 |
Copyright terms: Public domain | W3C validator |