Theorem iunxdif3 5047

Description: An indexed union where some terms are the empty set. See iunxdif2 5006. (Contributed by Thierry Arnoux, 4-May-2020.)

Hypothesis

Ref	Expression
iunxdif3.1	⊢ Ⅎ𝑥𝐸

Assertion

Ref	Expression
iunxdif3	⊢ (∀𝑥 ∈ 𝐸 𝐵 = ∅ → ∪ 𝑥 ∈ (𝐴 ∖ 𝐸)𝐵 = ∪ 𝑥 ∈ 𝐴 𝐵)

Distinct variable group:   𝑥,𝐴

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

Proof of Theorem iunxdif3

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		inss2 4189	. . . . . 6 ⊢ (𝐴 ∩ 𝐸) ⊆ 𝐸
2		nfcv 2896	. . . . . . . . . 10 ⊢ Ⅎ𝑥𝐴
3		iunxdif3.1	. . . . . . . . . 10 ⊢ Ⅎ𝑥𝐸
4	2, 3	nfin 4175	. . . . . . . . 9 ⊢ Ⅎ𝑥(𝐴 ∩ 𝐸)
5	4, 3	ssrexf 3998	. . . . . . . 8 ⊢ ((𝐴 ∩ 𝐸) ⊆ 𝐸 → (∃𝑥 ∈ (𝐴 ∩ 𝐸)𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐸 𝑦 ∈ 𝐵))
6		eliun 4947	. . . . . . . 8 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ (𝐴 ∩ 𝐸)𝐵 ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐸)𝑦 ∈ 𝐵)
7		eliun 4947	. . . . . . . 8 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐸 𝐵 ↔ ∃𝑥 ∈ 𝐸 𝑦 ∈ 𝐵)
8	5, 6, 7	3imtr4g 296	. . . . . . 7 ⊢ ((𝐴 ∩ 𝐸) ⊆ 𝐸 → (𝑦 ∈ ∪ 𝑥 ∈ (𝐴 ∩ 𝐸)𝐵 → 𝑦 ∈ ∪ 𝑥 ∈ 𝐸 𝐵))
9	8	ssrdv 3937	. . . . . 6 ⊢ ((𝐴 ∩ 𝐸) ⊆ 𝐸 → ∪ 𝑥 ∈ (𝐴 ∩ 𝐸)𝐵 ⊆ ∪ 𝑥 ∈ 𝐸 𝐵)
10	1, 9	ax-mp 5	. . . . 5 ⊢ ∪ 𝑥 ∈ (𝐴 ∩ 𝐸)𝐵 ⊆ ∪ 𝑥 ∈ 𝐸 𝐵
11		iuneq2 4963	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐸 𝐵 = ∅ → ∪ 𝑥 ∈ 𝐸 𝐵 = ∪ 𝑥 ∈ 𝐸 ∅)
12		iun0 5014	. . . . . 6 ⊢ ∪ 𝑥 ∈ 𝐸 ∅ = ∅
13	11, 12	eqtrdi 2784	. . . . 5 ⊢ (∀𝑥 ∈ 𝐸 𝐵 = ∅ → ∪ 𝑥 ∈ 𝐸 𝐵 = ∅)
14	10, 13	sseqtrid 3974	. . . 4 ⊢ (∀𝑥 ∈ 𝐸 𝐵 = ∅ → ∪ 𝑥 ∈ (𝐴 ∩ 𝐸)𝐵 ⊆ ∅)
15		ss0 4353	. . . 4 ⊢ (∪ 𝑥 ∈ (𝐴 ∩ 𝐸)𝐵 ⊆ ∅ → ∪ 𝑥 ∈ (𝐴 ∩ 𝐸)𝐵 = ∅)
16	14, 15	syl 17	. . 3 ⊢ (∀𝑥 ∈ 𝐸 𝐵 = ∅ → ∪ 𝑥 ∈ (𝐴 ∩ 𝐸)𝐵 = ∅)
17	16	uneq1d 4118	. 2 ⊢ (∀𝑥 ∈ 𝐸 𝐵 = ∅ → (∪ 𝑥 ∈ (𝐴 ∩ 𝐸)𝐵 ∪ ∪ 𝑥 ∈ (𝐴 ∖ 𝐸)𝐵) = (∅ ∪ ∪ 𝑥 ∈ (𝐴 ∖ 𝐸)𝐵))
18		iunxun 5046	. . . 4 ⊢ ∪ 𝑥 ∈ ((𝐴 ∩ 𝐸) ∪ (𝐴 ∖ 𝐸))𝐵 = (∪ 𝑥 ∈ (𝐴 ∩ 𝐸)𝐵 ∪ ∪ 𝑥 ∈ (𝐴 ∖ 𝐸)𝐵)
19		inundif 4430	. . . . 5 ⊢ ((𝐴 ∩ 𝐸) ∪ (𝐴 ∖ 𝐸)) = 𝐴
20	19	nfth 1802	. . . . . 6 ⊢ Ⅎ𝑥((𝐴 ∩ 𝐸) ∪ (𝐴 ∖ 𝐸)) = 𝐴
21	2, 3	nfdif 4080	. . . . . . 7 ⊢ Ⅎ𝑥(𝐴 ∖ 𝐸)
22	4, 21	nfun 4121	. . . . . 6 ⊢ Ⅎ𝑥((𝐴 ∩ 𝐸) ∪ (𝐴 ∖ 𝐸))
23		id 22	. . . . . 6 ⊢ (((𝐴 ∩ 𝐸) ∪ (𝐴 ∖ 𝐸)) = 𝐴 → ((𝐴 ∩ 𝐸) ∪ (𝐴 ∖ 𝐸)) = 𝐴)
24		eqidd 2734	. . . . . 6 ⊢ (((𝐴 ∩ 𝐸) ∪ (𝐴 ∖ 𝐸)) = 𝐴 → 𝐵 = 𝐵)
25	20, 22, 2, 23, 24	iuneq12df 4970	. . . . 5 ⊢ (((𝐴 ∩ 𝐸) ∪ (𝐴 ∖ 𝐸)) = 𝐴 → ∪ 𝑥 ∈ ((𝐴 ∩ 𝐸) ∪ (𝐴 ∖ 𝐸))𝐵 = ∪ 𝑥 ∈ 𝐴 𝐵)
26	19, 25	ax-mp 5	. . . 4 ⊢ ∪ 𝑥 ∈ ((𝐴 ∩ 𝐸) ∪ (𝐴 ∖ 𝐸))𝐵 = ∪ 𝑥 ∈ 𝐴 𝐵
27	18, 26	eqtr3i 2758	. . 3 ⊢ (∪ 𝑥 ∈ (𝐴 ∩ 𝐸)𝐵 ∪ ∪ 𝑥 ∈ (𝐴 ∖ 𝐸)𝐵) = ∪ 𝑥 ∈ 𝐴 𝐵
28	27	a1i 11	. 2 ⊢ (∀𝑥 ∈ 𝐸 𝐵 = ∅ → (∪ 𝑥 ∈ (𝐴 ∩ 𝐸)𝐵 ∪ ∪ 𝑥 ∈ (𝐴 ∖ 𝐸)𝐵) = ∪ 𝑥 ∈ 𝐴 𝐵)
29		uncom 4109	. . . 4 ⊢ (∅ ∪ ∪ 𝑥 ∈ (𝐴 ∖ 𝐸)𝐵) = (∪ 𝑥 ∈ (𝐴 ∖ 𝐸)𝐵 ∪ ∅)
30		un0 4345	. . . 4 ⊢ (∪ 𝑥 ∈ (𝐴 ∖ 𝐸)𝐵 ∪ ∅) = ∪ 𝑥 ∈ (𝐴 ∖ 𝐸)𝐵
31	29, 30	eqtri 2756	. . 3 ⊢ (∅ ∪ ∪ 𝑥 ∈ (𝐴 ∖ 𝐸)𝐵) = ∪ 𝑥 ∈ (𝐴 ∖ 𝐸)𝐵
32	31	a1i 11	. 2 ⊢ (∀𝑥 ∈ 𝐸 𝐵 = ∅ → (∅ ∪ ∪ 𝑥 ∈ (𝐴 ∖ 𝐸)𝐵) = ∪ 𝑥 ∈ (𝐴 ∖ 𝐸)𝐵)
33	17, 28, 32	3eqtr3rd 2777	1 ⊢ (∀𝑥 ∈ 𝐸 𝐵 = ∅ → ∪ 𝑥 ∈ (𝐴 ∖ 𝐸)𝐵 = ∪ 𝑥 ∈ 𝐴 𝐵)

Syntax hints:   → wi 4   = wceq 1541   ∈ wcel 2113  Ⅎwnfc 2881  ∀wral 3049  ∃wrex 3058   ∖ cdif 3896   ∪ cun 3897   ∩ cin 3898   ⊆ wss 3899  ∅c0 4284  ∪ ciun 4943

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2883  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4285  df-iun 4945

This theorem is referenced by:  aciunf1  32656  suppovss  32673  ovnsubadd2lem  46757