Theorem intsaluni 47084

Description: The union of an arbitrary intersection of sigma-algebras on the same set 𝑋, is 𝑋. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Hypotheses

Ref	Expression
intsaluni.ga	⊢ (𝜑 → 𝐺 ⊆ SAlg)
intsaluni.gn0	⊢ (𝜑 → 𝐺 ≠ ∅)
intsaluni.x	⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → ∪ 𝑠 = 𝑋)

Assertion

Ref	Expression
intsaluni	⊢ (𝜑 → ∪ ∩ 𝐺 = 𝑋)

Distinct variable groups:   𝐺,𝑠   𝑋,𝑠   𝜑,𝑠

Proof of Theorem intsaluni

Dummy variables 𝑡 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1947	. 2 ⊢ Ⅎ𝑠𝜑
2		nfv 1947	. 2 ⊢ Ⅎ𝑠∪ ∩ 𝐺 = 𝑋
3		intsaluni.gn0	. . 3 ⊢ (𝜑 → 𝐺 ≠ ∅)
4		n0 4310	. . . 4 ⊢ (𝐺 ≠ ∅ ↔ ∃𝑠 𝑠 ∈ 𝐺)
5	4	biimpi 219	. . 3 ⊢ (𝐺 ≠ ∅ → ∃𝑠 𝑠 ∈ 𝐺)
6	3, 5	syl 18	. 2 ⊢ (𝜑 → ∃𝑠 𝑠 ∈ 𝐺)
7		intss1 4933	. . . . . . 7 ⊢ (𝑠 ∈ 𝐺 → ∩ 𝐺 ⊆ 𝑠)
8	7	unissd 4887	. . . . . 6 ⊢ (𝑠 ∈ 𝐺 → ∪ ∩ 𝐺 ⊆ ∪ 𝑠)
9	8	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → ∪ ∩ 𝐺 ⊆ ∪ 𝑠)
10		intsaluni.x	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → ∪ 𝑠 = 𝑋)
11	9, 10	sseqtrd 3976	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → ∪ ∩ 𝐺 ⊆ 𝑋)
12	10	adantr 486	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑡 ∈ 𝐺) → ∪ 𝑠 = 𝑋)
13		eleq1w 2849	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 = 𝑡 → (𝑠 ∈ 𝐺 ↔ 𝑡 ∈ 𝐺))
14	13	anbi2d 642	. . . . . . . . . . . . . . 15 ⊢ (𝑠 = 𝑡 → ((𝜑 ∧ 𝑠 ∈ 𝐺) ↔ (𝜑 ∧ 𝑡 ∈ 𝐺)))
15		unieq 4888	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 = 𝑡 → ∪ 𝑠 = ∪ 𝑡)
16	15	eqeq1d 2768	. . . . . . . . . . . . . . 15 ⊢ (𝑠 = 𝑡 → (∪ 𝑠 = 𝑋 ↔ ∪ 𝑡 = 𝑋))
17	14, 16	imbi12d 347	. . . . . . . . . . . . . 14 ⊢ (𝑠 = 𝑡 → (((𝜑 ∧ 𝑠 ∈ 𝐺) → ∪ 𝑠 = 𝑋) ↔ ((𝜑 ∧ 𝑡 ∈ 𝐺) → ∪ 𝑡 = 𝑋)))
18	17, 10	chvarvv 2022	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐺) → ∪ 𝑡 = 𝑋)
19	18	eqcomd 2772	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐺) → 𝑋 = ∪ 𝑡)
20	19	adantlr 728	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑡 ∈ 𝐺) → 𝑋 = ∪ 𝑡)
21	12, 20	eqtrd 2801	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑡 ∈ 𝐺) → ∪ 𝑠 = ∪ 𝑡)
22		intsaluni.ga	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐺 ⊆ SAlg)
23	22	sselda 3940	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐺) → 𝑡 ∈ SAlg)
24		saluni 47080	. . . . . . . . . . . 12 ⊢ (𝑡 ∈ SAlg → ∪ 𝑡 ∈ 𝑡)
25	23, 24	syl 18	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐺) → ∪ 𝑡 ∈ 𝑡)
26	25	adantlr 728	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑡 ∈ 𝐺) → ∪ 𝑡 ∈ 𝑡)
27	21, 26	eqeltrd 2866	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑡 ∈ 𝐺) → ∪ 𝑠 ∈ 𝑡)
28	27	ralrimiva 3160	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → ∀𝑡 ∈ 𝐺 ∪ 𝑠 ∈ 𝑡)
29		uniexg 7751	. . . . . . . . . 10 ⊢ (𝑠 ∈ 𝐺 → ∪ 𝑠 ∈ V)
30	29	adantl 487	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → ∪ 𝑠 ∈ V)
31		elintg 4925	. . . . . . . . 9 ⊢ (∪ 𝑠 ∈ V → (∪ 𝑠 ∈ ∩ 𝐺 ↔ ∀𝑡 ∈ 𝐺 ∪ 𝑠 ∈ 𝑡))
32	30, 31	syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → (∪ 𝑠 ∈ ∩ 𝐺 ↔ ∀𝑡 ∈ 𝐺 ∪ 𝑠 ∈ 𝑡))
33	28, 32	mpbird 260	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → ∪ 𝑠 ∈ ∩ 𝐺)
34	33	adantr 486	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑥 ∈ 𝑋) → ∪ 𝑠 ∈ ∩ 𝐺)
35		simpr 490	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
36	10	eqcomd 2772	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → 𝑋 = ∪ 𝑠)
37	36	adantr 486	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑥 ∈ 𝑋) → 𝑋 = ∪ 𝑠)
38	35, 37	eleqtrd 2868	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ ∪ 𝑠)
39		eleq2 2855	. . . . . . 7 ⊢ (𝑦 = ∪ 𝑠 → (𝑥 ∈ 𝑦 ↔ 𝑥 ∈ ∪ 𝑠))
40	39	rspcev 3584	. . . . . 6 ⊢ ((∪ 𝑠 ∈ ∩ 𝐺 ∧ 𝑥 ∈ ∪ 𝑠) → ∃𝑦 ∈ ∩ 𝐺𝑥 ∈ 𝑦)
41	34, 38, 40	syl2anc 596	. . . . 5 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑥 ∈ 𝑋) → ∃𝑦 ∈ ∩ 𝐺𝑥 ∈ 𝑦)
42		eluni2 4881	. . . . 5 ⊢ (𝑥 ∈ ∪ ∩ 𝐺 ↔ ∃𝑦 ∈ ∩ 𝐺𝑥 ∈ 𝑦)
43	41, 42	sylibr 237	. . . 4 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ ∪ ∩ 𝐺)
44	11, 43	eqelssd 3961	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → ∪ ∩ 𝐺 = 𝑋)
45	44	ex 418	. 2 ⊢ (𝜑 → (𝑠 ∈ 𝐺 → ∪ ∩ 𝐺 = 𝑋))
46	1, 2, 6, 45	exlimimdd 2258	1 ⊢ (𝜑 → ∪ ∩ 𝐺 = 𝑋)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2146   ≠ wne 2961  ∀wral 3082  ∃wrex 3092  Vcvv 3458   ⊆ wss 3908  ∅c0 4289  ∪ cuni 4877  ∩ cint 4917  SAlgcsalg 47063

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-un 7745

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-ss 3925  df-nul 4290  df-pw 4569  df-uni 4878  df-int 4918  df-salg 47064

This theorem is used by:  intsal  47085  salgenuni  47092