Theorem iinin2 4963

Description: Indexed intersection of intersection. Generalization of half of theorem "Distributive laws" in [Enderton] p. 30. Use intiin 4946 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 4404	. . . 4 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)))
2		elin 3897	. . . . 5 ⊢ (𝑦 ∈ (𝐵 ∩ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))
3	2	ralbii 3133	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∩ 𝐶) ↔ ∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))
4		eliin 4886	. . . . . 6 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶))
5	4	elv 3446	. . . . 5 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)
6	5	anbi2i 625	. . . 4 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶))
7	1, 3, 6	3bitr4g 317	. . 3 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∩ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶)))
8		eliin 4886	. . . 4 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∩ 𝐶)))
9	8	elv 3446	. . 3 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∩ 𝐶))
10		elin 3897	. . 3 ⊢ (𝑦 ∈ (𝐵 ∩ ∩ 𝑥 ∈ 𝐴 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶))
11	7, 9, 10	3bitr4g 317	. 2 ⊢ (𝐴 ≠ ∅ → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) ↔ 𝑦 ∈ (𝐵 ∩ ∩ 𝑥 ∈ 𝐴 𝐶)))
12	11	eqrdv 2796	1 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∩ 𝐶) = (𝐵 ∩ ∩ 𝑥 ∈ 𝐴 𝐶))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111   ≠ wne 2987  ∀wral 3106  Vcvv 3441   ∩ cin 3880  ∅c0 4243  ∩ ciin 4882

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-v 3443  df-dif 3884  df-in 3888  df-nul 4244  df-iin 4884

This theorem is referenced by:  iinin1  4964  iniin2  41761