Theorem ovolscalem1 24117

Description: Lemma for ovolsca 24119. (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 4007	. . . 4 ⊢ {𝑥 ∈ ℝ ∣ (𝐶 · 𝑥) ∈ 𝐴} ⊆ ℝ
3	1, 2	eqsstrdi 3969	. . 3 ⊢ (𝜑 → 𝐵 ⊆ ℝ)
4		ovolcl 24082	. . 3 ⊢ (𝐵 ⊆ ℝ → (vol*‘𝐵) ∈ ℝ*)
5	3, 4	syl 17	. 2 ⊢ (𝜑 → (vol*‘𝐵) ∈ ℝ*)
6		ovolsca.7	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
7		ovolfcl 24070	. . . . . . . . . . . 12 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑛)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑛)) ≤ (2nd ‘(𝐹‘𝑛))))
8	6, 7	sylan 583	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑛)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑛)) ≤ (2nd ‘(𝐹‘𝑛))))
9	8	simp3d 1141	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1st ‘(𝐹‘𝑛)) ≤ (2nd ‘(𝐹‘𝑛)))
10	8	simp1d 1139	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1st ‘(𝐹‘𝑛)) ∈ ℝ)
11	8	simp2d 1140	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (2nd ‘(𝐹‘𝑛)) ∈ ℝ)
12		ovolsca.2	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐶 ∈ ℝ+)
13	12	rpregt0d 12425	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ 0 < 𝐶))
14	13	adantr 484	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐶 ∈ ℝ ∧ 0 < 𝐶))
15		lediv1 11494	. . . . . . . . . . 11 ⊢ (((1st ‘(𝐹‘𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑛)) ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((1st ‘(𝐹‘𝑛)) ≤ (2nd ‘(𝐹‘𝑛)) ↔ ((1st ‘(𝐹‘𝑛)) / 𝐶) ≤ ((2nd ‘(𝐹‘𝑛)) / 𝐶)))
16	10, 11, 14, 15	syl3anc 1368	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) ≤ (2nd ‘(𝐹‘𝑛)) ↔ ((1st ‘(𝐹‘𝑛)) / 𝐶) ≤ ((2nd ‘(𝐹‘𝑛)) / 𝐶)))
17	9, 16	mpbid 235	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) / 𝐶) ≤ ((2nd ‘(𝐹‘𝑛)) / 𝐶))
18		df-br 5031	. . . . . . . . 9 ⊢ (((1st ‘(𝐹‘𝑛)) / 𝐶) ≤ ((2nd ‘(𝐹‘𝑛)) / 𝐶) ↔ ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ ≤ )
19	17, 18	sylib 221	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ ≤ )
20	12	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐶 ∈ ℝ+)
21	10, 20	rerpdivcld 12450	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) / 𝐶) ∈ ℝ)
22	11, 20	rerpdivcld 12450	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((2nd ‘(𝐹‘𝑛)) / 𝐶) ∈ ℝ)
23	21, 22	opelxpd 5557	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ (ℝ × ℝ))
24	19, 23	elind 4121	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ ( ≤ ∩ (ℝ × ℝ)))
25		ovolsca.6	. . . . . . 7 ⊢ 𝐺 = (𝑛 ∈ ℕ ↦ ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩)
26	24, 25	fmptd 6855	. . . . . 6 ⊢ (𝜑 → 𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
27		eqid 2798	. . . . . . 7 ⊢ ((abs ∘ − ) ∘ 𝐺) = ((abs ∘ − ) ∘ 𝐺)
28		eqid 2798	. . . . . . 7 ⊢ seq1( + , ((abs ∘ − ) ∘ 𝐺)) = seq1( + , ((abs ∘ − ) ∘ 𝐺))
29	27, 28	ovolsf 24076	. . . . . 6 ⊢ (𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → seq1( + , ((abs ∘ − ) ∘ 𝐺)):ℕ⟶(0[,)+∞))
30	26, 29	syl 17	. . . . 5 ⊢ (𝜑 → seq1( + , ((abs ∘ − ) ∘ 𝐺)):ℕ⟶(0[,)+∞))
31	30	frnd 6494	. . . 4 ⊢ (𝜑 → ran seq1( + , ((abs ∘ − ) ∘ 𝐺)) ⊆ (0[,)+∞))
32		icossxr 12810	. . . 4 ⊢ (0[,)+∞) ⊆ ℝ*
33	31, 32	sstrdi 3927	. . 3 ⊢ (𝜑 → ran seq1( + , ((abs ∘ − ) ∘ 𝐺)) ⊆ ℝ*)
34		supxrcl 12696	. . 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 12450	. . . 4 ⊢ (𝜑 → ((vol*‘𝐴) / 𝐶) ∈ ℝ)
38		ovolsca.9	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ ℝ+)
39	38	rpred 12419	. . . 4 ⊢ (𝜑 → 𝑅 ∈ ℝ)
40	37, 39	readdcld 10659	. . 3 ⊢ (𝜑 → (((vol*‘𝐴) / 𝐶) + 𝑅) ∈ ℝ)
41	40	rexrd 10680	. 2 ⊢ (𝜑 → (((vol*‘𝐴) / 𝐶) + 𝑅) ∈ ℝ*)
42	1	eleq2d 2875	. . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ {𝑥 ∈ ℝ ∣ (𝐶 · 𝑥) ∈ 𝐴}))
43		oveq2 7143	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝐶 · 𝑥) = (𝐶 · 𝑦))
44	43	eleq1d 2874	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → ((𝐶 · 𝑥) ∈ 𝐴 ↔ (𝐶 · 𝑦) ∈ 𝐴))
45	44	elrab 3628	. . . . . . 7 ⊢ (𝑦 ∈ {𝑥 ∈ ℝ ∣ (𝐶 · 𝑥) ∈ 𝐴} ↔ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴))
46	42, 45	syl6bb 290	. . . . . 6 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↔ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)))
47		breq2 5034	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐶 · 𝑦) → ((1st ‘(𝐹‘𝑛)) < 𝑥 ↔ (1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦)))
48		breq1 5033	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐶 · 𝑦) → (𝑥 < (2nd ‘(𝐹‘𝑛)) ↔ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛))))
49	47, 48	anbi12d 633	. . . . . . . . . 10 ⊢ (𝑥 = (𝐶 · 𝑦) → (((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛))) ↔ ((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ∧ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛)))))
50	49	rexbidv 3256	. . . . . . . . 9 ⊢ (𝑥 = (𝐶 · 𝑦) → (∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛))) ↔ ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ∧ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛)))))
51		ovolsca.8	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹))
52		ovolsca.1	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
53		ovolfioo 24071	. . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐴 ⊆ ∪ ran ((,) ∘ 𝐹) ↔ ∀𝑥 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛)))))
54	52, 6, 53	syl2anc 587	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 ⊆ ∪ ran ((,) ∘ 𝐹) ↔ ∀𝑥 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛)))))
55	51, 54	mpbid 235	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛))))
56	55	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) → ∀𝑥 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛))))
57		simprr 772	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) → (𝐶 · 𝑦) ∈ 𝐴)
58	50, 56, 57	rspcdva 3573	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) → ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ∧ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛))))
59		opex 5321	. . . . . . . . . . . . . . . 16 ⊢ ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ V
60	25	fvmpt2 6756	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 ∈ ℕ ∧ ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ V) → (𝐺‘𝑛) = ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩)
61	59, 60	mpan2 690	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → (𝐺‘𝑛) = ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩)
62	61	fveq2d 6649	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → (1st ‘(𝐺‘𝑛)) = (1st ‘⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩))
63		ovex 7168	. . . . . . . . . . . . . . 15 ⊢ ((1st ‘(𝐹‘𝑛)) / 𝐶) ∈ V
64		ovex 7168	. . . . . . . . . . . . . . 15 ⊢ ((2nd ‘(𝐹‘𝑛)) / 𝐶) ∈ V
65	63, 64	op1st 7679	. . . . . . . . . . . . . 14 ⊢ (1st ‘⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩) = ((1st ‘(𝐹‘𝑛)) / 𝐶)
66	62, 65	eqtrdi 2849	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → (1st ‘(𝐺‘𝑛)) = ((1st ‘(𝐹‘𝑛)) / 𝐶))
67	66	adantl 485	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (1st ‘(𝐺‘𝑛)) = ((1st ‘(𝐹‘𝑛)) / 𝐶))
68	67	breq1d 5040	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐺‘𝑛)) < 𝑦 ↔ ((1st ‘(𝐹‘𝑛)) / 𝐶) < 𝑦))
69	10	adantlr 714	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (1st ‘(𝐹‘𝑛)) ∈ ℝ)
70		simplrl 776	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → 𝑦 ∈ ℝ)
71	14	adantlr 714	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (𝐶 ∈ ℝ ∧ 0 < 𝐶))
72		ltdivmul 11504	. . . . . . . . . . . 12 ⊢ (((1st ‘(𝐹‘𝑛)) ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (((1st ‘(𝐹‘𝑛)) / 𝐶) < 𝑦 ↔ (1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦)))
73	69, 70, 71, 72	syl3anc 1368	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (((1st ‘(𝐹‘𝑛)) / 𝐶) < 𝑦 ↔ (1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦)))
74	68, 73	bitr2d 283	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ↔ (1st ‘(𝐺‘𝑛)) < 𝑦))
75	11	adantlr 714	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (2nd ‘(𝐹‘𝑛)) ∈ ℝ)
76		ltmuldiv2 11503	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ ℝ ∧ (2nd ‘(𝐹‘𝑛)) ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛)) ↔ 𝑦 < ((2nd ‘(𝐹‘𝑛)) / 𝐶)))
77	70, 75, 71, 76	syl3anc 1368	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → ((𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛)) ↔ 𝑦 < ((2nd ‘(𝐹‘𝑛)) / 𝐶)))
78	61	fveq2d 6649	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → (2nd ‘(𝐺‘𝑛)) = (2nd ‘⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩))
79	63, 64	op2nd 7680	. . . . . . . . . . . . . 14 ⊢ (2nd ‘⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩) = ((2nd ‘(𝐹‘𝑛)) / 𝐶)
80	78, 79	eqtrdi 2849	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → (2nd ‘(𝐺‘𝑛)) = ((2nd ‘(𝐹‘𝑛)) / 𝐶))
81	80	adantl 485	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (2nd ‘(𝐺‘𝑛)) = ((2nd ‘(𝐹‘𝑛)) / 𝐶))
82	81	breq2d 5042	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (𝑦 < (2nd ‘(𝐺‘𝑛)) ↔ 𝑦 < ((2nd ‘(𝐹‘𝑛)) / 𝐶)))
83	77, 82	bitr4d 285	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → ((𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛)) ↔ 𝑦 < (2nd ‘(𝐺‘𝑛))))
84	74, 83	anbi12d 633	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ∧ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛))) ↔ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
85	84	rexbidva 3255	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) → (∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ∧ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛))) ↔ ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
86	58, 85	mpbid 235	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) → ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛))))
87	86	ex 416	. . . . . 6 ⊢ (𝜑 → ((𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴) → ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
88	46, 87	sylbid 243	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐵 → ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
89	88	ralrimiv 3148	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛))))
90		ovolfioo 24071	. . . . 5 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐵 ⊆ ∪ ran ((,) ∘ 𝐺) ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
91	3, 26, 90	syl2anc 587	. . . 4 ⊢ (𝜑 → (𝐵 ⊆ ∪ ran ((,) ∘ 𝐺) ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
92	89, 91	mpbird 260	. . 3 ⊢ (𝜑 → 𝐵 ⊆ ∪ ran ((,) ∘ 𝐺))
93	28	ovollb 24083	. . 3 ⊢ ((𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐵 ⊆ ∪ ran ((,) ∘ 𝐺)) → (vol*‘𝐵) ≤ sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ))
94	26, 92, 93	syl2anc 587	. 2 ⊢ (𝜑 → (vol*‘𝐵) ≤ sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ))
95		fzfid 13336	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (1...𝑘) ∈ Fin)
96	12	rpcnd 12421	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℂ)
97	96	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐶 ∈ ℂ)
98		simpl 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝜑)
99		elfznn 12931	. . . . . . . . . 10 ⊢ (𝑛 ∈ (1...𝑘) → 𝑛 ∈ ℕ)
100	11, 10	resubcld 11057	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ∈ ℝ)
101	98, 99, 100	syl2an 598	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...𝑘)) → ((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ∈ ℝ)
102	101	recnd 10658	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...𝑘)) → ((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ∈ ℂ)
103	12	rpne0d 12424	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ≠ 0)
104	103	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐶 ≠ 0)
105	95, 97, 102, 104	fsumdivc 15133	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) = Σ𝑛 ∈ (1...𝑘)(((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶))
106	80, 66	oveq12d 7153	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ → ((2nd ‘(𝐺‘𝑛)) − (1st ‘(𝐺‘𝑛))) = (((2nd ‘(𝐹‘𝑛)) / 𝐶) − ((1st ‘(𝐹‘𝑛)) / 𝐶)))
107	106	adantl 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((2nd ‘(𝐺‘𝑛)) − (1st ‘(𝐺‘𝑛))) = (((2nd ‘(𝐹‘𝑛)) / 𝐶) − ((1st ‘(𝐹‘𝑛)) / 𝐶)))
108	27	ovolfsval 24074	. . . . . . . . . . 11 ⊢ ((𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐺)‘𝑛) = ((2nd ‘(𝐺‘𝑛)) − (1st ‘(𝐺‘𝑛))))
109	26, 108	sylan 583	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐺)‘𝑛) = ((2nd ‘(𝐺‘𝑛)) − (1st ‘(𝐺‘𝑛))))
110	11	recnd 10658	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (2nd ‘(𝐹‘𝑛)) ∈ ℂ)
111	10	recnd 10658	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1st ‘(𝐹‘𝑛)) ∈ ℂ)
112	12	rpcnne0d 12428	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 ∈ ℂ ∧ 𝐶 ≠ 0))
113	112	adantr 484	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐶 ∈ ℂ ∧ 𝐶 ≠ 0))
114		divsubdir 11323	. . . . . . . . . . 11 ⊢ (((2nd ‘(𝐹‘𝑛)) ∈ ℂ ∧ (1st ‘(𝐹‘𝑛)) ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 ≠ 0)) → (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) = (((2nd ‘(𝐹‘𝑛)) / 𝐶) − ((1st ‘(𝐹‘𝑛)) / 𝐶)))
115	110, 111, 113, 114	syl3anc 1368	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) = (((2nd ‘(𝐹‘𝑛)) / 𝐶) − ((1st ‘(𝐹‘𝑛)) / 𝐶)))
116	107, 109, 115	3eqtr4d 2843	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐺)‘𝑛) = (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶))
117	98, 99, 116	syl2an 598	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...𝑘)) → (((abs ∘ − ) ∘ 𝐺)‘𝑛) = (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶))
118		simpr 488	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℕ)
119		nnuz 12269	. . . . . . . . 9 ⊢ ℕ = (ℤ≥‘1)
120	118, 119	eleqtrdi 2900	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ (ℤ≥‘1))
121	100, 20	rerpdivcld 12450	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ∈ ℝ)
122	121	recnd 10658	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ∈ ℂ)
123	98, 99, 122	syl2an 598	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...𝑘)) → (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ∈ ℂ)
124	117, 120, 123	fsumser 15079	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → Σ𝑛 ∈ (1...𝑘)(((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) = (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘))
125	105, 124	eqtrd 2833	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) = (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘))
126		ovolsca.10	. . . . . . . . . . 11 ⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)))
127		eqid 2798	. . . . . . . . . . . . . . . 16 ⊢ ((abs ∘ − ) ∘ 𝐹) = ((abs ∘ − ) ∘ 𝐹)
128		ovolsca.5	. . . . . . . . . . . . . . . 16 ⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹))
129	127, 128	ovolsf 24076	. . . . . . . . . . . . . . 15 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → 𝑆:ℕ⟶(0[,)+∞))
130	6, 129	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑆:ℕ⟶(0[,)+∞))
131	130	frnd 6494	. . . . . . . . . . . . 13 ⊢ (𝜑 → ran 𝑆 ⊆ (0[,)+∞))
132	131, 32	sstrdi 3927	. . . . . . . . . . . 12 ⊢ (𝜑 → ran 𝑆 ⊆ ℝ*)
133	12, 38	rpmulcld 12435	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐶 · 𝑅) ∈ ℝ+)
134	133	rpred 12419	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐶 · 𝑅) ∈ ℝ)
135	36, 134	readdcld 10659	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((vol*‘𝐴) + (𝐶 · 𝑅)) ∈ ℝ)
136	135	rexrd 10680	. . . . . . . . . . . 12 ⊢ (𝜑 → ((vol*‘𝐴) + (𝐶 · 𝑅)) ∈ ℝ*)
137		supxrleub 12707	. . . . . . . . . . . 12 ⊢ ((ran 𝑆 ⊆ ℝ* ∧ ((vol*‘𝐴) + (𝐶 · 𝑅)) ∈ ℝ*) → (sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)) ↔ ∀𝑥 ∈ ran 𝑆 𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅))))
138	132, 136, 137	syl2anc 587	. . . . . . . . . . 11 ⊢ (𝜑 → (sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)) ↔ ∀𝑥 ∈ ran 𝑆 𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅))))
139	126, 138	mpbid 235	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑥 ∈ ran 𝑆 𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)))
140	130	ffnd 6488	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑆 Fn ℕ)
141		breq1 5033	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝑆‘𝑘) → (𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)) ↔ (𝑆‘𝑘) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅))))
142	141	ralrn 6831	. . . . . . . . . . 11 ⊢ (𝑆 Fn ℕ → (∀𝑥 ∈ ran 𝑆 𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)) ↔ ∀𝑘 ∈ ℕ (𝑆‘𝑘) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅))))
143	140, 142	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (∀𝑥 ∈ ran 𝑆 𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)) ↔ ∀𝑘 ∈ ℕ (𝑆‘𝑘) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅))))
144	139, 143	mpbid 235	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑘 ∈ ℕ (𝑆‘𝑘) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)))
145	144	r19.21bi 3173	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝑆‘𝑘) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)))
146	6	adantr 484	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
147	127	ovolfsval 24074	. . . . . . . . . . 11 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐹)‘𝑛) = ((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))))
148	146, 99, 147	syl2an 598	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...𝑘)) → (((abs ∘ − ) ∘ 𝐹)‘𝑛) = ((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))))
149	148, 120, 102	fsumser 15079	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) = (seq1( + , ((abs ∘ − ) ∘ 𝐹))‘𝑘))
150	128	fveq1i 6646	. . . . . . . . 9 ⊢ (𝑆‘𝑘) = (seq1( + , ((abs ∘ − ) ∘ 𝐹))‘𝑘)
151	149, 150	eqtr4di 2851	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) = (𝑆‘𝑘))
152	37	recnd 10658	. . . . . . . . . . 11 ⊢ (𝜑 → ((vol*‘𝐴) / 𝐶) ∈ ℂ)
153	38	rpcnd 12421	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ ℂ)
154	96, 152, 153	adddid 10654	. . . . . . . . . 10 ⊢ (𝜑 → (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅)) = ((𝐶 · ((vol*‘𝐴) / 𝐶)) + (𝐶 · 𝑅)))
155	36	recnd 10658	. . . . . . . . . . . 12 ⊢ (𝜑 → (vol*‘𝐴) ∈ ℂ)
156	155, 96, 103	divcan2d 11407	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐶 · ((vol*‘𝐴) / 𝐶)) = (vol*‘𝐴))
157	156	oveq1d 7150	. . . . . . . . . 10 ⊢ (𝜑 → ((𝐶 · ((vol*‘𝐴) / 𝐶)) + (𝐶 · 𝑅)) = ((vol*‘𝐴) + (𝐶 · 𝑅)))
158	154, 157	eqtrd 2833	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅)) = ((vol*‘𝐴) + (𝐶 · 𝑅)))
159	158	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅)) = ((vol*‘𝐴) + (𝐶 · 𝑅)))
160	145, 151, 159	3brtr4d 5062	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ≤ (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅)))
161	95, 101	fsumrecl 15083	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ∈ ℝ)
162	40	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (((vol*‘𝐴) / 𝐶) + 𝑅) ∈ ℝ)
163	13	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐶 ∈ ℝ ∧ 0 < 𝐶))
164		ledivmul 11505	. . . . . . . 8 ⊢ ((Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ∈ ℝ ∧ (((vol*‘𝐴) / 𝐶) + 𝑅) ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ≤ (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅))))
165	161, 162, 163, 164	syl3anc 1368	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ≤ (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅))))
166	160, 165	mpbird 260	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))
167	125, 166	eqbrtrrd 5054	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))
168	167	ralrimiva 3149	. . . 4 ⊢ (𝜑 → ∀𝑘 ∈ ℕ (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))
169	30	ffnd 6488	. . . . 5 ⊢ (𝜑 → seq1( + , ((abs ∘ − ) ∘ 𝐺)) Fn ℕ)
170		breq1 5033	. . . . . 6 ⊢ (𝑦 = (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) → (𝑦 ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅)))
171	170	ralrn 6831	. . . . 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 260	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ ran seq1( + , ((abs ∘ − ) ∘ 𝐺))𝑦 ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))
174		supxrleub 12707	. . . 4 ⊢ ((ran seq1( + , ((abs ∘ − ) ∘ 𝐺)) ⊆ ℝ* ∧ (((vol*‘𝐴) / 𝐶) + 𝑅) ∈ ℝ*) → (sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ ∀𝑦 ∈ ran seq1( + , ((abs ∘ − ) ∘ 𝐺))𝑦 ≤ (((vol*‘𝐴) / 𝐶) + 𝑅)))
175	33, 41, 174	syl2anc 587	. . 3 ⊢ (𝜑 → (sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ ∀𝑦 ∈ ran seq1( + , ((abs ∘ − ) ∘ 𝐺))𝑦 ≤ (((vol*‘𝐴) / 𝐶) + 𝑅)))
176	173, 175	mpbird 260	. 2 ⊢ (𝜑 → sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))
177	5, 35, 41, 94, 176	xrletrd 12543	1 ⊢ (𝜑 → (vol*‘𝐵) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111   ≠ wne 2987  ∀wral 3106  ∃wrex 3107  {crab 3110  Vcvv 3441   ∩ cin 3880   ⊆ wss 3881  ⟨cop 4531  ∪ cuni 4800   class class class wbr 5030   ↦ cmpt 5110   × cxp 5517  ran crn 5520   ∘ ccom 5523   Fn wfn 6319  ⟶wf 6320  ‘cfv 6324  (class class class)co 7135  1^st c1st 7669  2^nd c2nd 7670  supcsup 8888  ℂcc 10524  ℝcr 10525  0cc0 10526  1c1 10527   + caddc 10529   · cmul 10531  +∞cpnf 10661  ℝ^*cxr 10663   < clt 10664   ≤ cle 10665   − cmin 10859   / cdiv 11286  ℕcn 11625  ℤ_≥cuz 12231  ℝ⁺crp 12377  (,)cioo 12726  [,)cico 12728  ...cfz 12885  seqcseq 13364  abscabs 14585  Σcsu 15034  vol*covol 24066

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-inf2 9088  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603  ax-pre-sup 10604

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-se 5479  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-isom 6333  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-oadd 8089  df-er 8272  df-map 8391  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-sup 8890  df-inf 8891  df-oi 8958  df-card 9352  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-div 11287  df-nn 11626  df-2 11688  df-3 11689  df-n0 11886  df-z 11970  df-uz 12232  df-rp 12378  df-ioo 12730  df-ico 12732  df-fz 12886  df-fzo 13029  df-seq 13365  df-exp 13426  df-hash 13687  df-cj 14450  df-re 14451  df-im 14452  df-sqrt 14586  df-abs 14587  df-clim 14837  df-sum 15035  df-ovol 24068

This theorem is referenced by:  ovolscalem2  24118