Theorem iundif1 38659

Description: Indexed union of class difference with the subtrahend held constant. (Contributed by Brendan Leahy, 6-Aug-2018.)

Assertion

Ref	Expression
iundif1	⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) = (∪ 𝑥 ∈ 𝐴 𝐵 ∖ 𝐶)

Distinct variable group:   𝑥,𝐶

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem iundif1

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		r19.41v 3192	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶))
2		eldif 4048	. . . . 5 ⊢ (𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶))
3	2	rexbii 3109	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶) ↔ ∃𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶))
4		eliun 4954	. . . . 5 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)
5	4	anbi1i 636	. . . 4 ⊢ ((𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶))
6	1, 3, 5	3bitr4i 306	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ∧ ¬ 𝑦 ∈ 𝐶))
7		eliun 4954	. . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶))
8		eldif 4048	. . 3 ⊢ (𝑦 ∈ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ 𝐶) ↔ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ∧ ¬ 𝑦 ∈ 𝐶))
9	6, 7, 8	3bitr4i 306	. 2 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ 𝑦 ∈ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ 𝐶))
10	9	eqriv 2757	1 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) = (∪ 𝑥 ∈ 𝐴 𝐵 ∖ 𝐶)

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∃wrex 3086   ∖ cdif 4044  ∪ ciun 4950

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rex 3087  df-v 3452  df-dif 4046  df-iun 4952

This theorem is used by: (None)