Theorem iinin1 5004

Description: Indexed intersection of intersection. Generalization of half of theorem "Distributive laws" in [Enderton] p. 30. Use intiin 4986 to recover Enderton's theorem. (Contributed by Mario Carneiro, 19-Mar-2015.)

Assertion

Ref	Expression
iinin1	⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = (∩ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem iinin1

Step	Hyp	Ref	Expression
1		iinin2 5003	. 2 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) = (𝐵 ∩ ∩ 𝑥 ∈ 𝐴 𝐶))
2		incom 4181	. . . 4 ⊢ (𝐶 ∩ 𝐵) = (𝐵 ∩ 𝐶)
3	2	a1i 11	. . 3 ⊢ (𝑥 ∈ 𝐴 → (𝐶 ∩ 𝐵) = (𝐵 ∩ 𝐶))
4	3	iineq2i 4944	. 2 ⊢ ∩ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶)
5		incom 4181	. 2 ⊢ (∩ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵) = (𝐵 ∩ ∩ 𝑥 ∈ 𝐴 𝐶)
6	1, 4, 5	3eqtr4g 2884	1 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐶 ∩ 𝐵) = (∩ 𝑥 ∈ 𝐴 𝐶 ∩ 𝐵))

Syntax hints:   → wi 4   = wceq 1536   ∈ wcel 2113   ≠ wne 3019   ∩ cin 3938  ∅c0 4294  ∩ ciin 4923

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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rab 3150  df-v 3499  df-dif 3942  df-in 3946  df-nul 4295  df-iin 4925

This theorem is referenced by:  firest  16709  iniin1  41397