Theorem intsaluni 42602

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 1909	. 2 ⊢ Ⅎ𝑠𝜑
2		nfv 1909	. 2 ⊢ Ⅎ𝑠∪ ∩ 𝐺 = 𝑋
3		intsaluni.gn0	. . 3 ⊢ (𝜑 → 𝐺 ≠ ∅)
4		n0 4308	. . . 4 ⊢ (𝐺 ≠ ∅ ↔ ∃𝑠 𝑠 ∈ 𝐺)
5	4	biimpi 218	. . 3 ⊢ (𝐺 ≠ ∅ → ∃𝑠 𝑠 ∈ 𝐺)
6	3, 5	syl 17	. 2 ⊢ (𝜑 → ∃𝑠 𝑠 ∈ 𝐺)
7		intss1 4882	. . . . . . 7 ⊢ (𝑠 ∈ 𝐺 → ∩ 𝐺 ⊆ 𝑠)
8		uniss 4851	. . . . . . 7 ⊢ (∩ 𝐺 ⊆ 𝑠 → ∪ ∩ 𝐺 ⊆ ∪ 𝑠)
9	7, 8	syl 17	. . . . . 6 ⊢ (𝑠 ∈ 𝐺 → ∪ ∩ 𝐺 ⊆ ∪ 𝑠)
10	9	adantl 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → ∪ ∩ 𝐺 ⊆ ∪ 𝑠)
11		intsaluni.x	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → ∪ 𝑠 = 𝑋)
12	10, 11	sseqtrd 4005	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → ∪ ∩ 𝐺 ⊆ 𝑋)
13	11	adantr 483	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑡 ∈ 𝐺) → ∪ 𝑠 = 𝑋)
14		eleq1w 2893	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 = 𝑡 → (𝑠 ∈ 𝐺 ↔ 𝑡 ∈ 𝐺))
15	14	anbi2d 630	. . . . . . . . . . . . . . 15 ⊢ (𝑠 = 𝑡 → ((𝜑 ∧ 𝑠 ∈ 𝐺) ↔ (𝜑 ∧ 𝑡 ∈ 𝐺)))
16		unieq 4838	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 = 𝑡 → ∪ 𝑠 = ∪ 𝑡)
17	16	eqeq1d 2821	. . . . . . . . . . . . . . 15 ⊢ (𝑠 = 𝑡 → (∪ 𝑠 = 𝑋 ↔ ∪ 𝑡 = 𝑋))
18	15, 17	imbi12d 347	. . . . . . . . . . . . . 14 ⊢ (𝑠 = 𝑡 → (((𝜑 ∧ 𝑠 ∈ 𝐺) → ∪ 𝑠 = 𝑋) ↔ ((𝜑 ∧ 𝑡 ∈ 𝐺) → ∪ 𝑡 = 𝑋)))
19	18, 11	chvarvv 1999	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐺) → ∪ 𝑡 = 𝑋)
20	19	eqcomd 2825	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐺) → 𝑋 = ∪ 𝑡)
21	20	adantlr 713	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑡 ∈ 𝐺) → 𝑋 = ∪ 𝑡)
22	13, 21	eqtrd 2854	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑡 ∈ 𝐺) → ∪ 𝑠 = ∪ 𝑡)
23		intsaluni.ga	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐺 ⊆ SAlg)
24	23	sselda 3965	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐺) → 𝑡 ∈ SAlg)
25		saluni 42599	. . . . . . . . . . . 12 ⊢ (𝑡 ∈ SAlg → ∪ 𝑡 ∈ 𝑡)
26	24, 25	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐺) → ∪ 𝑡 ∈ 𝑡)
27	26	adantlr 713	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑡 ∈ 𝐺) → ∪ 𝑡 ∈ 𝑡)
28	22, 27	eqeltrd 2911	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑡 ∈ 𝐺) → ∪ 𝑠 ∈ 𝑡)
29	28	ralrimiva 3180	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → ∀𝑡 ∈ 𝐺 ∪ 𝑠 ∈ 𝑡)
30		uniexg 7458	. . . . . . . . . 10 ⊢ (𝑠 ∈ 𝐺 → ∪ 𝑠 ∈ V)
31	30	adantl 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → ∪ 𝑠 ∈ V)
32		elintg 4875	. . . . . . . . 9 ⊢ (∪ 𝑠 ∈ V → (∪ 𝑠 ∈ ∩ 𝐺 ↔ ∀𝑡 ∈ 𝐺 ∪ 𝑠 ∈ 𝑡))
33	31, 32	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → (∪ 𝑠 ∈ ∩ 𝐺 ↔ ∀𝑡 ∈ 𝐺 ∪ 𝑠 ∈ 𝑡))
34	29, 33	mpbird 259	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → ∪ 𝑠 ∈ ∩ 𝐺)
35	34	adantr 483	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑥 ∈ 𝑋) → ∪ 𝑠 ∈ ∩ 𝐺)
36		simpr 487	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
37	11	eqcomd 2825	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → 𝑋 = ∪ 𝑠)
38	37	adantr 483	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑥 ∈ 𝑋) → 𝑋 = ∪ 𝑠)
39	36, 38	eleqtrd 2913	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ ∪ 𝑠)
40		eleq2 2899	. . . . . . 7 ⊢ (𝑦 = ∪ 𝑠 → (𝑥 ∈ 𝑦 ↔ 𝑥 ∈ ∪ 𝑠))
41	40	rspcev 3621	. . . . . 6 ⊢ ((∪ 𝑠 ∈ ∩ 𝐺 ∧ 𝑥 ∈ ∪ 𝑠) → ∃𝑦 ∈ ∩ 𝐺𝑥 ∈ 𝑦)
42	35, 39, 41	syl2anc 586	. . . . 5 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑥 ∈ 𝑋) → ∃𝑦 ∈ ∩ 𝐺𝑥 ∈ 𝑦)
43		eluni2 4834	. . . . 5 ⊢ (𝑥 ∈ ∪ ∩ 𝐺 ↔ ∃𝑦 ∈ ∩ 𝐺𝑥 ∈ 𝑦)
44	42, 43	sylibr 236	. . . 4 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐺) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ ∪ ∩ 𝐺)
45	12, 44	eqelssd 3986	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐺) → ∪ ∩ 𝐺 = 𝑋)
46	45	ex 415	. 2 ⊢ (𝜑 → (𝑠 ∈ 𝐺 → ∪ ∩ 𝐺 = 𝑋))
47	1, 2, 6, 46	exlimimdd 2212	1 ⊢ (𝜑 → ∪ ∩ 𝐺 = 𝑋)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1531  ∃wex 1774   ∈ wcel 2108   ≠ wne 3014  ∀wral 3136  ∃wrex 3137  Vcvv 3493   ⊆ wss 3934  ∅c0 4289  ∪ cuni 4830  ∩ cint 4867  SAlgcsalg 42583

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-sep 5194  ax-un 7453

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-ral 3141  df-rex 3142  df-rab 3145  df-v 3495  df-dif 3937  df-in 3941  df-ss 3950  df-nul 4290  df-pw 4539  df-uni 4831  df-int 4868  df-salg 42584

This theorem is referenced by:  intsal  42603  salgenuni  42610