vonioolem1 - Mathbox for Glauco Siliprandi

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

Theorem vonioolem1 47606

Description: The sequence of the measures of the half-open intervals converges to the measure of their union. (Contributed by Glauco Siliprandi, 8-Apr-2021.)

**Hypotheses**
Ref	Expression
vonioolem1.x	⊢ (𝜑 → 𝑋 ∈ Fin)
vonioolem1.a	⊢ (𝜑 → 𝐴:𝑋⟶ℝ)
vonioolem1.b	⊢ (𝜑 → 𝐵:𝑋⟶ℝ)
vonioolem1.u	⊢ (𝜑 → 𝑋 ≠ ∅)
vonioolem1.t	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) < (𝐵‘𝑘))
vonioolem1.c	⊢ 𝐶 = (𝑛 ∈ ℕ ↦ (𝑘 ∈ 𝑋 ↦ ((𝐴‘𝑘) + (1 / 𝑛))))
vonioolem1.d	⊢ 𝐷 = (𝑛 ∈ ℕ ↦ X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘)))
vonioolem1.s	⊢ 𝑆 = (𝑛 ∈ ℕ ↦ ((voln‘𝑋)‘(𝐷‘𝑛)))
vonioolem1.r	⊢ 𝑇 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)))
vonioolem1.e	⊢ 𝐸 = inf(ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))), ℝ, < )
vonioolem1.n	⊢ 𝑁 = ((⌊‘(1 / 𝐸)) + 1)
vonioolem1.z	⊢ 𝑍 = (ℤ_≥‘𝑁)

**Assertion**
Ref	Expression
vonioolem1	⊢ (𝜑 → 𝑆 ⇝ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − (𝐴‘𝑘)))

Distinct variable groups: 𝐴,𝑛 𝐵,𝑘,𝑛 𝐶,𝑘 𝑆,𝑛 𝑇,𝑛 𝑘,𝑋,𝑛 𝑘,𝑍,𝑛 𝜑,𝑘,𝑛 Allowed substitution hints: 𝐴(𝑘) 𝐶(𝑛) 𝐷(𝑘, 𝑛) 𝑆(𝑘) 𝑇(𝑘) 𝐸(𝑘, 𝑛) 𝑁(𝑘, 𝑛)

**Proof of Theorem vonioolem1**
Step	Hyp	Ref	Expression
1		vonioolem1.r	. . . . 5 ⊢ 𝑇 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)))
2	1	a1i 11	. . . 4 ⊢ (𝜑 → 𝑇 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘))))
3		vonioolem1.c	. . . . . . . . . . 11 ⊢ 𝐶 = (𝑛 ∈ ℕ ↦ (𝑘 ∈ 𝑋 ↦ ((𝐴‘𝑘) + (1 / 𝑛))))
4	3	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 = (𝑛 ∈ ℕ ↦ (𝑘 ∈ 𝑋 ↦ ((𝐴‘𝑘) + (1 / 𝑛)))))
5		vonioolem1.x	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑋 ∈ Fin)
6	5	mptexd 7219	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑘 ∈ 𝑋 ↦ ((𝐴‘𝑘) + (1 / 𝑛))) ∈ V)
7	6	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑘 ∈ 𝑋 ↦ ((𝐴‘𝑘) + (1 / 𝑛))) ∈ V)
8	4, 7	fvmpt2d 6996	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐶‘𝑛) = (𝑘 ∈ 𝑋 ↦ ((𝐴‘𝑘) + (1 / 𝑛))))
9		ovexd 7444	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → ((𝐴‘𝑘) + (1 / 𝑛)) ∈ V)
10	8, 9	fvmpt2d 6996	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → ((𝐶‘𝑛)‘𝑘) = ((𝐴‘𝑘) + (1 / 𝑛)))
11	10	oveq2d 7425	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)) = ((𝐵‘𝑘) − ((𝐴‘𝑘) + (1 / 𝑛))))
12		vonioolem1.b	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵:𝑋⟶ℝ)
13	12	ffvelcdmda 7073	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐵‘𝑘) ∈ ℝ)
14	13	adantlr 728	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → (𝐵‘𝑘) ∈ ℝ)
15	14	recnd 11294	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → (𝐵‘𝑘) ∈ ℂ)
16		vonioolem1.a	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴:𝑋⟶ℝ)
17	16	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐴:𝑋⟶ℝ)
18	17	ffvelcdmda 7073	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) ∈ ℝ)
19	18	recnd 11294	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) ∈ ℂ)
20		nnrecre 12335	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℝ)
21	20	ad2antlr 740	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → (1 / 𝑛) ∈ ℝ)
22	21	recnd 11294	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → (1 / 𝑛) ∈ ℂ)
23	15, 19, 22	subsub4d 11657	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛)) = ((𝐵‘𝑘) − ((𝐴‘𝑘) + (1 / 𝑛))))
24	11, 23	eqtr4d 2798	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)) = (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛)))
25	24	prodeq2dv 16043	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)) = ∏𝑘 ∈ 𝑋 (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛)))
26	25	mpteq2dva 5198	. . . 4 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘))) = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛))))
27	2, 26	eqtrd 2795	. . 3 ⊢ (𝜑 → 𝑇 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛))))
28		nfv 1947	. . . 4 ⊢ Ⅎ𝑘𝜑
29		rpssre 13083	. . . . . 6 ⊢ ℝ⁺ ⊆ ℝ
30		vonioolem1.t	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) < (𝐵‘𝑘))
31	16	ffvelcdmda 7073	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) ∈ ℝ)
32		difrp 13115	. . . . . . . 8 ⊢ (((𝐴‘𝑘) ∈ ℝ ∧ (𝐵‘𝑘) ∈ ℝ) → ((𝐴‘𝑘) < (𝐵‘𝑘) ↔ ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ℝ⁺))
33	31, 13, 32	syl2anc 596	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ((𝐴‘𝑘) < (𝐵‘𝑘) ↔ ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ℝ⁺))
34	30, 33	mpbid 235	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ℝ⁺)
35	29, 34	sselid 3929	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ℝ)
36	35	recnd 11294	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ℂ)
37		eqid 2760	. . . 4 ⊢ (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛))) = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛)))
38	28, 5, 36, 37	fprodsubrecnncnv 46834	. . 3 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛))) ⇝ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − (𝐴‘𝑘)))
39	27, 38	eqbrtrd 5127	. 2 ⊢ (𝜑 → 𝑇 ⇝ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − (𝐴‘𝑘)))
40		vonioolem1.z	. . 3 ⊢ 𝑍 = (ℤ_≥‘𝑁)
41		nnex 12296	. . . . . 6 ⊢ ℕ ∈ V
42	41	mptex 7218	. . . . 5 ⊢ (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘))) ∈ V
43	42	a1i 11	. . . 4 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘))) ∈ V)
44	1, 43	eqeltrid 2864	. . 3 ⊢ (𝜑 → 𝑇 ∈ V)
45		vonioolem1.s	. . . 4 ⊢ 𝑆 = (𝑛 ∈ ℕ ↦ ((voln‘𝑋)‘(𝐷‘𝑛)))
46	41	mptex 7218	. . . . 5 ⊢ (𝑛 ∈ ℕ ↦ ((voln‘𝑋)‘(𝐷‘𝑛))) ∈ V
47	46	a1i 11	. . . 4 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ ((voln‘𝑋)‘(𝐷‘𝑛))) ∈ V)
48	45, 47	eqeltrid 2864	. . 3 ⊢ (𝜑 → 𝑆 ∈ V)
49		vonioolem1.n	. . . 4 ⊢ 𝑁 = ((⌊‘(1 / 𝐸)) + 1)
50		1rp 13079	. . . . . . . . . 10 ⊢ 1 ∈ ℝ⁺
51	50	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 1 ∈ ℝ⁺)
52		eqid 2760	. . . . . . . . . . 11 ⊢ (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) = (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘)))
53	28, 52, 34	rnmptssd 7113	. . . . . . . . . 10 ⊢ (𝜑 → ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ⊆ ℝ⁺)
54		vonioolem1.e	. . . . . . . . . . 11 ⊢ 𝐸 = inf(ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))), ℝ, < )
55		ltso 11347	. . . . . . . . . . . . 13 ⊢ < Or ℝ
56	55	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → < Or ℝ)
57	52	rnmptfi 46101	. . . . . . . . . . . . 13 ⊢ (𝑋 ∈ Fin → ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ∈ Fin)
58	5, 57	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ∈ Fin)
59		vonioolem1.u	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑋 ≠ ∅)
60	28, 34, 52, 59	rnmptn0 6235	. . . . . . . . . . . 12 ⊢ (𝜑 → ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ≠ ∅)
61	29	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → ℝ⁺ ⊆ ℝ)
62	53, 61	sstrd 3941	. . . . . . . . . . . 12 ⊢ (𝜑 → ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ⊆ ℝ)
63		fiinfcl 9473	. . . . . . . . . . . 12 ⊢ (( < Or ℝ ∧ (ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ∈ Fin ∧ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ≠ ∅ ∧ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ⊆ ℝ)) → inf(ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))), ℝ, < ) ∈ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))))
64	56, 58, 60, 62, 63	syl13anc 1399	. . . . . . . . . . 11 ⊢ (𝜑 → inf(ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))), ℝ, < ) ∈ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))))
65	54, 64	eqeltrid 2864	. . . . . . . . . 10 ⊢ (𝜑 → 𝐸 ∈ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))))
66	53, 65	sseldd 3932	. . . . . . . . 9 ⊢ (𝜑 → 𝐸 ∈ ℝ⁺)
67	51, 66	rpdivcld 13136	. . . . . . . 8 ⊢ (𝜑 → (1 / 𝐸) ∈ ℝ⁺)
68	67	rpred 13119	. . . . . . 7 ⊢ (𝜑 → (1 / 𝐸) ∈ ℝ)
69	67	rpge0d 13123	. . . . . . 7 ⊢ (𝜑 → 0 ≤ (1 / 𝐸))
70		flge0nn0 13914	. . . . . . 7 ⊢ (((1 / 𝐸) ∈ ℝ ∧ 0 ≤ (1 / 𝐸)) → (⌊‘(1 / 𝐸)) ∈ ℕ₀)
71	68, 69, 70	syl2anc 596	. . . . . 6 ⊢ (𝜑 → (⌊‘(1 / 𝐸)) ∈ ℕ₀)
72		nn0p1nn 12600	. . . . . 6 ⊢ ((⌊‘(1 / 𝐸)) ∈ ℕ₀ → ((⌊‘(1 / 𝐸)) + 1) ∈ ℕ)
73	71, 72	syl 18	. . . . 5 ⊢ (𝜑 → ((⌊‘(1 / 𝐸)) + 1) ∈ ℕ)
74	73	nnzd 12674	. . . 4 ⊢ (𝜑 → ((⌊‘(1 / 𝐸)) + 1) ∈ ℤ)
75	49, 74	eqeltrid 2864	. . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ)
76	49	recnnltrp 46304	. . . . . . . . . . . . 13 ⊢ (𝐸 ∈ ℝ⁺ → (𝑁 ∈ ℕ ∧ (1 / 𝑁) < 𝐸))
77	66, 76	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑁 ∈ ℕ ∧ (1 / 𝑁) < 𝐸))
78	77	simpld 500	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑁 ∈ ℕ)
79		uznnssnn 12977	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ → (ℤ_≥‘𝑁) ⊆ ℕ)
80	78, 79	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → (ℤ_≥‘𝑁) ⊆ ℕ)
81	40, 80	eqsstrid 3969	. . . . . . . . 9 ⊢ (𝜑 → 𝑍 ⊆ ℕ)
82	81	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑍 ⊆ ℕ)
83		simpr 490	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍)
84	82, 83	sseldd 3932	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ ℕ)
85		vonioolem1.d	. . . . . . . . 9 ⊢ 𝐷 = (𝑛 ∈ ℕ ↦ X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘)))
86	85	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 𝐷 = (𝑛 ∈ ℕ ↦ X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘))))
87	5	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑋 ∈ Fin)
88		eqid 2760	. . . . . . . . . 10 ⊢ dom (voln‘𝑋) = dom (voln‘𝑋)
89	18, 21	readdcld 11295	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → ((𝐴‘𝑘) + (1 / 𝑛)) ∈ ℝ)
90	89	fmpttd 7104	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑘 ∈ 𝑋 ↦ ((𝐴‘𝑘) + (1 / 𝑛))):𝑋⟶ℝ)
91	8	feq1d 6680	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐶‘𝑛):𝑋⟶ℝ ↔ (𝑘 ∈ 𝑋 ↦ ((𝐴‘𝑘) + (1 / 𝑛))):𝑋⟶ℝ))
92	90, 91	mpbird 260	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐶‘𝑛):𝑋⟶ℝ)
93	12	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐵:𝑋⟶ℝ)
94	87, 88, 92, 93	hoimbl 47557	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘)) ∈ dom (voln‘𝑋))
95	94	elexd 3473	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘)) ∈ V)
96	86, 95	fvmpt2d 6996	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐷‘𝑛) = X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘)))
97	84, 96	syldan 603	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐷‘𝑛) = X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘)))
98	97	fveq2d 6878	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((voln‘𝑋)‘(𝐷‘𝑛)) = ((voln‘𝑋)‘X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘))))
99	5	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑋 ∈ Fin)
100	59	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑋 ≠ ∅)
101	84, 92	syldan 603	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐶‘𝑛):𝑋⟶ℝ)
102	12	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝐵:𝑋⟶ℝ)
103		eqid 2760	. . . . . 6 ⊢ X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘)) = X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘))
104	99, 100, 101, 102, 103	vonn0hoi 47596	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((voln‘𝑋)‘X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘))) = ∏𝑘 ∈ 𝑋 (vol‘(((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘))))
105	101	ffvelcdmda 7073	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → ((𝐶‘𝑛)‘𝑘) ∈ ℝ)
106	84, 14	syldanl 614	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (𝐵‘𝑘) ∈ ℝ)
107		volico 46909	. . . . . . . 8 ⊢ ((((𝐶‘𝑛)‘𝑘) ∈ ℝ ∧ (𝐵‘𝑘) ∈ ℝ) → (vol‘(((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘))) = if(((𝐶‘𝑛)‘𝑘) < (𝐵‘𝑘), ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)), 0))
108	105, 106, 107	syl2anc 596	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (vol‘(((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘))) = if(((𝐶‘𝑛)‘𝑘) < (𝐵‘𝑘), ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)), 0))
109	84, 10	syldanl 614	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → ((𝐶‘𝑛)‘𝑘) = ((𝐴‘𝑘) + (1 / 𝑛)))
110	84, 21	syldanl 614	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (1 / 𝑛) ∈ ℝ)
111	78	nnrecred 12344	. . . . . . . . . . . 12 ⊢ (𝜑 → (1 / 𝑁) ∈ ℝ)
112	111	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (1 / 𝑁) ∈ ℝ)
113	35	adantlr 728	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ℝ)
114	40	eleq2i 2852	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ 𝑍 ↔ 𝑛 ∈ (ℤ_≥‘𝑁))
115	114	biimpi 219	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ 𝑍 → 𝑛 ∈ (ℤ_≥‘𝑁))
116		eluzle 12933	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → 𝑁 ≤ 𝑛)
117	115, 116	syl 18	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ 𝑍 → 𝑁 ≤ 𝑛)
118	117	adantl 487	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑁 ≤ 𝑛)
119	78	nnrpd 13117	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑁 ∈ ℝ⁺)
120	119	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑁 ∈ ℝ⁺)
121		nnrp 13087	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ⁺)
122	84, 121	syl 18	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ ℝ⁺)
123	120, 122	lerecd 13138	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑁 ≤ 𝑛 ↔ (1 / 𝑛) ≤ (1 / 𝑁)))
124	118, 123	mpbid 235	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (1 / 𝑛) ≤ (1 / 𝑁))
125	124	adantr 486	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (1 / 𝑛) ≤ (1 / 𝑁))
126	111	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (1 / 𝑁) ∈ ℝ)
127	29, 66	sselid 3929	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐸 ∈ ℝ)
128	127	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → 𝐸 ∈ ℝ)
129	77	simprd 501	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (1 / 𝑁) < 𝐸)
130	129	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (1 / 𝑁) < 𝐸)
131	62	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ⊆ ℝ)
132	58	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ∈ Fin)
133		id 23	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ 𝑋 → 𝑘 ∈ 𝑋)
134		ovexd 7444	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ 𝑋 → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ V)
135	52	elrnmpt1 5939	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 ∈ 𝑋 ∧ ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ V) → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))))
136	133, 134, 135	syl2anc 596	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ 𝑋 → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))))
137	136	adantl 487	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))))
138		infrefilb 12258	. . . . . . . . . . . . . . 15 ⊢ ((ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ⊆ ℝ ∧ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ∈ Fin ∧ ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘)))) → inf(ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))), ℝ, < ) ≤ ((𝐵‘𝑘) − (𝐴‘𝑘)))
139	131, 132, 137, 138	syl3anc 1398	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → inf(ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))), ℝ, < ) ≤ ((𝐵‘𝑘) − (𝐴‘𝑘)))
140	54, 139	eqbrtrid 5140	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → 𝐸 ≤ ((𝐵‘𝑘) − (𝐴‘𝑘)))
141	126, 128, 35, 130, 140	ltletrd 11427	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (1 / 𝑁) < ((𝐵‘𝑘) − (𝐴‘𝑘)))
142	141	adantlr 728	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (1 / 𝑁) < ((𝐵‘𝑘) − (𝐴‘𝑘)))
143	110, 112, 113, 125, 142	lelttrd 11425	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (1 / 𝑛) < ((𝐵‘𝑘) − (𝐴‘𝑘)))
144	84, 18	syldanl 614	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) ∈ ℝ)
145	144, 110, 106	ltaddsub2d 11872	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (((𝐴‘𝑘) + (1 / 𝑛)) < (𝐵‘𝑘) ↔ (1 / 𝑛) < ((𝐵‘𝑘) − (𝐴‘𝑘))))
146	143, 145	mpbird 260	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → ((𝐴‘𝑘) + (1 / 𝑛)) < (𝐵‘𝑘))
147	109, 146	eqbrtrd 5127	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → ((𝐶‘𝑛)‘𝑘) < (𝐵‘𝑘))
148	147	iftrued 4490	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → if(((𝐶‘𝑛)‘𝑘) < (𝐵‘𝑘), ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)), 0) = ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)))
149	108, 148	eqtrd 2795	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (vol‘(((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘))) = ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)))
150	149	prodeq2dv 16043	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ∏𝑘 ∈ 𝑋 (vol‘(((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘))) = ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)))
151	98, 104, 150	3eqtrd 2799	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((voln‘𝑋)‘(𝐷‘𝑛)) = ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)))
152		fvexd 6889	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((voln‘𝑋)‘(𝐷‘𝑛)) ∈ V)
153	45	fvmpt2 6994	. . . . 5 ⊢ ((𝑛 ∈ ℕ ∧ ((voln‘𝑋)‘(𝐷‘𝑛)) ∈ V) → (𝑆‘𝑛) = ((voln‘𝑋)‘(𝐷‘𝑛)))
154	84, 152, 153	syl2anc 596	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑆‘𝑛) = ((voln‘𝑋)‘(𝐷‘𝑛)))
155		prodex 16027	. . . . . 6 ⊢ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)) ∈ V
156	155	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)) ∈ V)
157	1	fvmpt2 6994	. . . . 5 ⊢ ((𝑛 ∈ ℕ ∧ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)) ∈ V) → (𝑇‘𝑛) = ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)))
158	84, 156, 157	syl2anc 596	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑇‘𝑛) = ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)))
159	151, 154, 158	3eqtr4rd 2806	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑇‘𝑛) = (𝑆‘𝑛))
160	40, 44, 48, 75, 159	climeq 15687	. 2 ⊢ (𝜑 → (𝑇 ⇝ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − (𝐴‘𝑘)) ↔ 𝑆 ⇝ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − (𝐴‘𝑘))))
161	39, 160	mpbid 235	1 ⊢ (𝜑 → 𝑆 ⇝ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − (𝐴‘𝑘)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 Vcvv 3450 ⊆ wss 3899 ∅c0 4279 ifcif 4482 class class class wbr 5103 ↦ cmpt 5186 Or wor 5555 dom cdm 5648 ran crn 5649 ⟶wf 6524 ‘cfv 6528 (class class class)co 7409 Xcixp 8904 Fincfn 8952 infcinf 9411 ℝcr 11156 0cc0 11157 1c1 11158 + caddc 11160 < clt 11300 ≤ cle 11301 − cmin 11498 / cdiv 11928 ℕcn 12290 ℕ₀cn0 12561 ℤcz 12648 ℤ_≥cuz 12920 ℝ⁺crp 13075 [,)cico 13433 ⌊cfl 13884 ⇝ cli 15604 ∏cprod 16025 volcvol 25731 volncvoln 47464

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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7735 ax-inf2 9620 ax-cc 10470 ax-cnex 11213 ax-resscn 11214 ax-1cn 11215 ax-icn 11216 ax-addcl 11217 ax-addrcl 11218 ax-mulcl 11219 ax-mulrcl 11220 ax-mulcom 11221 ax-addass 11222 ax-mulass 11223 ax-distr 11224 ax-i2m1 11225 ax-1ne0 11226 ax-1rid 11227 ax-rnegex 11228 ax-rrecex 11229 ax-cnre 11230 ax-pre-lttri 11231 ax-pre-lttrn 11232 ax-pre-ltadd 11233 ax-pre-mulgt0 11234 ax-pre-sup 11235

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-disj 5071 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-se 5602 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6294 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-isom 6537 df-riota 7366 df-ov 7412 df-oprab 7413 df-mpo 7414 df-of 7677 df-om 7862 df-1st 7985 df-2nd 7986 df-supp 8157 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8455 df-2o 8456 df-oadd 8459 df-omul 8460 df-er 8696 df-map 8828 df-pm 8829 df-ixp 8905 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-fsupp 9332 df-fi 9381 df-sup 9412 df-inf 9413 df-oi 9482 df-dju 9939 df-card 9977 df-acn 9980 df-pnf 11302 df-mnf 11303 df-xr 11304 df-ltxr 11305 df-le 11306 df-sub 11500 df-neg 11501 df-div 11929 df-nn 12291 df-2 12360 df-3 12361 df-4 12362 df-5 12363 df-6 12364 df-7 12365 df-8 12366 df-9 12367 df-n0 12562 df-z 12649 df-dec 12770 df-uz 12921 df-q 13031 df-rp 13076 df-xneg 13196 df-xadd 13197 df-xmul 13198 df-ioo 13435 df-ico 13437 df-icc 13438 df-fz 13595 df-fzo 13743 df-fl 13886 df-seq 14099 df-exp 14159 df-hash 14428 df-cj 15219 df-re 15220 df-im 15221 df-sqrt 15355 df-abs 15356 df-clim 15608 df-rlim 15609 df-sum 15807 df-prod 16026 df-struct 17272 df-sets 17289 df-slot 17307 df-ndx 17319 df-base 17335 df-ress 17356 df-plusg 17388 df-mulr 17389 df-starv 17390 df-sca 17391 df-vsca 17392 df-ip 17393 df-tset 17394 df-ple 17395 df-ds 17397 df-unif 17398 df-hom 17399 df-cco 17400 df-rest 17540 df-topn 17541 df-0g 17559 df-gsum 17560 df-topgen 17561 df-pt 17562 df-prds 17565 df-xrs 17621 df-qtop 17626 df-imas 17627 df-xps 17629 df-mre 17703 df-mrc 17704 df-acs 17706 df-mgm 18763 df-sgrp 18855 df-mnd 18871 df-submnd 18926 df-mulg 19225 df-cntz 19478 df-cmn 19943 df-psmet 21617 df-xmet 21618 df-met 21619 df-bl 21620 df-mopn 21621 df-cnfld 21626 df-top 23159 df-topon 23176 df-topsp 23198 df-bases 23211 df-cn 23492 df-cnp 23493 df-cmp 23652 df-tx 23828 df-hmeo 24021 df-xms 24586 df-ms 24587 df-tms 24588 df-cncf 25146 df-ovol 25732 df-vol 25733 df-salg 47235 df-sumge0 47289 df-mea 47376 df-ome 47416 df-caragen 47418 df-ovoln 47463 df-voln 47465

This theorem is used by: vonioolem2 47607

W3C validator