Theorem iinin2 5003

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
iinin2	⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) = (𝐵 ∩ ∩ 𝑥 ∈ 𝐴 𝐶))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem iinin2

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		r19.28zv 4449	. . . 4 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)))
2		elin 4172	. . . . 5 ⊢ (𝑦 ∈ (𝐵 ∩ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))
3	2	ralbii 3168	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∩ 𝐶) ↔ ∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))
4		eliin 4927	. . . . . 6 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶))
5	4	elv 3502	. . . . 5 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)
6	5	anbi2i 624	. . . 4 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶))
7	1, 3, 6	3bitr4g 316	. . 3 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∩ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶)))
8		eliin 4927	. . . 4 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∩ 𝐶)))
9	8	elv 3502	. . 3 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∩ 𝐶))
10		elin 4172	. . 3 ⊢ (𝑦 ∈ (𝐵 ∩ ∩ 𝑥 ∈ 𝐴 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶))
11	7, 9, 10	3bitr4g 316	. 2 ⊢ (𝐴 ≠ ∅ → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) ↔ 𝑦 ∈ (𝐵 ∩ ∩ 𝑥 ∈ 𝐴 𝐶)))
12	11	eqrdv 2822	1 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) = (𝐵 ∩ ∩ 𝑥 ∈ 𝐴 𝐶))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1536   ∈ wcel 2113   ≠ wne 3019  ∀wral 3141  Vcvv 3497   ∩ 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-v 3499  df-dif 3942  df-in 3946  df-nul 4295  df-iin 4925

This theorem is referenced by:  iinin1  5004  iniin2  41398