Theorem iundif2 5035

Description: Indexed union of class difference. Generalization of half of theorem "De Morgan's laws" in [Enderton] p. 31. Use intiin 5021 to recover Enderton's theorem. (Contributed by NM, 19-Aug-2004.)

Assertion

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

Distinct variable group:   𝑥,𝐵

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

Proof of Theorem iundif2

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eldif 4052	. . . . 5 ⊢ (𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶))
2	1	rexbii 3113	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶) ↔ ∃𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶))
3		r19.42v 3198	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶))
4		rexnal 3118	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶 ↔ ¬ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)
5		eliin 4959	. . . . . . 7 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶))
6	5	elv 3459	. . . . . 6 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)
7	4, 6	xchbinxr 338	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶 ↔ ¬ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶)
8	7	anbi2i 635	. . . 4 ⊢ ((𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶))
9	2, 3, 8	3bitri 300	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶))
10		eliun 4958	. . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶))
11		eldif 4052	. . 3 ⊢ (𝑦 ∈ (𝐵 ∖ ∩ 𝑥 ∈ 𝐴 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶))
12	9, 10, 11	3bitr4i 306	. 2 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ 𝑦 ∈ (𝐵 ∖ ∩ 𝑥 ∈ 𝐴 𝐶))
13	12	eqriv 2760	1 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) = (𝐵 ∖ ∩ 𝑥 ∈ 𝐴 𝐶)

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ∖ cdif 4048  ∪ ciun 4954  ∩ ciin 4955

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-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-v 3456  df-dif 4050  df-iun 4956  df-iin 4957

This theorem is used by:  iuncld  23390  pnrmopn  23688  alexsublem  24390  bcth3  25679  iundifdifd  33225  iundifdif  33226