Theorem ovolscalem1 24108

Description: Lemma for ovolsca 24110. (Contributed by Mario Carneiro, 6-Apr-2015.)

Hypotheses

Ref	Expression
ovolsca.1	⊢ (𝜑 → 𝐴 ⊆ ℝ)
ovolsca.2	⊢ (𝜑 → 𝐶 ∈ ℝ+)
ovolsca.3	⊢ (𝜑 → 𝐵 = {𝑥 ∈ ℝ ∣ (𝐶 · 𝑥) ∈ 𝐴})
ovolsca.4	⊢ (𝜑 → (vol*‘𝐴) ∈ ℝ)
ovolsca.5	⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹))
ovolsca.6	⊢ 𝐺 = (𝑛 ∈ ℕ ↦ ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩)
ovolsca.7	⊢ (𝜑 → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
ovolsca.8	⊢ (𝜑 → 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹))
ovolsca.9	⊢ (𝜑 → 𝑅 ∈ ℝ+)
ovolsca.10	⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)))

Assertion

Ref	Expression
ovolscalem1	⊢ (𝜑 → (vol*‘𝐵) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))

Distinct variable groups:   𝑥,𝑛,𝐴   𝐵,𝑛   𝑛,𝐹,𝑥   𝑛,𝐺   𝑥,𝑅   𝐶,𝑛,𝑥   𝜑,𝑛   𝑥,𝑆

Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥)   𝑅(𝑛)   𝑆(𝑛)   𝐺(𝑥)

Proof of Theorem ovolscalem1

Dummy variables 𝑘 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ovolsca.3	. . . 4 ⊢ (𝜑 → 𝐵 = {𝑥 ∈ ℝ ∣ (𝐶 · 𝑥) ∈ 𝐴})
2		ssrab2 4055	. . . 4 ⊢ {𝑥 ∈ ℝ ∣ (𝐶 · 𝑥) ∈ 𝐴} ⊆ ℝ
3	1, 2	eqsstrdi 4020	. . 3 ⊢ (𝜑 → 𝐵 ⊆ ℝ)
4		ovolcl 24073	. . 3 ⊢ (𝐵 ⊆ ℝ → (vol*‘𝐵) ∈ ℝ*)
5	3, 4	syl 17	. 2 ⊢ (𝜑 → (vol*‘𝐵) ∈ ℝ*)
6		ovolsca.7	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
7		ovolfcl 24061	. . . . . . . . . . . 12 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑛)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑛)) ≤ (2nd ‘(𝐹‘𝑛))))
8	6, 7	sylan 582	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑛)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑛)) ≤ (2nd ‘(𝐹‘𝑛))))
9	8	simp3d 1140	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1st ‘(𝐹‘𝑛)) ≤ (2nd ‘(𝐹‘𝑛)))
10	8	simp1d 1138	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1st ‘(𝐹‘𝑛)) ∈ ℝ)
11	8	simp2d 1139	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (2nd ‘(𝐹‘𝑛)) ∈ ℝ)
12		ovolsca.2	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐶 ∈ ℝ+)
13	12	rpregt0d 12431	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ 0 < 𝐶))
14	13	adantr 483	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐶 ∈ ℝ ∧ 0 < 𝐶))
15		lediv1 11499	. . . . . . . . . . 11 ⊢ (((1st ‘(𝐹‘𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑛)) ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((1st ‘(𝐹‘𝑛)) ≤ (2nd ‘(𝐹‘𝑛)) ↔ ((1st ‘(𝐹‘𝑛)) / 𝐶) ≤ ((2nd ‘(𝐹‘𝑛)) / 𝐶)))
16	10, 11, 14, 15	syl3anc 1367	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) ≤ (2nd ‘(𝐹‘𝑛)) ↔ ((1st ‘(𝐹‘𝑛)) / 𝐶) ≤ ((2nd ‘(𝐹‘𝑛)) / 𝐶)))
17	9, 16	mpbid 234	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) / 𝐶) ≤ ((2nd ‘(𝐹‘𝑛)) / 𝐶))
18		df-br 5059	. . . . . . . . 9 ⊢ (((1st ‘(𝐹‘𝑛)) / 𝐶) ≤ ((2nd ‘(𝐹‘𝑛)) / 𝐶) ↔ ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ ≤ )
19	17, 18	sylib 220	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ ≤ )
20	12	adantr 483	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐶 ∈ ℝ+)
21	10, 20	rerpdivcld 12456	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) / 𝐶) ∈ ℝ)
22	11, 20	rerpdivcld 12456	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((2nd ‘(𝐹‘𝑛)) / 𝐶) ∈ ℝ)
23	21, 22	opelxpd 5587	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ (ℝ × ℝ))
24	19, 23	elind 4170	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ ( ≤ ∩ (ℝ × ℝ)))
25		ovolsca.6	. . . . . . 7 ⊢ 𝐺 = (𝑛 ∈ ℕ ↦ ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩)
26	24, 25	fmptd 6872	. . . . . 6 ⊢ (𝜑 → 𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
27		eqid 2821	. . . . . . 7 ⊢ ((abs ∘ − ) ∘ 𝐺) = ((abs ∘ − ) ∘ 𝐺)
28		eqid 2821	. . . . . . 7 ⊢ seq1( + , ((abs ∘ − ) ∘ 𝐺)) = seq1( + , ((abs ∘ − ) ∘ 𝐺))
29	27, 28	ovolsf 24067	. . . . . 6 ⊢ (𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → seq1( + , ((abs ∘ − ) ∘ 𝐺)):ℕ⟶(0[,)+∞))
30	26, 29	syl 17	. . . . 5 ⊢ (𝜑 → seq1( + , ((abs ∘ − ) ∘ 𝐺)):ℕ⟶(0[,)+∞))
31	30	frnd 6515	. . . 4 ⊢ (𝜑 → ran seq1( + , ((abs ∘ − ) ∘ 𝐺)) ⊆ (0[,)+∞))
32		icossxr 12815	. . . 4 ⊢ (0[,)+∞) ⊆ ℝ*
33	31, 32	sstrdi 3978	. . 3 ⊢ (𝜑 → ran seq1( + , ((abs ∘ − ) ∘ 𝐺)) ⊆ ℝ*)
34		supxrcl 12702	. . 3 ⊢ (ran seq1( + , ((abs ∘ − ) ∘ 𝐺)) ⊆ ℝ* → sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ) ∈ ℝ*)
35	33, 34	syl 17	. 2 ⊢ (𝜑 → sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ) ∈ ℝ*)
36		ovolsca.4	. . . . 5 ⊢ (𝜑 → (vol*‘𝐴) ∈ ℝ)
37	36, 12	rerpdivcld 12456	. . . 4 ⊢ (𝜑 → ((vol*‘𝐴) / 𝐶) ∈ ℝ)
38		ovolsca.9	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ ℝ+)
39	38	rpred 12425	. . . 4 ⊢ (𝜑 → 𝑅 ∈ ℝ)
40	37, 39	readdcld 10664	. . 3 ⊢ (𝜑 → (((vol*‘𝐴) / 𝐶) + 𝑅) ∈ ℝ)
41	40	rexrd 10685	. 2 ⊢ (𝜑 → (((vol*‘𝐴) / 𝐶) + 𝑅) ∈ ℝ*)
42	1	eleq2d 2898	. . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ {𝑥 ∈ ℝ ∣ (𝐶 · 𝑥) ∈ 𝐴}))
43		oveq2 7158	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝐶 · 𝑥) = (𝐶 · 𝑦))
44	43	eleq1d 2897	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → ((𝐶 · 𝑥) ∈ 𝐴 ↔ (𝐶 · 𝑦) ∈ 𝐴))
45	44	elrab 3679	. . . . . . 7 ⊢ (𝑦 ∈ {𝑥 ∈ ℝ ∣ (𝐶 · 𝑥) ∈ 𝐴} ↔ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴))
46	42, 45	syl6bb 289	. . . . . 6 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↔ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)))
47		breq2 5062	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐶 · 𝑦) → ((1st ‘(𝐹‘𝑛)) < 𝑥 ↔ (1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦)))
48		breq1 5061	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐶 · 𝑦) → (𝑥 < (2nd ‘(𝐹‘𝑛)) ↔ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛))))
49	47, 48	anbi12d 632	. . . . . . . . . 10 ⊢ (𝑥 = (𝐶 · 𝑦) → (((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛))) ↔ ((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ∧ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛)))))
50	49	rexbidv 3297	. . . . . . . . 9 ⊢ (𝑥 = (𝐶 · 𝑦) → (∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛))) ↔ ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ∧ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛)))))
51		ovolsca.8	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹))
52		ovolsca.1	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
53		ovolfioo 24062	. . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐴 ⊆ ∪ ran ((,) ∘ 𝐹) ↔ ∀𝑥 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛)))))
54	52, 6, 53	syl2anc 586	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 ⊆ ∪ ran ((,) ∘ 𝐹) ↔ ∀𝑥 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛)))))
55	51, 54	mpbid 234	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛))))
56	55	adantr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) → ∀𝑥 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛))))
57		simprr 771	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) → (𝐶 · 𝑦) ∈ 𝐴)
58	50, 56, 57	rspcdva 3624	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) → ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ∧ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛))))
59		opex 5348	. . . . . . . . . . . . . . . 16 ⊢ ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ V
60	25	fvmpt2 6773	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 ∈ ℕ ∧ ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ V) → (𝐺‘𝑛) = ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩)
61	59, 60	mpan2 689	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → (𝐺‘𝑛) = ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩)
62	61	fveq2d 6668	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → (1st ‘(𝐺‘𝑛)) = (1st ‘⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩))
63		ovex 7183	. . . . . . . . . . . . . . 15 ⊢ ((1st ‘(𝐹‘𝑛)) / 𝐶) ∈ V
64		ovex 7183	. . . . . . . . . . . . . . 15 ⊢ ((2nd ‘(𝐹‘𝑛)) / 𝐶) ∈ V
65	63, 64	op1st 7691	. . . . . . . . . . . . . 14 ⊢ (1st ‘⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩) = ((1st ‘(𝐹‘𝑛)) / 𝐶)
66	62, 65	syl6eq 2872	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → (1st ‘(𝐺‘𝑛)) = ((1st ‘(𝐹‘𝑛)) / 𝐶))
67	66	adantl 484	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (1st ‘(𝐺‘𝑛)) = ((1st ‘(𝐹‘𝑛)) / 𝐶))
68	67	breq1d 5068	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐺‘𝑛)) < 𝑦 ↔ ((1st ‘(𝐹‘𝑛)) / 𝐶) < 𝑦))
69	10	adantlr 713	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (1st ‘(𝐹‘𝑛)) ∈ ℝ)
70		simplrl 775	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → 𝑦 ∈ ℝ)
71	14	adantlr 713	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (𝐶 ∈ ℝ ∧ 0 < 𝐶))
72		ltdivmul 11509	. . . . . . . . . . . 12 ⊢ (((1st ‘(𝐹‘𝑛)) ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (((1st ‘(𝐹‘𝑛)) / 𝐶) < 𝑦 ↔ (1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦)))
73	69, 70, 71, 72	syl3anc 1367	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (((1st ‘(𝐹‘𝑛)) / 𝐶) < 𝑦 ↔ (1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦)))
74	68, 73	bitr2d 282	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ↔ (1st ‘(𝐺‘𝑛)) < 𝑦))
75	11	adantlr 713	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (2nd ‘(𝐹‘𝑛)) ∈ ℝ)
76		ltmuldiv2 11508	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ ℝ ∧ (2nd ‘(𝐹‘𝑛)) ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛)) ↔ 𝑦 < ((2nd ‘(𝐹‘𝑛)) / 𝐶)))
77	70, 75, 71, 76	syl3anc 1367	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → ((𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛)) ↔ 𝑦 < ((2nd ‘(𝐹‘𝑛)) / 𝐶)))
78	61	fveq2d 6668	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → (2nd ‘(𝐺‘𝑛)) = (2nd ‘⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩))
79	63, 64	op2nd 7692	. . . . . . . . . . . . . 14 ⊢ (2nd ‘⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩) = ((2nd ‘(𝐹‘𝑛)) / 𝐶)
80	78, 79	syl6eq 2872	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → (2nd ‘(𝐺‘𝑛)) = ((2nd ‘(𝐹‘𝑛)) / 𝐶))
81	80	adantl 484	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (2nd ‘(𝐺‘𝑛)) = ((2nd ‘(𝐹‘𝑛)) / 𝐶))
82	81	breq2d 5070	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (𝑦 < (2nd ‘(𝐺‘𝑛)) ↔ 𝑦 < ((2nd ‘(𝐹‘𝑛)) / 𝐶)))
83	77, 82	bitr4d 284	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → ((𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛)) ↔ 𝑦 < (2nd ‘(𝐺‘𝑛))))
84	74, 83	anbi12d 632	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ∧ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛))) ↔ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
85	84	rexbidva 3296	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) → (∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ∧ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛))) ↔ ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
86	58, 85	mpbid 234	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) → ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛))))
87	86	ex 415	. . . . . 6 ⊢ (𝜑 → ((𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴) → ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
88	46, 87	sylbid 242	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐵 → ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
89	88	ralrimiv 3181	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛))))
90		ovolfioo 24062	. . . . 5 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐵 ⊆ ∪ ran ((,) ∘ 𝐺) ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
91	3, 26, 90	syl2anc 586	. . . 4 ⊢ (𝜑 → (𝐵 ⊆ ∪ ran ((,) ∘ 𝐺) ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
92	89, 91	mpbird 259	. . 3 ⊢ (𝜑 → 𝐵 ⊆ ∪ ran ((,) ∘ 𝐺))
93	28	ovollb 24074	. . 3 ⊢ ((𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐵 ⊆ ∪ ran ((,) ∘ 𝐺)) → (vol*‘𝐵) ≤ sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ))
94	26, 92, 93	syl2anc 586	. 2 ⊢ (𝜑 → (vol*‘𝐵) ≤ sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ))
95		fzfid 13335	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (1...𝑘) ∈ Fin)
96	12	rpcnd 12427	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℂ)
97	96	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐶 ∈ ℂ)
98		simpl 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝜑)
99		elfznn 12930	. . . . . . . . . 10 ⊢ (𝑛 ∈ (1...𝑘) → 𝑛 ∈ ℕ)
100	11, 10	resubcld 11062	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ∈ ℝ)
101	98, 99, 100	syl2an 597	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...𝑘)) → ((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ∈ ℝ)
102	101	recnd 10663	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...𝑘)) → ((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ∈ ℂ)
103	12	rpne0d 12430	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ≠ 0)
104	103	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐶 ≠ 0)
105	95, 97, 102, 104	fsumdivc 15135	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) = Σ𝑛 ∈ (1...𝑘)(((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶))
106	80, 66	oveq12d 7168	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ → ((2nd ‘(𝐺‘𝑛)) − (1st ‘(𝐺‘𝑛))) = (((2nd ‘(𝐹‘𝑛)) / 𝐶) − ((1st ‘(𝐹‘𝑛)) / 𝐶)))
107	106	adantl 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((2nd ‘(𝐺‘𝑛)) − (1st ‘(𝐺‘𝑛))) = (((2nd ‘(𝐹‘𝑛)) / 𝐶) − ((1st ‘(𝐹‘𝑛)) / 𝐶)))
108	27	ovolfsval 24065	. . . . . . . . . . 11 ⊢ ((𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐺)‘𝑛) = ((2nd ‘(𝐺‘𝑛)) − (1st ‘(𝐺‘𝑛))))
109	26, 108	sylan 582	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐺)‘𝑛) = ((2nd ‘(𝐺‘𝑛)) − (1st ‘(𝐺‘𝑛))))
110	11	recnd 10663	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (2nd ‘(𝐹‘𝑛)) ∈ ℂ)
111	10	recnd 10663	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1st ‘(𝐹‘𝑛)) ∈ ℂ)
112	12	rpcnne0d 12434	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 ∈ ℂ ∧ 𝐶 ≠ 0))
113	112	adantr 483	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐶 ∈ ℂ ∧ 𝐶 ≠ 0))
114		divsubdir 11328	. . . . . . . . . . 11 ⊢ (((2nd ‘(𝐹‘𝑛)) ∈ ℂ ∧ (1st ‘(𝐹‘𝑛)) ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 ≠ 0)) → (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) = (((2nd ‘(𝐹‘𝑛)) / 𝐶) − ((1st ‘(𝐹‘𝑛)) / 𝐶)))
115	110, 111, 113, 114	syl3anc 1367	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) = (((2nd ‘(𝐹‘𝑛)) / 𝐶) − ((1st ‘(𝐹‘𝑛)) / 𝐶)))
116	107, 109, 115	3eqtr4d 2866	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐺)‘𝑛) = (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶))
117	98, 99, 116	syl2an 597	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...𝑘)) → (((abs ∘ − ) ∘ 𝐺)‘𝑛) = (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶))
118		simpr 487	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℕ)
119		nnuz 12275	. . . . . . . . 9 ⊢ ℕ = (ℤ≥‘1)
120	118, 119	eleqtrdi 2923	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ (ℤ≥‘1))
121	100, 20	rerpdivcld 12456	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ∈ ℝ)
122	121	recnd 10663	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ∈ ℂ)
123	98, 99, 122	syl2an 597	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...𝑘)) → (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ∈ ℂ)
124	117, 120, 123	fsumser 15081	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → Σ𝑛 ∈ (1...𝑘)(((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) = (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘))
125	105, 124	eqtrd 2856	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) = (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘))
126		ovolsca.10	. . . . . . . . . . 11 ⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)))
127		eqid 2821	. . . . . . . . . . . . . . . 16 ⊢ ((abs ∘ − ) ∘ 𝐹) = ((abs ∘ − ) ∘ 𝐹)
128		ovolsca.5	. . . . . . . . . . . . . . . 16 ⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹))
129	127, 128	ovolsf 24067	. . . . . . . . . . . . . . 15 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → 𝑆:ℕ⟶(0[,)+∞))
130	6, 129	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑆:ℕ⟶(0[,)+∞))
131	130	frnd 6515	. . . . . . . . . . . . 13 ⊢ (𝜑 → ran 𝑆 ⊆ (0[,)+∞))
132	131, 32	sstrdi 3978	. . . . . . . . . . . 12 ⊢ (𝜑 → ran 𝑆 ⊆ ℝ*)
133	12, 38	rpmulcld 12441	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐶 · 𝑅) ∈ ℝ+)
134	133	rpred 12425	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐶 · 𝑅) ∈ ℝ)
135	36, 134	readdcld 10664	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((vol*‘𝐴) + (𝐶 · 𝑅)) ∈ ℝ)
136	135	rexrd 10685	. . . . . . . . . . . 12 ⊢ (𝜑 → ((vol*‘𝐴) + (𝐶 · 𝑅)) ∈ ℝ*)
137		supxrleub 12713	. . . . . . . . . . . 12 ⊢ ((ran 𝑆 ⊆ ℝ* ∧ ((vol*‘𝐴) + (𝐶 · 𝑅)) ∈ ℝ*) → (sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)) ↔ ∀𝑥 ∈ ran 𝑆 𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅))))
138	132, 136, 137	syl2anc 586	. . . . . . . . . . 11 ⊢ (𝜑 → (sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)) ↔ ∀𝑥 ∈ ran 𝑆 𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅))))
139	126, 138	mpbid 234	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑥 ∈ ran 𝑆 𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)))
140	130	ffnd 6509	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑆 Fn ℕ)
141		breq1 5061	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝑆‘𝑘) → (𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)) ↔ (𝑆‘𝑘) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅))))
142	141	ralrn 6848	. . . . . . . . . . 11 ⊢ (𝑆 Fn ℕ → (∀𝑥 ∈ ran 𝑆 𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)) ↔ ∀𝑘 ∈ ℕ (𝑆‘𝑘) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅))))
143	140, 142	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (∀𝑥 ∈ ran 𝑆 𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)) ↔ ∀𝑘 ∈ ℕ (𝑆‘𝑘) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅))))
144	139, 143	mpbid 234	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑘 ∈ ℕ (𝑆‘𝑘) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)))
145	144	r19.21bi 3208	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝑆‘𝑘) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)))
146	6	adantr 483	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
147	127	ovolfsval 24065	. . . . . . . . . . 11 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐹)‘𝑛) = ((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))))
148	146, 99, 147	syl2an 597	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...𝑘)) → (((abs ∘ − ) ∘ 𝐹)‘𝑛) = ((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))))
149	148, 120, 102	fsumser 15081	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) = (seq1( + , ((abs ∘ − ) ∘ 𝐹))‘𝑘))
150	128	fveq1i 6665	. . . . . . . . 9 ⊢ (𝑆‘𝑘) = (seq1( + , ((abs ∘ − ) ∘ 𝐹))‘𝑘)
151	149, 150	syl6eqr 2874	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) = (𝑆‘𝑘))
152	37	recnd 10663	. . . . . . . . . . 11 ⊢ (𝜑 → ((vol*‘𝐴) / 𝐶) ∈ ℂ)
153	38	rpcnd 12427	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ ℂ)
154	96, 152, 153	adddid 10659	. . . . . . . . . 10 ⊢ (𝜑 → (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅)) = ((𝐶 · ((vol*‘𝐴) / 𝐶)) + (𝐶 · 𝑅)))
155	36	recnd 10663	. . . . . . . . . . . 12 ⊢ (𝜑 → (vol*‘𝐴) ∈ ℂ)
156	155, 96, 103	divcan2d 11412	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐶 · ((vol*‘𝐴) / 𝐶)) = (vol*‘𝐴))
157	156	oveq1d 7165	. . . . . . . . . 10 ⊢ (𝜑 → ((𝐶 · ((vol*‘𝐴) / 𝐶)) + (𝐶 · 𝑅)) = ((vol*‘𝐴) + (𝐶 · 𝑅)))
158	154, 157	eqtrd 2856	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅)) = ((vol*‘𝐴) + (𝐶 · 𝑅)))
159	158	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅)) = ((vol*‘𝐴) + (𝐶 · 𝑅)))
160	145, 151, 159	3brtr4d 5090	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ≤ (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅)))
161	95, 101	fsumrecl 15085	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ∈ ℝ)
162	40	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (((vol*‘𝐴) / 𝐶) + 𝑅) ∈ ℝ)
163	13	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐶 ∈ ℝ ∧ 0 < 𝐶))
164		ledivmul 11510	. . . . . . . 8 ⊢ ((Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ∈ ℝ ∧ (((vol*‘𝐴) / 𝐶) + 𝑅) ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ≤ (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅))))
165	161, 162, 163, 164	syl3anc 1367	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ≤ (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅))))
166	160, 165	mpbird 259	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))
167	125, 166	eqbrtrrd 5082	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))
168	167	ralrimiva 3182	. . . 4 ⊢ (𝜑 → ∀𝑘 ∈ ℕ (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))
169	30	ffnd 6509	. . . . 5 ⊢ (𝜑 → seq1( + , ((abs ∘ − ) ∘ 𝐺)) Fn ℕ)
170		breq1 5061	. . . . . 6 ⊢ (𝑦 = (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) → (𝑦 ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅)))
171	170	ralrn 6848	. . . . 5 ⊢ (seq1( + , ((abs ∘ − ) ∘ 𝐺)) Fn ℕ → (∀𝑦 ∈ ran seq1( + , ((abs ∘ − ) ∘ 𝐺))𝑦 ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ ∀𝑘 ∈ ℕ (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅)))
172	169, 171	syl 17	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ ran seq1( + , ((abs ∘ − ) ∘ 𝐺))𝑦 ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ ∀𝑘 ∈ ℕ (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅)))
173	168, 172	mpbird 259	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ ran seq1( + , ((abs ∘ − ) ∘ 𝐺))𝑦 ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))
174		supxrleub 12713	. . . 4 ⊢ ((ran seq1( + , ((abs ∘ − ) ∘ 𝐺)) ⊆ ℝ* ∧ (((vol*‘𝐴) / 𝐶) + 𝑅) ∈ ℝ*) → (sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ ∀𝑦 ∈ ran seq1( + , ((abs ∘ − ) ∘ 𝐺))𝑦 ≤ (((vol*‘𝐴) / 𝐶) + 𝑅)))
175	33, 41, 174	syl2anc 586	. . 3 ⊢ (𝜑 → (sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ ∀𝑦 ∈ ran seq1( + , ((abs ∘ − ) ∘ 𝐺))𝑦 ≤ (((vol*‘𝐴) / 𝐶) + 𝑅)))
176	173, 175	mpbird 259	. 2 ⊢ (𝜑 → sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))
177	5, 35, 41, 94, 176	xrletrd 12549	1 ⊢ (𝜑 → (vol*‘𝐵) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1533   ∈ wcel 2110   ≠ wne 3016  ∀wral 3138  ∃wrex 3139  {crab 3142  Vcvv 3494   ∩ cin 3934   ⊆ wss 3935  ⟨cop 4566  ∪ cuni 4831   class class class wbr 5058   ↦ cmpt 5138   × cxp 5547  ran crn 5550   ∘ ccom 5553   Fn wfn 6344  ⟶wf 6345  ‘cfv 6349  (class class class)co 7150  1^st c1st 7681  2^nd c2nd 7682  supcsup 8898  ℂcc 10529  ℝcr 10530  0cc0 10531  1c1 10532   + caddc 10534   · cmul 10536  +∞cpnf 10666  ℝ^*cxr 10668   < clt 10669   ≤ cle 10670   − cmin 10864   / cdiv 11291  ℕcn 11632  ℤ_≥cuz 12237  ℝ⁺crp 12383  (,)cioo 12732  [,)cico 12734  ...cfz 12886  seqcseq 13363  abscabs 14587  Σcsu 15036  vol*covol 24057

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5182  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455  ax-inf2 9098  ax-cnex 10587  ax-resscn 10588  ax-1cn 10589  ax-icn 10590  ax-addcl 10591  ax-addrcl 10592  ax-mulcl 10593  ax-mulrcl 10594  ax-mulcom 10595  ax-addass 10596  ax-mulass 10597  ax-distr 10598  ax-i2m1 10599  ax-1ne0 10600  ax-1rid 10601  ax-rnegex 10602  ax-rrecex 10603  ax-cnre 10604  ax-pre-lttri 10605  ax-pre-lttrn 10606  ax-pre-ltadd 10607  ax-pre-mulgt0 10608  ax-pre-sup 10609

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-fal 1546  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-tp 4565  df-op 4567  df-uni 4832  df-int 4869  df-iun 4913  df-br 5059  df-opab 5121  df-mpt 5139  df-tr 5165  df-id 5454  df-eprel 5459  df-po 5468  df-so 5469  df-fr 5508  df-se 5509  df-we 5510  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-pred 6142  df-ord 6188  df-on 6189  df-lim 6190  df-suc 6191  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-isom 6358  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-om 7575  df-1st 7683  df-2nd 7684  df-wrecs 7941  df-recs 8002  df-rdg 8040  df-1o 8096  df-oadd 8100  df-er 8283  df-map 8402  df-en 8504  df-dom 8505  df-sdom 8506  df-fin 8507  df-sup 8900  df-inf 8901  df-oi 8968  df-card 9362  df-pnf 10671  df-mnf 10672  df-xr 10673  df-ltxr 10674  df-le 10675  df-sub 10866  df-neg 10867  df-div 11292  df-nn 11633  df-2 11694  df-3 11695  df-n0 11892  df-z 11976  df-uz 12238  df-rp 12384  df-ioo 12736  df-ico 12738  df-fz 12887  df-fzo 13028  df-seq 13364  df-exp 13424  df-hash 13685  df-cj 14452  df-re 14453  df-im 14454  df-sqrt 14588  df-abs 14589  df-clim 14839  df-sum 15037  df-ovol 24059

This theorem is referenced by:  ovolscalem2  24109