Theorem inuni 4141

Description: The intersection of a union ∪ 𝐴 with a class 𝐵 is equal to the union of the intersections of each element of 𝐴 with 𝐵. (Contributed by FL, 24-Mar-2007.)

Assertion

Ref	Expression
inuni	⊢ (∪ 𝐴 ∩ 𝐵) = ∪ {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = (𝑦 ∩ 𝐵)}

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦

Proof of Theorem inuni

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eluni2 3800	. . . . 5 ⊢ (𝑧 ∈ ∪ 𝐴 ↔ ∃𝑦 ∈ 𝐴 𝑧 ∈ 𝑦)
2	1	anbi1i 455	. . . 4 ⊢ ((𝑧 ∈ ∪ 𝐴 ∧ 𝑧 ∈ 𝐵) ↔ (∃𝑦 ∈ 𝐴 𝑧 ∈ 𝑦 ∧ 𝑧 ∈ 𝐵))
3		elin 3310	. . . 4 ⊢ (𝑧 ∈ (∪ 𝐴 ∩ 𝐵) ↔ (𝑧 ∈ ∪ 𝐴 ∧ 𝑧 ∈ 𝐵))
4		ancom 264	. . . . . . . 8 ⊢ ((𝑧 ∈ 𝑥 ∧ ∃𝑦 ∈ 𝐴 𝑥 = (𝑦 ∩ 𝐵)) ↔ (∃𝑦 ∈ 𝐴 𝑥 = (𝑦 ∩ 𝐵) ∧ 𝑧 ∈ 𝑥))
5		r19.41v 2626	. . . . . . . 8 ⊢ (∃𝑦 ∈ 𝐴 (𝑥 = (𝑦 ∩ 𝐵) ∧ 𝑧 ∈ 𝑥) ↔ (∃𝑦 ∈ 𝐴 𝑥 = (𝑦 ∩ 𝐵) ∧ 𝑧 ∈ 𝑥))
6	4, 5	bitr4i 186	. . . . . . 7 ⊢ ((𝑧 ∈ 𝑥 ∧ ∃𝑦 ∈ 𝐴 𝑥 = (𝑦 ∩ 𝐵)) ↔ ∃𝑦 ∈ 𝐴 (𝑥 = (𝑦 ∩ 𝐵) ∧ 𝑧 ∈ 𝑥))
7	6	exbii 1598	. . . . . 6 ⊢ (∃𝑥(𝑧 ∈ 𝑥 ∧ ∃𝑦 ∈ 𝐴 𝑥 = (𝑦 ∩ 𝐵)) ↔ ∃𝑥∃𝑦 ∈ 𝐴 (𝑥 = (𝑦 ∩ 𝐵) ∧ 𝑧 ∈ 𝑥))
8		rexcom4 2753	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐴 ∃𝑥(𝑥 = (𝑦 ∩ 𝐵) ∧ 𝑧 ∈ 𝑥) ↔ ∃𝑥∃𝑦 ∈ 𝐴 (𝑥 = (𝑦 ∩ 𝐵) ∧ 𝑧 ∈ 𝑥))
9	7, 8	bitr4i 186	. . . . 5 ⊢ (∃𝑥(𝑧 ∈ 𝑥 ∧ ∃𝑦 ∈ 𝐴 𝑥 = (𝑦 ∩ 𝐵)) ↔ ∃𝑦 ∈ 𝐴 ∃𝑥(𝑥 = (𝑦 ∩ 𝐵) ∧ 𝑧 ∈ 𝑥))
10		vex 2733	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
11	10	inex1 4123	. . . . . . . . 9 ⊢ (𝑦 ∩ 𝐵) ∈ V
12		eleq2 2234	. . . . . . . . 9 ⊢ (𝑥 = (𝑦 ∩ 𝐵) → (𝑧 ∈ 𝑥 ↔ 𝑧 ∈ (𝑦 ∩ 𝐵)))
13	11, 12	ceqsexv 2769	. . . . . . . 8 ⊢ (∃𝑥(𝑥 = (𝑦 ∩ 𝐵) ∧ 𝑧 ∈ 𝑥) ↔ 𝑧 ∈ (𝑦 ∩ 𝐵))
14		elin 3310	. . . . . . . 8 ⊢ (𝑧 ∈ (𝑦 ∩ 𝐵) ↔ (𝑧 ∈ 𝑦 ∧ 𝑧 ∈ 𝐵))
15	13, 14	bitri 183	. . . . . . 7 ⊢ (∃𝑥(𝑥 = (𝑦 ∩ 𝐵) ∧ 𝑧 ∈ 𝑥) ↔ (𝑧 ∈ 𝑦 ∧ 𝑧 ∈ 𝐵))
16	15	rexbii 2477	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐴 ∃𝑥(𝑥 = (𝑦 ∩ 𝐵) ∧ 𝑧 ∈ 𝑥) ↔ ∃𝑦 ∈ 𝐴 (𝑧 ∈ 𝑦 ∧ 𝑧 ∈ 𝐵))
17		r19.41v 2626	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐴 (𝑧 ∈ 𝑦 ∧ 𝑧 ∈ 𝐵) ↔ (∃𝑦 ∈ 𝐴 𝑧 ∈ 𝑦 ∧ 𝑧 ∈ 𝐵))
18	16, 17	bitri 183	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 ∃𝑥(𝑥 = (𝑦 ∩ 𝐵) ∧ 𝑧 ∈ 𝑥) ↔ (∃𝑦 ∈ 𝐴 𝑧 ∈ 𝑦 ∧ 𝑧 ∈ 𝐵))
19	9, 18	bitri 183	. . . 4 ⊢ (∃𝑥(𝑧 ∈ 𝑥 ∧ ∃𝑦 ∈ 𝐴 𝑥 = (𝑦 ∩ 𝐵)) ↔ (∃𝑦 ∈ 𝐴 𝑧 ∈ 𝑦 ∧ 𝑧 ∈ 𝐵))
20	2, 3, 19	3bitr4i 211	. . 3 ⊢ (𝑧 ∈ (∪ 𝐴 ∩ 𝐵) ↔ ∃𝑥(𝑧 ∈ 𝑥 ∧ ∃𝑦 ∈ 𝐴 𝑥 = (𝑦 ∩ 𝐵)))
21		eluniab 3808	. . 3 ⊢ (𝑧 ∈ ∪ {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = (𝑦 ∩ 𝐵)} ↔ ∃𝑥(𝑧 ∈ 𝑥 ∧ ∃𝑦 ∈ 𝐴 𝑥 = (𝑦 ∩ 𝐵)))
22	20, 21	bitr4i 186	. 2 ⊢ (𝑧 ∈ (∪ 𝐴 ∩ 𝐵) ↔ 𝑧 ∈ ∪ {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = (𝑦 ∩ 𝐵)})
23	22	eqriv 2167	1 ⊢ (∪ 𝐴 ∩ 𝐵) = ∪ {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = (𝑦 ∩ 𝐵)}

Syntax hints:   ∧ wa 103   = wceq 1348  ∃wex 1485   ∈ wcel 2141  {cab 2156  ∃wrex 2449   ∩ cin 3120  ∪ cuni 3796

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152  ax-sep 4107

This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-rex 2454  df-v 2732  df-in 3127  df-uni 3797

This theorem is referenced by: (None)