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 47495

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 7226	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑘 ∈ 𝑋 ↦ ((𝐴‘𝑘) + (1 / 𝑛))) ∈ V)
7	6	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑘 ∈ 𝑋 ↦ ((𝐴‘𝑘) + (1 / 𝑛))) ∈ V)
8	4, 7	fvmpt2d 7004	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐶‘𝑛) = (𝑘 ∈ 𝑋 ↦ ((𝐴‘𝑘) + (1 / 𝑛))))
9		ovexd 7451	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → ((𝐴‘𝑘) + (1 / 𝑛)) ∈ V)
10	8, 9	fvmpt2d 7004	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → ((𝐶‘𝑛)‘𝑘) = ((𝐴‘𝑘) + (1 / 𝑛)))
11	10	oveq2d 7432	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)) = ((𝐵‘𝑘) − ((𝐴‘𝑘) + (1 / 𝑛))))
12		vonioolem1.b	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵:𝑋⟶ℝ)
13	12	ffvelcdmda 7080	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐵‘𝑘) ∈ ℝ)
14	13	adantlr 728	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → (𝐵‘𝑘) ∈ ℝ)
15	14	recnd 11264	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → (𝐵‘𝑘) ∈ ℂ)
16		vonioolem1.a	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴:𝑋⟶ℝ)
17	16	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐴:𝑋⟶ℝ)
18	17	ffvelcdmda 7080	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) ∈ ℝ)
19	18	recnd 11264	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) ∈ ℂ)
20		nnrecre 12305	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℝ)
21	20	ad2antlr 740	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → (1 / 𝑛) ∈ ℝ)
22	21	recnd 11264	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → (1 / 𝑛) ∈ ℂ)
23	15, 19, 22	subsub4d 11627	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛)) = ((𝐵‘𝑘) − ((𝐴‘𝑘) + (1 / 𝑛))))
24	11, 23	eqtr4d 2800	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)) = (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛)))
25	24	prodeq2dv 16013	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)) = ∏𝑘 ∈ 𝑋 (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛)))
26	25	mpteq2dva 5202	. . . 4 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘))) = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛))))
27	2, 26	eqtrd 2797	. . 3 ⊢ (𝜑 → 𝑇 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛))))
28		nfv 1947	. . . 4 ⊢ Ⅎ𝑘𝜑
29		rpssre 13052	. . . . . 6 ⊢ ℝ⁺ ⊆ ℝ
30		vonioolem1.t	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) < (𝐵‘𝑘))
31	16	ffvelcdmda 7080	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) ∈ ℝ)
32		difrp 13084	. . . . . . . 8 ⊢ (((𝐴‘𝑘) ∈ ℝ ∧ (𝐵‘𝑘) ∈ ℝ) → ((𝐴‘𝑘) < (𝐵‘𝑘) ↔ ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ℝ⁺))
33	31, 13, 32	syl2anc 596	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ((𝐴‘𝑘) < (𝐵‘𝑘) ↔ ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ℝ⁺))
34	30, 33	mpbid 235	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ℝ⁺)
35	29, 34	sselid 3932	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ℝ)
36	35	recnd 11264	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ℂ)
37		eqid 2762	. . . 4 ⊢ (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛))) = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛)))
38	28, 5, 36, 37	fprodsubrecnncnv 46723	. . 3 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 (((𝐵‘𝑘) − (𝐴‘𝑘)) − (1 / 𝑛))) ⇝ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − (𝐴‘𝑘)))
39	27, 38	eqbrtrd 5131	. 2 ⊢ (𝜑 → 𝑇 ⇝ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − (𝐴‘𝑘)))
40		vonioolem1.z	. . 3 ⊢ 𝑍 = (ℤ_≥‘𝑁)
41		nnex 12266	. . . . . 6 ⊢ ℕ ∈ V
42	41	mptex 7225	. . . . 5 ⊢ (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘))) ∈ V
43	42	a1i 11	. . . 4 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘))) ∈ V)
44	1, 43	eqeltrid 2866	. . 3 ⊢ (𝜑 → 𝑇 ∈ V)
45		vonioolem1.s	. . . 4 ⊢ 𝑆 = (𝑛 ∈ ℕ ↦ ((voln‘𝑋)‘(𝐷‘𝑛)))
46	41	mptex 7225	. . . . 5 ⊢ (𝑛 ∈ ℕ ↦ ((voln‘𝑋)‘(𝐷‘𝑛))) ∈ V
47	46	a1i 11	. . . 4 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ ((voln‘𝑋)‘(𝐷‘𝑛))) ∈ V)
48	45, 47	eqeltrid 2866	. . 3 ⊢ (𝜑 → 𝑆 ∈ V)
49		vonioolem1.n	. . . 4 ⊢ 𝑁 = ((⌊‘(1 / 𝐸)) + 1)
50		1rp 13048	. . . . . . . . . 10 ⊢ 1 ∈ ℝ⁺
51	50	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 1 ∈ ℝ⁺)
52		eqid 2762	. . . . . . . . . . 11 ⊢ (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) = (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘)))
53	28, 52, 34	rnmptssd 7120	. . . . . . . . . 10 ⊢ (𝜑 → ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ⊆ ℝ⁺)
54		vonioolem1.e	. . . . . . . . . . 11 ⊢ 𝐸 = inf(ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))), ℝ, < )
55		ltso 11317	. . . . . . . . . . . . 13 ⊢ < Or ℝ
56	55	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → < Or ℝ)
57	52	rnmptfi 45990	. . . . . . . . . . . . 13 ⊢ (𝑋 ∈ Fin → ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ∈ Fin)
58	5, 57	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ∈ Fin)
59		vonioolem1.u	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑋 ≠ ∅)
60	28, 34, 52, 59	rnmptn0 6244	. . . . . . . . . . . 12 ⊢ (𝜑 → ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ≠ ∅)
61	29	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → ℝ⁺ ⊆ ℝ)
62	53, 61	sstrd 3944	. . . . . . . . . . . 12 ⊢ (𝜑 → ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ⊆ ℝ)
63		fiinfcl 9476	. . . . . . . . . . . 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 2866	. . . . . . . . . 10 ⊢ (𝜑 → 𝐸 ∈ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))))
66	53, 65	sseldd 3935	. . . . . . . . 9 ⊢ (𝜑 → 𝐸 ∈ ℝ⁺)
67	51, 66	rpdivcld 13105	. . . . . . . 8 ⊢ (𝜑 → (1 / 𝐸) ∈ ℝ⁺)
68	67	rpred 13088	. . . . . . 7 ⊢ (𝜑 → (1 / 𝐸) ∈ ℝ)
69	67	rpge0d 13092	. . . . . . 7 ⊢ (𝜑 → 0 ≤ (1 / 𝐸))
70		flge0nn0 13883	. . . . . . 7 ⊢ (((1 / 𝐸) ∈ ℝ ∧ 0 ≤ (1 / 𝐸)) → (⌊‘(1 / 𝐸)) ∈ ℕ₀)
71	68, 69, 70	syl2anc 596	. . . . . 6 ⊢ (𝜑 → (⌊‘(1 / 𝐸)) ∈ ℕ₀)
72		nn0p1nn 12570	. . . . . 6 ⊢ ((⌊‘(1 / 𝐸)) ∈ ℕ₀ → ((⌊‘(1 / 𝐸)) + 1) ∈ ℕ)
73	71, 72	syl 18	. . . . 5 ⊢ (𝜑 → ((⌊‘(1 / 𝐸)) + 1) ∈ ℕ)
74	73	nnzd 12644	. . . 4 ⊢ (𝜑 → ((⌊‘(1 / 𝐸)) + 1) ∈ ℤ)
75	49, 74	eqeltrid 2866	. . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ)
76	49	recnnltrp 46193	. . . . . . . . . . . . 13 ⊢ (𝐸 ∈ ℝ⁺ → (𝑁 ∈ ℕ ∧ (1 / 𝑁) < 𝐸))
77	66, 76	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑁 ∈ ℕ ∧ (1 / 𝑁) < 𝐸))
78	77	simpld 500	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑁 ∈ ℕ)
79		uznnssnn 12947	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ → (ℤ_≥‘𝑁) ⊆ ℕ)
80	78, 79	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → (ℤ_≥‘𝑁) ⊆ ℕ)
81	40, 80	eqsstrid 3972	. . . . . . . . 9 ⊢ (𝜑 → 𝑍 ⊆ ℕ)
82	81	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑍 ⊆ ℕ)
83		simpr 490	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍)
84	82, 83	sseldd 3935	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ ℕ)
85		vonioolem1.d	. . . . . . . . 9 ⊢ 𝐷 = (𝑛 ∈ ℕ ↦ X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘)))
86	85	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 𝐷 = (𝑛 ∈ ℕ ↦ X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘))))
87	5	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑋 ∈ Fin)
88		eqid 2762	. . . . . . . . . 10 ⊢ dom (voln‘𝑋) = dom (voln‘𝑋)
89	18, 21	readdcld 11265	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ 𝑋) → ((𝐴‘𝑘) + (1 / 𝑛)) ∈ ℝ)
90	89	fmpttd 7111	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑘 ∈ 𝑋 ↦ ((𝐴‘𝑘) + (1 / 𝑛))):𝑋⟶ℝ)
91	8	feq1d 6688	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐶‘𝑛):𝑋⟶ℝ ↔ (𝑘 ∈ 𝑋 ↦ ((𝐴‘𝑘) + (1 / 𝑛))):𝑋⟶ℝ))
92	90, 91	mpbird 260	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐶‘𝑛):𝑋⟶ℝ)
93	12	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐵:𝑋⟶ℝ)
94	87, 88, 92, 93	hoimbl 47446	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘)) ∈ dom (voln‘𝑋))
95	94	elexd 3476	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘)) ∈ V)
96	86, 95	fvmpt2d 7004	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐷‘𝑛) = X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘)))
97	84, 96	syldan 603	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐷‘𝑛) = X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘)))
98	97	fveq2d 6886	. . . . 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 2762	. . . . . 6 ⊢ X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘)) = X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘))
104	99, 100, 101, 102, 103	vonn0hoi 47485	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((voln‘𝑋)‘X𝑘 ∈ 𝑋 (((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘))) = ∏𝑘 ∈ 𝑋 (vol‘(((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘))))
105	101	ffvelcdmda 7080	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → ((𝐶‘𝑛)‘𝑘) ∈ ℝ)
106	84, 14	syldanl 614	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (𝐵‘𝑘) ∈ ℝ)
107		volico 46798	. . . . . . . 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 12314	. . . . . . . . . . . 12 ⊢ (𝜑 → (1 / 𝑁) ∈ ℝ)
112	111	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (1 / 𝑁) ∈ ℝ)
113	35	adantlr 728	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ℝ)
114	40	eleq2i 2854	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ 𝑍 ↔ 𝑛 ∈ (ℤ_≥‘𝑁))
115	114	biimpi 219	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ 𝑍 → 𝑛 ∈ (ℤ_≥‘𝑁))
116		eluzle 12903	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → 𝑁 ≤ 𝑛)
117	115, 116	syl 18	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ 𝑍 → 𝑁 ≤ 𝑛)
118	117	adantl 487	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑁 ≤ 𝑛)
119	78	nnrpd 13086	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑁 ∈ ℝ⁺)
120	119	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑁 ∈ ℝ⁺)
121		nnrp 13056	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ⁺)
122	84, 121	syl 18	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ ℝ⁺)
123	120, 122	lerecd 13107	. . . . . . . . . . . . 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 3932	. . . . . . . . . . . . . 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 7451	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ 𝑋 → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ V)
135	52	elrnmpt1 5948	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 ∈ 𝑋 ∧ ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ V) → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))))
136	133, 134, 135	syl2anc 596	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ 𝑋 → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))))
137	136	adantl 487	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))))
138		infrefilb 12228	. . . . . . . . . . . . . . 15 ⊢ ((ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ⊆ ℝ ∧ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))) ∈ Fin ∧ ((𝐵‘𝑘) − (𝐴‘𝑘)) ∈ ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘)))) → inf(ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))), ℝ, < ) ≤ ((𝐵‘𝑘) − (𝐴‘𝑘)))
139	131, 132, 137, 138	syl3anc 1398	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → inf(ran (𝑘 ∈ 𝑋 ↦ ((𝐵‘𝑘) − (𝐴‘𝑘))), ℝ, < ) ≤ ((𝐵‘𝑘) − (𝐴‘𝑘)))
140	54, 139	eqbrtrid 5144	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → 𝐸 ≤ ((𝐵‘𝑘) − (𝐴‘𝑘)))
141	126, 128, 35, 130, 140	ltletrd 11397	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (1 / 𝑁) < ((𝐵‘𝑘) − (𝐴‘𝑘)))
142	141	adantlr 728	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (1 / 𝑁) < ((𝐵‘𝑘) − (𝐴‘𝑘)))
143	110, 112, 113, 125, 142	lelttrd 11395	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (1 / 𝑛) < ((𝐵‘𝑘) − (𝐴‘𝑘)))
144	84, 18	syldanl 614	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) ∈ ℝ)
145	144, 110, 106	ltaddsub2d 11842	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (((𝐴‘𝑘) + (1 / 𝑛)) < (𝐵‘𝑘) ↔ (1 / 𝑛) < ((𝐵‘𝑘) − (𝐴‘𝑘))))
146	143, 145	mpbird 260	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → ((𝐴‘𝑘) + (1 / 𝑛)) < (𝐵‘𝑘))
147	109, 146	eqbrtrd 5131	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → ((𝐶‘𝑛)‘𝑘) < (𝐵‘𝑘))
148	147	iftrued 4493	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → if(((𝐶‘𝑛)‘𝑘) < (𝐵‘𝑘), ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)), 0) = ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)))
149	108, 148	eqtrd 2797	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (vol‘(((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘))) = ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)))
150	149	prodeq2dv 16013	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ∏𝑘 ∈ 𝑋 (vol‘(((𝐶‘𝑛)‘𝑘)[,)(𝐵‘𝑘))) = ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)))
151	98, 104, 150	3eqtrd 2801	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((voln‘𝑋)‘(𝐷‘𝑛)) = ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)))
152		fvexd 6897	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((voln‘𝑋)‘(𝐷‘𝑛)) ∈ V)
153	45	fvmpt2 7002	. . . . 5 ⊢ ((𝑛 ∈ ℕ ∧ ((voln‘𝑋)‘(𝐷‘𝑛)) ∈ V) → (𝑆‘𝑛) = ((voln‘𝑋)‘(𝐷‘𝑛)))
154	84, 152, 153	syl2anc 596	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑆‘𝑛) = ((voln‘𝑋)‘(𝐷‘𝑛)))
155		prodex 15996	. . . . . 6 ⊢ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)) ∈ V
156	155	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)) ∈ V)
157	1	fvmpt2 7002	. . . . 5 ⊢ ((𝑛 ∈ ℕ ∧ ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)) ∈ V) → (𝑇‘𝑛) = ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)))
158	84, 156, 157	syl2anc 596	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑇‘𝑛) = ∏𝑘 ∈ 𝑋 ((𝐵‘𝑘) − ((𝐶‘𝑛)‘𝑘)))
159	151, 154, 158	3eqtr4rd 2808	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑇‘𝑛) = (𝑆‘𝑛))
160	40, 44, 48, 75, 159	climeq 15656	. 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 2957 Vcvv 3453 ⊆ wss 3902 ∅c0 4282 ifcif 4485 class class class wbr 5107 ↦ cmpt 5190 Or wor 5566 dom cdm 5659 ran crn 5660 ⟶wf 6533 ‘cfv 6537 (class class class)co 7416 Xcixp 8907 Fincfn 8955 infcinf 9414 ℝcr 11126 0cc0 11127 1c1 11128 + caddc 11130 < clt 11270 ≤ cle 11271 − cmin 11468 / cdiv 11898 ℕcn 12260 ℕ₀cn0 12531 ℤcz 12618 ℤ_≥cuz 12890 ℝ⁺crp 13044 [,)cico 13402 ⌊cfl 13853 ⇝ cli 15573 ∏cprod 15994 volcvol 25692 volncvoln 47353

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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-inf2 9623 ax-cc 10440 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 ax-pre-sup 11205

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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-disj 5075 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-of 7681 df-om 7866 df-1st 7989 df-2nd 7990 df-supp 8162 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8458 df-2o 8459 df-oadd 8462 df-omul 8463 df-er 8699 df-map 8831 df-pm 8832 df-ixp 8908 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-fsupp 9335 df-fi 9384 df-sup 9415 df-inf 9416 df-oi 9485 df-dju 9909 df-card 9947 df-acn 9950 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-div 11899 df-nn 12261 df-2 12330 df-3 12331 df-4 12332 df-5 12333 df-6 12334 df-7 12335 df-8 12336 df-9 12337 df-n0 12532 df-z 12619 df-dec 12740 df-uz 12891 df-q 13001 df-rp 13045 df-xneg 13165 df-xadd 13166 df-xmul 13167 df-ioo 13404 df-ico 13406 df-icc 13407 df-fz 13564 df-fzo 13712 df-fl 13855 df-seq 14068 df-exp 14128 df-hash 14397 df-cj 15188 df-re 15189 df-im 15190 df-sqrt 15324 df-abs 15325 df-clim 15577 df-rlim 15578 df-sum 15776 df-prod 15995 df-struct 17243 df-sets 17260 df-slot 17278 df-ndx 17290 df-base 17306 df-ress 17327 df-plusg 17359 df-mulr 17360 df-starv 17361 df-sca 17362 df-vsca 17363 df-ip 17364 df-tset 17365 df-ple 17366 df-ds 17368 df-unif 17369 df-hom 17370 df-cco 17371 df-rest 17511 df-topn 17512 df-0g 17530 df-gsum 17531 df-topgen 17532 df-pt 17533 df-prds 17536 df-xrs 17592 df-qtop 17597 df-imas 17598 df-xps 17600 df-mre 17674 df-mrc 17675 df-acs 17677 df-mgm 18734 df-sgrp 18823 df-mnd 18839 df-submnd 18893 df-mulg 19192 df-cntz 19445 df-cmn 19910 df-psmet 21578 df-xmet 21579 df-met 21580 df-bl 21581 df-mopn 21582 df-cnfld 21587 df-top 23120 df-topon 23137 df-topsp 23159 df-bases 23172 df-cn 23453 df-cnp 23454 df-cmp 23613 df-tx 23789 df-hmeo 23982 df-xms 24547 df-ms 24548 df-tms 24549 df-cncf 25107 df-ovol 25693 df-vol 25694 df-salg 47124 df-sumge0 47178 df-mea 47265 df-ome 47305 df-caragen 47307 df-ovoln 47352 df-voln 47354

This theorem is used by: vonioolem2 47496

W3C validator