Theorem iundif2 5097

Description: Indexed union of class difference. Generalization of half of theorem "De Morgan's laws" in [Enderton] p. 31. Use intiin 5082 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 3986	. . . . 5 ⊢ (𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶))
2	1	rexbii 3100	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶) ↔ ∃𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶))
3		r19.42v 3197	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶))
4		rexnal 3106	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶 ↔ ¬ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)
5		eliin 5020	. . . . . . 7 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶))
6	5	elv 3493	. . . . . 6 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)
7	4, 6	xchbinxr 335	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶 ↔ ¬ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶)
8	7	anbi2i 622	. . . 4 ⊢ ((𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶))
9	2, 3, 8	3bitri 297	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶))
10		eliun 5019	. . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶))
11		eldif 3986	. . 3 ⊢ (𝑦 ∈ (𝐵 ∖ ∩ 𝑥 ∈ 𝐴 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶))
12	9, 10, 11	3bitr4i 303	. 2 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ 𝑦 ∈ (𝐵 ∖ ∩ 𝑥 ∈ 𝐴 𝐶))
13	12	eqriv 2737	1 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) = (𝐵 ∖ ∩ 𝑥 ∈ 𝐴 𝐶)

Syntax hints:  ¬ wn 3   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2108  ∀wral 3067  ∃wrex 3076  Vcvv 3488   ∖ cdif 3973  ∪ ciun 5015  ∩ ciin 5016

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-rex 3077  df-v 3490  df-dif 3979  df-iun 5017  df-iin 5018

This theorem is referenced by:  iuncld  23074  pnrmopn  23372  alexsublem  24073  bcth3  25384  iundifdifd  32584  iundifdif  32585