meaiunincf

Description: Measures are continuous from below (bounded case): if E is a sequence of nondecreasing measurable sets (with bounded measure) then the measure of the union is the limit of the measures. This is Proposition 112C (e) of Fremlin1 p. 16. (Contributed by Glauco Siliprandi, 13-Feb-2022)

	Ref	Expression
Hypotheses	meaiunincf.p	$⊢ Ⅎ n φ$
	meaiunincf.f	$⊢ \underline{Ⅎ} n E$
	meaiunincf.m	$⊢ φ \to M \in Meas$
	meaiunincf.n	$⊢ φ \to N \in ℤ$
	meaiunincf.z	$⊢ Z = ℤ_{\geq N}$
	meaiunincf.e	$⊢ φ \to E : Z ⟶ dom M$
	meaiunincf.i	$⊢ (φ \land n \in Z) \to E (n) \subseteq E (n + 1)$
	meaiunincf.x	$⊢ φ \to \exists x \in ℝ \forall n \in Z M (E (n)) \leq x$
	meaiunincf.s	$⊢ S = (n \in Z ⟼ M (E (n)))$
Assertion	meaiunincf	$⊢ φ \to S ⇝ M (⋃_{n \in Z} E (n))$

Proof

Step	Hyp	Ref	Expression
1		meaiunincf.p	$⊢ Ⅎ n φ$
2		meaiunincf.f	$⊢ \underline{Ⅎ} n E$
3		meaiunincf.m	$⊢ φ \to M \in Meas$
4		meaiunincf.n	$⊢ φ \to N \in ℤ$
5		meaiunincf.z	$⊢ Z = ℤ_{\geq N}$
6		meaiunincf.e	$⊢ φ \to E : Z ⟶ dom M$
7		meaiunincf.i	$⊢ (φ \land n \in Z) \to E (n) \subseteq E (n + 1)$
8		meaiunincf.x	$⊢ φ \to \exists x \in ℝ \forall n \in Z M (E (n)) \leq x$
9		meaiunincf.s	$⊢ S = (n \in Z ⟼ M (E (n)))$
10		nfv	$⊢ Ⅎ n k \in Z$
11	1 10	nfan	$⊢ Ⅎ n (φ \land k \in Z)$
12		nfcv	$⊢ \underline{Ⅎ} n k$
13	2 12	nffv	$⊢ \underline{Ⅎ} n E (k)$
14		nfcv	$⊢ \underline{Ⅎ} n (k + 1)$
15	2 14	nffv	$⊢ \underline{Ⅎ} n E (k + 1)$
16	13 15	nfss	$⊢ Ⅎ n E (k) \subseteq E (k + 1)$
17	11 16	nfim	$⊢ Ⅎ n ((φ \land k \in Z) \to E (k) \subseteq E (k + 1))$
18		eleq1w	$⊢ n = k \to (n \in Z \leftrightarrow k \in Z)$
19	18	anbi2d	$⊢ n = k \to ((φ \land n \in Z) \leftrightarrow (φ \land k \in Z))$
20		fveq2	$⊢ n = k \to E (n) = E (k)$
21		fvoveq1	$⊢ n = k \to E (n + 1) = E (k + 1)$
22	20 21	sseq12d	$⊢ n = k \to (E (n) \subseteq E (n + 1) \leftrightarrow E (k) \subseteq E (k + 1))$
23	19 22	imbi12d	$⊢ n = k \to (((φ \land n \in Z) \to E (n) \subseteq E (n + 1)) \leftrightarrow ((φ \land k \in Z) \to E (k) \subseteq E (k + 1)))$
24	17 23 7	chvarfv	$⊢ (φ \land k \in Z) \to E (k) \subseteq E (k + 1)$
25		breq2	$⊢ x = y \to (M (E (n)) \leq x \leftrightarrow M (E (n)) \leq y)$
26	25	ralbidv	$⊢ x = y \to (\forall n \in Z M (E (n)) \leq x \leftrightarrow \forall n \in Z M (E (n)) \leq y)$
27		nfv	$⊢ Ⅎ k M (E (n)) \leq y$
28		nfcv	$⊢ \underline{Ⅎ} n M$
29	28 13	nffv	$⊢ \underline{Ⅎ} n M (E (k))$
30		nfcv	$⊢ \underline{Ⅎ} n \leq$
31		nfcv	$⊢ \underline{Ⅎ} n y$
32	29 30 31	nfbr	$⊢ Ⅎ n M (E (k)) \leq y$
33		2fveq3	$⊢ n = k \to M (E (n)) = M (E (k))$
34	33	breq1d	$⊢ n = k \to (M (E (n)) \leq y \leftrightarrow M (E (k)) \leq y)$
35	27 32 34	cbvralw	$⊢ \forall n \in Z M (E (n)) \leq y \leftrightarrow \forall k \in Z M (E (k)) \leq y$
36	35	a1i	$⊢ x = y \to (\forall n \in Z M (E (n)) \leq y \leftrightarrow \forall k \in Z M (E (k)) \leq y)$
37	26 36	bitrd	$⊢ x = y \to (\forall n \in Z M (E (n)) \leq x \leftrightarrow \forall k \in Z M (E (k)) \leq y)$
38	37	cbvrexvw	$⊢ \exists x \in ℝ \forall n \in Z M (E (n)) \leq x \leftrightarrow \exists y \in ℝ \forall k \in Z M (E (k)) \leq y$
39	8 38	sylib	$⊢ φ \to \exists y \in ℝ \forall k \in Z M (E (k)) \leq y$
40		nfcv	$⊢ \underline{Ⅎ} k M (E (n))$
41	40 29 33	cbvmpt	$⊢ (n \in Z ⟼ M (E (n))) = (k \in Z ⟼ M (E (k)))$
42	9 41	eqtri	$⊢ S = (k \in Z ⟼ M (E (k)))$
43	3 4 5 6 24 39 42	meaiuninc	$⊢ φ \to S ⇝ M (⋃_{k \in Z} E (k))$
44		nfcv	$⊢ \underline{Ⅎ} k E (n)$
45		fveq2	$⊢ k = n \to E (k) = E (n)$
46	13 44 45	cbviun	$⊢ ⋃_{k \in Z} E (k) = ⋃_{n \in Z} E (n)$
47	46	fveq2i	$⊢ M (⋃_{k \in Z} E (k)) = M (⋃_{n \in Z} E (n))$
48	43 47	breqtrdi	$⊢ φ \to S ⇝ M (⋃_{n \in Z} E (n))$

Metamath Proof Explorer

Theorem meaiunincf

Proof