Theorem iindif1 5040

Description: Indexed intersection of class difference with the subtrahend held constant. (Contributed by Thierry Arnoux, 21-Aug-2023.)

Assertion

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

Distinct variable groups:   𝑥,𝐴   𝑥,𝐶

Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem iindif1

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		r19.27zv 4470	. . . 4 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ (∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶)))
2		eldif 4052	. . . . 5 ⊢ (𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶))
3	2	ralbii 3112	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶) ↔ ∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶))
4		eliin 4961	. . . . . 6 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵))
5	4	elv 3459	. . . . 5 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)
6	5	anbi1i 636	. . . 4 ⊢ ((𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ (∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶))
7	1, 3, 6	3bitr4g 317	. . 3 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ∧ ¬ 𝑦 ∈ 𝐶)))
8		eliin 4961	. . . 4 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶)))
9	8	elv 3459	. . 3 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶))
10		eldif 4052	. . 3 ⊢ (𝑦 ∈ (∩ 𝑥 ∈ 𝐴 𝐵 ∖ 𝐶) ↔ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ∧ ¬ 𝑦 ∈ 𝐶))
11	7, 9, 10	3bitr4g 317	. 2 ⊢ (𝐴 ≠ ∅ → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ 𝑦 ∈ (∩ 𝑥 ∈ 𝐴 𝐵 ∖ 𝐶)))
12	11	eqrdv 2761	1 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) = (∩ 𝑥 ∈ 𝐴 𝐵 ∖ 𝐶))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  Vcvv 3454   ∖ cdif 4048  ∅c0 4281  ∩ ciin 4957

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-12 2216  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-v 3456  df-dif 4050  df-nul 4282  df-iin 4959

This theorem is used by:  subdrgint  21111