meaiuninc3v - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > meaiuninc3v		Structured version Visualization version GIF version

Theorem meaiuninc3v 46482

Description: Measures are continuous from below: if 𝐸 is a sequence of nondecreasing measurable sets (with bounded measure) then the measure of the union is the limit of the measures. This is the general case of Proposition 112C (e) of [Fremlin1] p. 16 . This theorem generalizes meaiuninc 46479 and meaiuninc2 46480 where the sequence is required to be bounded. (Contributed by Glauco Siliprandi, 13-Feb-2022.)

**Hypotheses**
Ref	Expression
meaiuninc3v.m	⊢ (𝜑 → 𝑀 ∈ Meas)
meaiuninc3v.n	⊢ (𝜑 → 𝑁 ∈ ℤ)
meaiuninc3v.z	⊢ 𝑍 = (ℤ_≥‘𝑁)
meaiuninc3v.e	⊢ (𝜑 → 𝐸:𝑍⟶dom 𝑀)
meaiuninc3v.i	⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐸‘𝑛) ⊆ (𝐸‘(𝑛 + 1)))
meaiuninc3v.s	⊢ 𝑆 = (𝑛 ∈ 𝑍 ↦ (𝑀‘(𝐸‘𝑛)))

**Assertion**
Ref	Expression
meaiuninc3v	⊢ (𝜑 → 𝑆~~>*(𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)))

Distinct variable groups: 𝑛,𝐸 𝑛,𝑀 𝑛,𝑍 𝜑,𝑛 Allowed substitution hints: 𝑆(𝑛) 𝑁(𝑛)

Proof of Theorem meaiuninc3v Dummy variables 𝑗 𝑘 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		meaiuninc3v.n	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℤ)
2	1	adantr 480	. . 3 ⊢ ((𝜑 ∧ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥) → 𝑁 ∈ ℤ)
3		meaiuninc3v.z	. . 3 ⊢ 𝑍 = (ℤ_≥‘𝑁)
4		meaiuninc3v.m	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ Meas)
5	4	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑀 ∈ Meas)
6		eqid 2729	. . . . . 6 ⊢ dom 𝑀 = dom 𝑀
7		meaiuninc3v.e	. . . . . . 7 ⊢ (𝜑 → 𝐸:𝑍⟶dom 𝑀)
8	7	ffvelcdmda 7056	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐸‘𝑛) ∈ dom 𝑀)
9	5, 6, 8	meaxrcl 46459	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑀‘(𝐸‘𝑛)) ∈ ℝ^*)
10		meaiuninc3v.s	. . . . 5 ⊢ 𝑆 = (𝑛 ∈ 𝑍 ↦ (𝑀‘(𝐸‘𝑛)))
11	9, 10	fmptd 7086	. . . 4 ⊢ (𝜑 → 𝑆:𝑍⟶ℝ^*)
12	11	adantr 480	. . 3 ⊢ ((𝜑 ∧ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥) → 𝑆:𝑍⟶ℝ^*)
13		nfv 1914	. . . . 5 ⊢ Ⅎ𝑛𝜑
14		nfcv 2891	. . . . . 6 ⊢ Ⅎ𝑛ℝ
15		nfra1 3261	. . . . . 6 ⊢ Ⅎ𝑛∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥
16	14, 15	nfrexw 3287	. . . . 5 ⊢ Ⅎ𝑛∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥
17	13, 16	nfan 1899	. . . 4 ⊢ Ⅎ𝑛(𝜑 ∧ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥)
18		nfcv 2891	. . . 4 ⊢ Ⅎ𝑛𝐸
19	4	adantr 480	. . . 4 ⊢ ((𝜑 ∧ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥) → 𝑀 ∈ Meas)
20	7	adantr 480	. . . 4 ⊢ ((𝜑 ∧ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥) → 𝐸:𝑍⟶dom 𝑀)
21		meaiuninc3v.i	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐸‘𝑛) ⊆ (𝐸‘(𝑛 + 1)))
22	21	adantlr 715	. . . 4 ⊢ (((𝜑 ∧ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥) ∧ 𝑛 ∈ 𝑍) → (𝐸‘𝑛) ⊆ (𝐸‘(𝑛 + 1)))
23		simpr 484	. . . 4 ⊢ ((𝜑 ∧ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥) → ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥)
24	17, 18, 19, 2, 3, 20, 22, 23, 10	meaiunincf 46481	. . 3 ⊢ ((𝜑 ∧ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥) → 𝑆 ⇝ (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)))
25	2, 3, 12, 24	climxlim2 45844	. 2 ⊢ ((𝜑 ∧ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥) → 𝑆~~>*(𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)))
26		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ ¬ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥) → ¬ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥)
27		2fveq3 6863	. . . . . . . . . . . 12 ⊢ (𝑗 = 𝑛 → (𝑀‘(𝐸‘𝑗)) = (𝑀‘(𝐸‘𝑛)))
28	27	breq2d 5119	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑛 → (𝑥 < (𝑀‘(𝐸‘𝑗)) ↔ 𝑥 < (𝑀‘(𝐸‘𝑛))))
29	28	cbvrexvw 3216	. . . . . . . . . 10 ⊢ (∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)) ↔ ∃𝑛 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑛)))
30	29	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)) ↔ ∃𝑛 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑛))))
31		rexr 11220	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ^*)
32	31	ad2antlr 727	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ ℝ^*)
33	9	adantlr 715	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑛 ∈ 𝑍) → (𝑀‘(𝐸‘𝑛)) ∈ ℝ^*)
34	32, 33	xrltnled 45359	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑛 ∈ 𝑍) → (𝑥 < (𝑀‘(𝐸‘𝑛)) ↔ ¬ (𝑀‘(𝐸‘𝑛)) ≤ 𝑥))
35	34	rexbidva 3155	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∃𝑛 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑛)) ↔ ∃𝑛 ∈ 𝑍 ¬ (𝑀‘(𝐸‘𝑛)) ≤ 𝑥))
36	30, 35	bitrd 279	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)) ↔ ∃𝑛 ∈ 𝑍 ¬ (𝑀‘(𝐸‘𝑛)) ≤ 𝑥))
37	36	ralbidva 3154	. . . . . . 7 ⊢ (𝜑 → (∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)) ↔ ∀𝑥 ∈ ℝ ∃𝑛 ∈ 𝑍 ¬ (𝑀‘(𝐸‘𝑛)) ≤ 𝑥))
38		rexnal 3082	. . . . . . . . . 10 ⊢ (∃𝑛 ∈ 𝑍 ¬ (𝑀‘(𝐸‘𝑛)) ≤ 𝑥 ↔ ¬ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥)
39	38	ralbii 3075	. . . . . . . . 9 ⊢ (∀𝑥 ∈ ℝ ∃𝑛 ∈ 𝑍 ¬ (𝑀‘(𝐸‘𝑛)) ≤ 𝑥 ↔ ∀𝑥 ∈ ℝ ¬ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥)
40		ralnex 3055	. . . . . . . . 9 ⊢ (∀𝑥 ∈ ℝ ¬ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥 ↔ ¬ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥)
41	39, 40	bitri 275	. . . . . . . 8 ⊢ (∀𝑥 ∈ ℝ ∃𝑛 ∈ 𝑍 ¬ (𝑀‘(𝐸‘𝑛)) ≤ 𝑥 ↔ ¬ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥)
42	41	a1i 11	. . . . . . 7 ⊢ (𝜑 → (∀𝑥 ∈ ℝ ∃𝑛 ∈ 𝑍 ¬ (𝑀‘(𝐸‘𝑛)) ≤ 𝑥 ↔ ¬ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥))
43	37, 42	bitrd 279	. . . . . 6 ⊢ (𝜑 → (∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)) ↔ ¬ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥))
44	43	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ¬ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥) → (∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)) ↔ ¬ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥))
45	26, 44	mpbird 257	. . . 4 ⊢ ((𝜑 ∧ ¬ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥) → ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)))
46		simpr 484	. . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))) → ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)))
47	45, 46	syldan 591	. . 3 ⊢ ((𝜑 ∧ ¬ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥) → ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)))
48		simp-4r 783	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝑥 ∈ ℝ)
49	48, 31	syl 17	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝑥 ∈ ℝ^*)
50		simp-4l 782	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝜑)
51	3	uztrn2 12812	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝑛 ∈ 𝑍)
52	51	ad4ant24 754	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝑛 ∈ 𝑍)
53	11	ffvelcdmda 7056	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑆‘𝑛) ∈ ℝ^*)
54	50, 52, 53	syl2anc 584	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → (𝑆‘𝑛) ∈ ℝ^*)
55		eleq1w 2811	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑗 → (𝑛 ∈ 𝑍 ↔ 𝑗 ∈ 𝑍))
56	55	anbi2d 630	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑗 → ((𝜑 ∧ 𝑛 ∈ 𝑍) ↔ (𝜑 ∧ 𝑗 ∈ 𝑍)))
57		2fveq3 6863	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑗 → (𝑀‘(𝐸‘𝑛)) = (𝑀‘(𝐸‘𝑗)))
58	57	eleq1d 2813	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑗 → ((𝑀‘(𝐸‘𝑛)) ∈ ℝ^* ↔ (𝑀‘(𝐸‘𝑗)) ∈ ℝ^*))
59	56, 58	imbi12d 344	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑗 → (((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑀‘(𝐸‘𝑛)) ∈ ℝ^) ↔ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝑀‘(𝐸‘𝑗)) ∈ ℝ^)))
60	59, 9	chvarvv 1989	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝑀‘(𝐸‘𝑗)) ∈ ℝ^*)
61	60	ad5ant13 756	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → (𝑀‘(𝐸‘𝑗)) ∈ ℝ^*)
62		simplr 768	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝑥 < (𝑀‘(𝐸‘𝑗)))
63	4	3ad2ant1 1133	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝑀 ∈ Meas)
64	7	ffvelcdmda 7056	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐸‘𝑗) ∈ dom 𝑀)
65	64	3adant3 1132	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → (𝐸‘𝑗) ∈ dom 𝑀)
66		simp1 1136	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝜑)
67	51	3adant1 1130	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝑛 ∈ 𝑍)
68	66, 67, 8	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → (𝐸‘𝑛) ∈ dom 𝑀)
69		simp3 1138	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝑛 ∈ (ℤ_≥‘𝑗))
70		simpll 766	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (𝑗..^𝑛)) → 𝜑)
71	3	uzssd3 45422	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑗 ∈ 𝑍 → (ℤ_≥‘𝑗) ⊆ 𝑍)
72	71	adantr 480	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (𝑗..^𝑛)) → (ℤ_≥‘𝑗) ⊆ 𝑍)
73		elfzouz 13624	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑘 ∈ (𝑗..^𝑛) → 𝑘 ∈ (ℤ_≥‘𝑗))
74	73	adantl 481	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (𝑗..^𝑛)) → 𝑘 ∈ (ℤ_≥‘𝑗))
75	72, 74	sseldd 3947	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (𝑗..^𝑛)) → 𝑘 ∈ 𝑍)
76	75	adantll 714	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (𝑗..^𝑛)) → 𝑘 ∈ 𝑍)
77		eleq1w 2811	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑛 = 𝑘 → (𝑛 ∈ 𝑍 ↔ 𝑘 ∈ 𝑍))
78	77	anbi2d 630	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 = 𝑘 → ((𝜑 ∧ 𝑛 ∈ 𝑍) ↔ (𝜑 ∧ 𝑘 ∈ 𝑍)))
79		fveq2 6858	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑛 = 𝑘 → (𝐸‘𝑛) = (𝐸‘𝑘))
80		fvoveq1 7410	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑛 = 𝑘 → (𝐸‘(𝑛 + 1)) = (𝐸‘(𝑘 + 1)))
81	79, 80	sseq12d 3980	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 = 𝑘 → ((𝐸‘𝑛) ⊆ (𝐸‘(𝑛 + 1)) ↔ (𝐸‘𝑘) ⊆ (𝐸‘(𝑘 + 1))))
82	78, 81	imbi12d 344	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = 𝑘 → (((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐸‘𝑛) ⊆ (𝐸‘(𝑛 + 1))) ↔ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐸‘𝑘) ⊆ (𝐸‘(𝑘 + 1)))))
83	82, 21	chvarvv 1989	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐸‘𝑘) ⊆ (𝐸‘(𝑘 + 1)))
84	70, 76, 83	syl2anc 584	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (𝑗..^𝑛)) → (𝐸‘𝑘) ⊆ (𝐸‘(𝑘 + 1)))
85	84	3adantl3 1169	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) ∧ 𝑘 ∈ (𝑗..^𝑛)) → (𝐸‘𝑘) ⊆ (𝐸‘(𝑘 + 1)))
86	69, 85	ssinc 45081	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → (𝐸‘𝑗) ⊆ (𝐸‘𝑛))
87	63, 6, 65, 68, 86	meassle 46461	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → (𝑀‘(𝐸‘𝑗)) ≤ (𝑀‘(𝐸‘𝑛)))
88		fvexd 6873	. . . . . . . . . . . . . . . 16 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → (𝑀‘(𝐸‘𝑛)) ∈ V)
89	10	fvmpt2 6979	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 ∈ 𝑍 ∧ (𝑀‘(𝐸‘𝑛)) ∈ V) → (𝑆‘𝑛) = (𝑀‘(𝐸‘𝑛)))
90	51, 88, 89	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → (𝑆‘𝑛) = (𝑀‘(𝐸‘𝑛)))
91	90	3adant1 1130	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → (𝑆‘𝑛) = (𝑀‘(𝐸‘𝑛)))
92	87, 91	breqtrrd 5135	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → (𝑀‘(𝐸‘𝑗)) ≤ (𝑆‘𝑛))
93	92	ad5ant135 1370	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → (𝑀‘(𝐸‘𝑗)) ≤ (𝑆‘𝑛))
94	49, 61, 54, 62, 93	xrltletrd 13121	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝑥 < (𝑆‘𝑛))
95	49, 54, 94	xrltled 13110	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝑥 ≤ (𝑆‘𝑛))
96	95	ralrimiva 3125	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) → ∀𝑛 ∈ (ℤ_≥‘𝑗)𝑥 ≤ (𝑆‘𝑛))
97	96	ex 412	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → (𝑥 < (𝑀‘(𝐸‘𝑗)) → ∀𝑛 ∈ (ℤ_≥‘𝑗)𝑥 ≤ (𝑆‘𝑛)))
98	97	reximdva 3146	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)) → ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)𝑥 ≤ (𝑆‘𝑛)))
99	98	ralimdva 3145	. . . . . 6 ⊢ (𝜑 → (∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)) → ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)𝑥 ≤ (𝑆‘𝑛)))
100	99	imp 406	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))) → ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)𝑥 ≤ (𝑆‘𝑛))
101		nfmpt1 5206	. . . . . . . 8 ⊢ Ⅎ𝑛(𝑛 ∈ 𝑍 ↦ (𝑀‘(𝐸‘𝑛)))
102	10, 101	nfcxfr 2889	. . . . . . 7 ⊢ Ⅎ𝑛𝑆
103	102, 1, 3, 11	xlimpnf 45840	. . . . . 6 ⊢ (𝜑 → (𝑆~~>*+∞ ↔ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)𝑥 ≤ (𝑆‘𝑛)))
104	103	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))) → (𝑆~~>*+∞ ↔ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)𝑥 ≤ (𝑆‘𝑛)))
105	100, 104	mpbird 257	. . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))) → 𝑆~~>*+∞)
106		nfv 1914	. . . . . . 7 ⊢ Ⅎ𝑥𝜑
107		nfra1 3261	. . . . . . 7 ⊢ Ⅎ𝑥∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))
108	106, 107	nfan 1899	. . . . . 6 ⊢ Ⅎ𝑥(𝜑 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)))
109		rspa 3226	. . . . . . . 8 ⊢ ((∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)) ∧ 𝑥 ∈ ℝ) → ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)))
110	109	adantll 714	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))) ∧ 𝑥 ∈ ℝ) → ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)))
111		nfv 1914	. . . . . . . . . 10 ⊢ Ⅎ𝑗𝜑
112		nfcv 2891	. . . . . . . . . . 11 ⊢ Ⅎ𝑗ℝ
113		nfre1 3262	. . . . . . . . . . 11 ⊢ Ⅎ𝑗∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))
114	112, 113	nfralw 3285	. . . . . . . . . 10 ⊢ Ⅎ𝑗∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))
115	111, 114	nfan 1899	. . . . . . . . 9 ⊢ Ⅎ𝑗(𝜑 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)))
116		nfv 1914	. . . . . . . . 9 ⊢ Ⅎ𝑗 𝑥 ∈ ℝ
117	115, 116	nfan 1899	. . . . . . . 8 ⊢ Ⅎ𝑗((𝜑 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))) ∧ 𝑥 ∈ ℝ)
118		nfv 1914	. . . . . . . 8 ⊢ Ⅎ𝑗 𝑥 ≤ (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛))
119	31	ad3antlr 731	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) → 𝑥 ∈ ℝ^*)
120	4, 6	dmmeasal 46450	. . . . . . . . . . . . . 14 ⊢ (𝜑 → dom 𝑀 ∈ SAlg)
121	3	uzct 45057	. . . . . . . . . . . . . . 15 ⊢ 𝑍 ≼ ω
122	121	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑍 ≼ ω)
123	120, 122, 8	saliuncl 46321	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛) ∈ dom 𝑀)
124	4, 6, 123	meaxrcl 46459	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)) ∈ ℝ^*)
125	124	ad3antrrr 730	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) → (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)) ∈ ℝ^*)
126	60	ad4ant13 751	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) → (𝑀‘(𝐸‘𝑗)) ∈ ℝ^*)
127		simpr 484	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) → 𝑥 < (𝑀‘(𝐸‘𝑗)))
128	4	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑀 ∈ Meas)
129	123	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → ∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛) ∈ dom 𝑀)
130		fveq2 6858	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑗 → (𝐸‘𝑛) = (𝐸‘𝑗))
131	130	ssiun2s 5012	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ 𝑍 → (𝐸‘𝑗) ⊆ ∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛))
132	131	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐸‘𝑗) ⊆ ∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛))
133	128, 6, 64, 129, 132	meassle 46461	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝑀‘(𝐸‘𝑗)) ≤ (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)))
134	133	ad4ant13 751	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) → (𝑀‘(𝐸‘𝑗)) ≤ (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)))
135	119, 126, 125, 127, 134	xrltletrd 13121	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) → 𝑥 < (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)))
136	119, 125, 135	xrltled 13110	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 < (𝑀‘(𝐸‘𝑗))) → 𝑥 ≤ (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)))
137	136	exp31 419	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑗 ∈ 𝑍 → (𝑥 < (𝑀‘(𝐸‘𝑗)) → 𝑥 ≤ (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)))))
138	137	adantlr 715	. . . . . . . 8 ⊢ (((𝜑 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))) ∧ 𝑥 ∈ ℝ) → (𝑗 ∈ 𝑍 → (𝑥 < (𝑀‘(𝐸‘𝑗)) → 𝑥 ≤ (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)))))
139	117, 118, 138	rexlimd 3244	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))) ∧ 𝑥 ∈ ℝ) → (∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗)) → 𝑥 ≤ (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛))))
140	110, 139	mpd 15	. . . . . 6 ⊢ (((𝜑 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))) ∧ 𝑥 ∈ ℝ) → 𝑥 ≤ (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)))
141	108, 140	ralrimia 3236	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))) → ∀𝑥 ∈ ℝ 𝑥 ≤ (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)))
142		xrpnf 45481	. . . . . . 7 ⊢ ((𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)) ∈ ℝ^* → ((𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)) = +∞ ↔ ∀𝑥 ∈ ℝ 𝑥 ≤ (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛))))
143	124, 142	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)) = +∞ ↔ ∀𝑥 ∈ ℝ 𝑥 ≤ (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛))))
144	143	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))) → ((𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)) = +∞ ↔ ∀𝑥 ∈ ℝ 𝑥 ≤ (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛))))
145	141, 144	mpbird 257	. . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))) → (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)) = +∞)
146	105, 145	breqtrrd 5135	. . 3 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 𝑥 < (𝑀‘(𝐸‘𝑗))) → 𝑆~~>*(𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)))
147	47, 146	syldan 591	. 2 ⊢ ((𝜑 ∧ ¬ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥) → 𝑆~~>*(𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)))
148	25, 147	pm2.61dan 812	1 ⊢ (𝜑 → 𝑆~~>*(𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∀wral 3044 ∃wrex 3053 Vcvv 3447 ⊆ wss 3914 ∪ ciun 4955 class class class wbr 5107 ↦ cmpt 5188 dom cdm 5638 ⟶wf 6507 ‘cfv 6511 (class class class)co 7387 ωcom 7842 ≼ cdom 8916 ℝcr 11067 1c1 11069 + caddc 11071 +∞cpnf 11205 ℝ^*cxr 11207 < clt 11208 ≤ cle 11209 ℤcz 12529 ℤ_≥cuz 12793 ..^cfzo 13615 ~~>*clsxlim 45816 Meascmea 46447

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-inf2 9594 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-pre-sup 11146

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-disj 5075 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-se 5592 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-isom 6520 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-2o 8435 df-oadd 8438 df-omul 8439 df-er 8671 df-map 8801 df-pm 8802 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-fi 9362 df-sup 9393 df-inf 9394 df-oi 9463 df-card 9892 df-acn 9895 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-div 11836 df-nn 12187 df-2 12249 df-3 12250 df-4 12251 df-5 12252 df-6 12253 df-7 12254 df-8 12255 df-9 12256 df-n0 12443 df-z 12530 df-dec 12650 df-uz 12794 df-q 12908 df-rp 12952 df-xneg 13072 df-xadd 13073 df-xmul 13074 df-ioo 13310 df-ioc 13311 df-ico 13312 df-icc 13313 df-fz 13469 df-fzo 13616 df-fl 13754 df-seq 13967 df-exp 14027 df-hash 14296 df-cj 15065 df-re 15066 df-im 15067 df-sqrt 15201 df-abs 15202 df-clim 15454 df-rlim 15455 df-sum 15653 df-struct 17117 df-slot 17152 df-ndx 17164 df-base 17180 df-plusg 17233 df-mulr 17234 df-starv 17235 df-tset 17239 df-ple 17240 df-ds 17242 df-unif 17243 df-rest 17385 df-topn 17386 df-topgen 17406 df-ordt 17464 df-ps 18525 df-tsr 18526 df-psmet 21256 df-xmet 21257 df-met 21258 df-bl 21259 df-mopn 21260 df-cnfld 21265 df-top 22781 df-topon 22798 df-topsp 22820 df-bases 22833 df-lm 23116 df-xms 24208 df-ms 24209 df-xlim 45817 df-salg 46307 df-sumge0 46361 df-mea 46448

This theorem is referenced by: meaiuninc3 46483

W3C validator