Theorem ovolscalem1 25637

Description: Lemma for ovolsca 25639. (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 4042	. . . 4 ⊢ {𝑥 ∈ ℝ ∣ (𝐶 · 𝑥) ∈ 𝐴} ⊆ ℝ
3	1, 2	eqsstrdi 3989	. . 3 ⊢ (𝜑 → 𝐵 ⊆ ℝ)
4		ovolcl 25602	. . 3 ⊢ (𝐵 ⊆ ℝ → (vol*‘𝐵) ∈ ℝ*)
5	3, 4	syl 18	. 2 ⊢ (𝜑 → (vol*‘𝐵) ∈ ℝ*)
6		ovolsca.7	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
7		ovolfcl 25590	. . . . . . . . . . . 12 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑛)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑛)) ≤ (2nd ‘(𝐹‘𝑛))))
8	6, 7	sylan 591	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑛)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑛)) ≤ (2nd ‘(𝐹‘𝑛))))
9	8	simp3d 1160	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1st ‘(𝐹‘𝑛)) ≤ (2nd ‘(𝐹‘𝑛)))
10	8	simp1d 1158	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1st ‘(𝐹‘𝑛)) ∈ ℝ)
11	8	simp2d 1159	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (2nd ‘(𝐹‘𝑛)) ∈ ℝ)
12		ovolsca.2	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐶 ∈ ℝ+)
13	12	rpregt0d 13062	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ 0 < 𝐶))
14	13	adantr 485	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐶 ∈ ℝ ∧ 0 < 𝐶))
15		lediv1 12076	. . . . . . . . . . 11 ⊢ (((1st ‘(𝐹‘𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑛)) ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((1st ‘(𝐹‘𝑛)) ≤ (2nd ‘(𝐹‘𝑛)) ↔ ((1st ‘(𝐹‘𝑛)) / 𝐶) ≤ ((2nd ‘(𝐹‘𝑛)) / 𝐶)))
16	10, 11, 14, 15	syl3anc 1396	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) ≤ (2nd ‘(𝐹‘𝑛)) ↔ ((1st ‘(𝐹‘𝑛)) / 𝐶) ≤ ((2nd ‘(𝐹‘𝑛)) / 𝐶)))
17	9, 16	mpbid 235	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) / 𝐶) ≤ ((2nd ‘(𝐹‘𝑛)) / 𝐶))
18		df-br 5111	. . . . . . . . 9 ⊢ (((1st ‘(𝐹‘𝑛)) / 𝐶) ≤ ((2nd ‘(𝐹‘𝑛)) / 𝐶) ↔ ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ ≤ )
19	17, 18	sylib 221	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ ≤ )
20	12	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐶 ∈ ℝ+)
21	10, 20	rerpdivcld 13087	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) / 𝐶) ∈ ℝ)
22	11, 20	rerpdivcld 13087	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((2nd ‘(𝐹‘𝑛)) / 𝐶) ∈ ℝ)
23	21, 22	opelxpd 5698	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ (ℝ × ℝ))
24	19, 23	elind 4161	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ ( ≤ ∩ (ℝ × ℝ)))
25		ovolsca.6	. . . . . . 7 ⊢ 𝐺 = (𝑛 ∈ ℕ ↦ ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩)
26	24, 25	fmptd 7107	. . . . . 6 ⊢ (𝜑 → 𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
27		eqid 2769	. . . . . . 7 ⊢ ((abs ∘ − ) ∘ 𝐺) = ((abs ∘ − ) ∘ 𝐺)
28		eqid 2769	. . . . . . 7 ⊢ seq1( + , ((abs ∘ − ) ∘ 𝐺)) = seq1( + , ((abs ∘ − ) ∘ 𝐺))
29	27, 28	ovolsf 25596	. . . . . 6 ⊢ (𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → seq1( + , ((abs ∘ − ) ∘ 𝐺)):ℕ⟶(0[,)+∞))
30	26, 29	syl 18	. . . . 5 ⊢ (𝜑 → seq1( + , ((abs ∘ − ) ∘ 𝐺)):ℕ⟶(0[,)+∞))
31	30	frnd 6712	. . . 4 ⊢ (𝜑 → ran seq1( + , ((abs ∘ − ) ∘ 𝐺)) ⊆ (0[,)+∞))
32		icossxr 13455	. . . 4 ⊢ (0[,)+∞) ⊆ ℝ*
33	31, 32	sstrdi 3957	. . 3 ⊢ (𝜑 → ran seq1( + , ((abs ∘ − ) ∘ 𝐺)) ⊆ ℝ*)
34		supxrcl 13337	. . 3 ⊢ (ran seq1( + , ((abs ∘ − ) ∘ 𝐺)) ⊆ ℝ* → sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ) ∈ ℝ*)
35	33, 34	syl 18	. 2 ⊢ (𝜑 → sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ) ∈ ℝ*)
36		ovolsca.4	. . . . 5 ⊢ (𝜑 → (vol*‘𝐴) ∈ ℝ)
37	36, 12	rerpdivcld 13087	. . . 4 ⊢ (𝜑 → ((vol*‘𝐴) / 𝐶) ∈ ℝ)
38		ovolsca.9	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ ℝ+)
39	38	rpred 13056	. . . 4 ⊢ (𝜑 → 𝑅 ∈ ℝ)
40	37, 39	readdcld 11234	. . 3 ⊢ (𝜑 → (((vol*‘𝐴) / 𝐶) + 𝑅) ∈ ℝ)
41	40	rexrd 11255	. 2 ⊢ (𝜑 → (((vol*‘𝐴) / 𝐶) + 𝑅) ∈ ℝ*)
42	1	eleq2d 2855	. . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ {𝑥 ∈ ℝ ∣ (𝐶 · 𝑥) ∈ 𝐴}))
43		oveq2 7416	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝐶 · 𝑥) = (𝐶 · 𝑦))
44	43	eleq1d 2854	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → ((𝐶 · 𝑥) ∈ 𝐴 ↔ (𝐶 · 𝑦) ∈ 𝐴))
45	44	elrab 3659	. . . . . . 7 ⊢ (𝑦 ∈ {𝑥 ∈ ℝ ∣ (𝐶 · 𝑥) ∈ 𝐴} ↔ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴))
46	42, 45	bitrdi 290	. . . . . 6 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↔ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)))
47		breq2 5114	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐶 · 𝑦) → ((1st ‘(𝐹‘𝑛)) < 𝑥 ↔ (1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦)))
48		breq1 5113	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐶 · 𝑦) → (𝑥 < (2nd ‘(𝐹‘𝑛)) ↔ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛))))
49	47, 48	anbi12d 643	. . . . . . . . . 10 ⊢ (𝑥 = (𝐶 · 𝑦) → (((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛))) ↔ ((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ∧ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛)))))
50	49	rexbidv 3195	. . . . . . . . 9 ⊢ (𝑥 = (𝐶 · 𝑦) → (∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛))) ↔ ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ∧ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛)))))
51		ovolsca.8	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹))
52		ovolsca.1	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
53		ovolfioo 25591	. . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐴 ⊆ ∪ ran ((,) ∘ 𝐹) ↔ ∀𝑥 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛)))))
54	52, 6, 53	syl2anc 595	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 ⊆ ∪ ran ((,) ∘ 𝐹) ↔ ∀𝑥 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛)))))
55	51, 54	mpbid 235	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛))))
56	55	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) → ∀𝑥 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < 𝑥 ∧ 𝑥 < (2nd ‘(𝐹‘𝑛))))
57		simprr 784	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) → (𝐶 · 𝑦) ∈ 𝐴)
58	50, 56, 57	rspcdva 3591	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) → ∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ∧ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛))))
59		opex 5443	. . . . . . . . . . . . . . . 16 ⊢ ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ V
60	25	fvmpt2 6999	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 ∈ ℕ ∧ ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩ ∈ V) → (𝐺‘𝑛) = ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩)
61	59, 60	mpan2 703	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → (𝐺‘𝑛) = ⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩)
62	61	fveq2d 6883	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → (1st ‘(𝐺‘𝑛)) = (1st ‘⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩))
63		ovex 7441	. . . . . . . . . . . . . . 15 ⊢ ((1st ‘(𝐹‘𝑛)) / 𝐶) ∈ V
64		ovex 7441	. . . . . . . . . . . . . . 15 ⊢ ((2nd ‘(𝐹‘𝑛)) / 𝐶) ∈ V
65	63, 64	op1st 7990	. . . . . . . . . . . . . 14 ⊢ (1st ‘⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩) = ((1st ‘(𝐹‘𝑛)) / 𝐶)
66	62, 65	eqtrdi 2820	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → (1st ‘(𝐺‘𝑛)) = ((1st ‘(𝐹‘𝑛)) / 𝐶))
67	66	adantl 486	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (1st ‘(𝐺‘𝑛)) = ((1st ‘(𝐹‘𝑛)) / 𝐶))
68	67	breq1d 5120	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐺‘𝑛)) < 𝑦 ↔ ((1st ‘(𝐹‘𝑛)) / 𝐶) < 𝑦))
69	10	adantlr 727	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (1st ‘(𝐹‘𝑛)) ∈ ℝ)
70		simplrl 788	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → 𝑦 ∈ ℝ)
71	14	adantlr 727	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (𝐶 ∈ ℝ ∧ 0 < 𝐶))
72		ltdivmul 12086	. . . . . . . . . . . 12 ⊢ (((1st ‘(𝐹‘𝑛)) ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (((1st ‘(𝐹‘𝑛)) / 𝐶) < 𝑦 ↔ (1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦)))
73	69, 70, 71, 72	syl3anc 1396	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (((1st ‘(𝐹‘𝑛)) / 𝐶) < 𝑦 ↔ (1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦)))
74	68, 73	bitr2d 283	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ↔ (1st ‘(𝐺‘𝑛)) < 𝑦))
75	11	adantlr 727	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (2nd ‘(𝐹‘𝑛)) ∈ ℝ)
76		ltmuldiv2 12085	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ ℝ ∧ (2nd ‘(𝐹‘𝑛)) ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛)) ↔ 𝑦 < ((2nd ‘(𝐹‘𝑛)) / 𝐶)))
77	70, 75, 71, 76	syl3anc 1396	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → ((𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛)) ↔ 𝑦 < ((2nd ‘(𝐹‘𝑛)) / 𝐶)))
78	61	fveq2d 6883	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → (2nd ‘(𝐺‘𝑛)) = (2nd ‘⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩))
79	63, 64	op2nd 7991	. . . . . . . . . . . . . 14 ⊢ (2nd ‘⟨((1st ‘(𝐹‘𝑛)) / 𝐶), ((2nd ‘(𝐹‘𝑛)) / 𝐶)⟩) = ((2nd ‘(𝐹‘𝑛)) / 𝐶)
80	78, 79	eqtrdi 2820	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → (2nd ‘(𝐺‘𝑛)) = ((2nd ‘(𝐹‘𝑛)) / 𝐶))
81	80	adantl 486	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (2nd ‘(𝐺‘𝑛)) = ((2nd ‘(𝐹‘𝑛)) / 𝐶))
82	81	breq2d 5122	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (𝑦 < (2nd ‘(𝐺‘𝑛)) ↔ 𝑦 < ((2nd ‘(𝐹‘𝑛)) / 𝐶)))
83	77, 82	bitr4d 285	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → ((𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛)) ↔ 𝑦 < (2nd ‘(𝐺‘𝑛))))
84	74, 83	anbi12d 643	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) ∧ 𝑛 ∈ ℕ) → (((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ∧ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛))) ↔ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
85	84	rexbidva 3193	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) → (∃𝑛 ∈ ℕ ((1st ‘(𝐹‘𝑛)) < (𝐶 · 𝑦) ∧ (𝐶 · 𝑦) < (2nd ‘(𝐹‘𝑛))) ↔ ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
86	58, 85	mpbid 235	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴)) → ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛))))
87	86	ex 417	. . . . . 6 ⊢ (𝜑 → ((𝑦 ∈ ℝ ∧ (𝐶 · 𝑦) ∈ 𝐴) → ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
88	46, 87	sylbid 243	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐵 → ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
89	88	ralrimiv 3162	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛))))
90		ovolfioo 25591	. . . . 5 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐵 ⊆ ∪ ran ((,) ∘ 𝐺) ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
91	3, 26, 90	syl2anc 595	. . . 4 ⊢ (𝜑 → (𝐵 ⊆ ∪ ran ((,) ∘ 𝐺) ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℕ ((1st ‘(𝐺‘𝑛)) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐺‘𝑛)))))
92	89, 91	mpbird 260	. . 3 ⊢ (𝜑 → 𝐵 ⊆ ∪ ran ((,) ∘ 𝐺))
93	28	ovollb 25603	. . 3 ⊢ ((𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐵 ⊆ ∪ ran ((,) ∘ 𝐺)) → (vol*‘𝐵) ≤ sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ))
94	26, 92, 93	syl2anc 595	. 2 ⊢ (𝜑 → (vol*‘𝐵) ≤ sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ))
95		fzfid 14005	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (1...𝑘) ∈ Fin)
96	12	rpcnd 13058	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℂ)
97	96	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐶 ∈ ℂ)
98		simpl 487	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝜑)
99		elfznn 13577	. . . . . . . . . 10 ⊢ (𝑛 ∈ (1...𝑘) → 𝑛 ∈ ℕ)
100	11, 10	resubcld 11638	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ∈ ℝ)
101	98, 99, 100	syl2an 607	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...𝑘)) → ((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ∈ ℝ)
102	101	recnd 11233	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...𝑘)) → ((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ∈ ℂ)
103	12	rpne0d 13061	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ≠ 0)
104	103	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐶 ≠ 0)
105	95, 97, 102, 104	fsumdivc 15833	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) = Σ𝑛 ∈ (1...𝑘)(((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶))
106	80, 66	oveq12d 7426	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ → ((2nd ‘(𝐺‘𝑛)) − (1st ‘(𝐺‘𝑛))) = (((2nd ‘(𝐹‘𝑛)) / 𝐶) − ((1st ‘(𝐹‘𝑛)) / 𝐶)))
107	106	adantl 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((2nd ‘(𝐺‘𝑛)) − (1st ‘(𝐺‘𝑛))) = (((2nd ‘(𝐹‘𝑛)) / 𝐶) − ((1st ‘(𝐹‘𝑛)) / 𝐶)))
108	27	ovolfsval 25594	. . . . . . . . . . 11 ⊢ ((𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐺)‘𝑛) = ((2nd ‘(𝐺‘𝑛)) − (1st ‘(𝐺‘𝑛))))
109	26, 108	sylan 591	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐺)‘𝑛) = ((2nd ‘(𝐺‘𝑛)) − (1st ‘(𝐺‘𝑛))))
110	11	recnd 11233	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (2nd ‘(𝐹‘𝑛)) ∈ ℂ)
111	10	recnd 11233	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1st ‘(𝐹‘𝑛)) ∈ ℂ)
112	12	rpcnne0d 13065	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 ∈ ℂ ∧ 𝐶 ≠ 0))
113	112	adantr 485	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐶 ∈ ℂ ∧ 𝐶 ≠ 0))
114		divsubdir 11904	. . . . . . . . . . 11 ⊢ (((2nd ‘(𝐹‘𝑛)) ∈ ℂ ∧ (1st ‘(𝐹‘𝑛)) ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 ≠ 0)) → (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) = (((2nd ‘(𝐹‘𝑛)) / 𝐶) − ((1st ‘(𝐹‘𝑛)) / 𝐶)))
115	110, 111, 113, 114	syl3anc 1396	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) = (((2nd ‘(𝐹‘𝑛)) / 𝐶) − ((1st ‘(𝐹‘𝑛)) / 𝐶)))
116	107, 109, 115	3eqtr4d 2814	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐺)‘𝑛) = (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶))
117	98, 99, 116	syl2an 607	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...𝑘)) → (((abs ∘ − ) ∘ 𝐺)‘𝑛) = (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶))
118		simpr 489	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℕ)
119		nnuz 12897	. . . . . . . . 9 ⊢ ℕ = (ℤ≥‘1)
120	118, 119	eleqtrdi 2879	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ (ℤ≥‘1))
121	100, 20	rerpdivcld 13087	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ∈ ℝ)
122	121	recnd 11233	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ∈ ℂ)
123	98, 99, 122	syl2an 607	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...𝑘)) → (((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ∈ ℂ)
124	117, 120, 123	fsumser 15777	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → Σ𝑛 ∈ (1...𝑘)(((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) = (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘))
125	105, 124	eqtrd 2804	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) = (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘))
126		ovolsca.10	. . . . . . . . . . 11 ⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)))
127		eqid 2769	. . . . . . . . . . . . . . . 16 ⊢ ((abs ∘ − ) ∘ 𝐹) = ((abs ∘ − ) ∘ 𝐹)
128		ovolsca.5	. . . . . . . . . . . . . . . 16 ⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹))
129	127, 128	ovolsf 25596	. . . . . . . . . . . . . . 15 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → 𝑆:ℕ⟶(0[,)+∞))
130	6, 129	syl 18	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑆:ℕ⟶(0[,)+∞))
131	130	frnd 6712	. . . . . . . . . . . . 13 ⊢ (𝜑 → ran 𝑆 ⊆ (0[,)+∞))
132	131, 32	sstrdi 3957	. . . . . . . . . . . 12 ⊢ (𝜑 → ran 𝑆 ⊆ ℝ*)
133	12, 38	rpmulcld 13072	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐶 · 𝑅) ∈ ℝ+)
134	133	rpred 13056	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐶 · 𝑅) ∈ ℝ)
135	36, 134	readdcld 11234	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((vol*‘𝐴) + (𝐶 · 𝑅)) ∈ ℝ)
136	135	rexrd 11255	. . . . . . . . . . . 12 ⊢ (𝜑 → ((vol*‘𝐴) + (𝐶 · 𝑅)) ∈ ℝ*)
137		supxrleub 13348	. . . . . . . . . . . 12 ⊢ ((ran 𝑆 ⊆ ℝ* ∧ ((vol*‘𝐴) + (𝐶 · 𝑅)) ∈ ℝ*) → (sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)) ↔ ∀𝑥 ∈ ran 𝑆 𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅))))
138	132, 136, 137	syl2anc 595	. . . . . . . . . . 11 ⊢ (𝜑 → (sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)) ↔ ∀𝑥 ∈ ran 𝑆 𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅))))
139	126, 138	mpbid 235	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑥 ∈ ran 𝑆 𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)))
140	130	ffnd 6704	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑆 Fn ℕ)
141		breq1 5113	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝑆‘𝑘) → (𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)) ↔ (𝑆‘𝑘) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅))))
142	141	ralrn 7081	. . . . . . . . . . 11 ⊢ (𝑆 Fn ℕ → (∀𝑥 ∈ ran 𝑆 𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)) ↔ ∀𝑘 ∈ ℕ (𝑆‘𝑘) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅))))
143	140, 142	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → (∀𝑥 ∈ ran 𝑆 𝑥 ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)) ↔ ∀𝑘 ∈ ℕ (𝑆‘𝑘) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅))))
144	139, 143	mpbid 235	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑘 ∈ ℕ (𝑆‘𝑘) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)))
145	144	r19.21bi 3263	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝑆‘𝑘) ≤ ((vol*‘𝐴) + (𝐶 · 𝑅)))
146	6	adantr 485	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
147	127	ovolfsval 25594	. . . . . . . . . . 11 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐹)‘𝑛) = ((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))))
148	146, 99, 147	syl2an 607	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...𝑘)) → (((abs ∘ − ) ∘ 𝐹)‘𝑛) = ((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))))
149	148, 120, 102	fsumser 15777	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) = (seq1( + , ((abs ∘ − ) ∘ 𝐹))‘𝑘))
150	128	fveq1i 6880	. . . . . . . . 9 ⊢ (𝑆‘𝑘) = (seq1( + , ((abs ∘ − ) ∘ 𝐹))‘𝑘)
151	149, 150	eqtr4di 2822	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) = (𝑆‘𝑘))
152	37	recnd 11233	. . . . . . . . . . 11 ⊢ (𝜑 → ((vol*‘𝐴) / 𝐶) ∈ ℂ)
153	38	rpcnd 13058	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ ℂ)
154	96, 152, 153	adddid 11229	. . . . . . . . . 10 ⊢ (𝜑 → (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅)) = ((𝐶 · ((vol*‘𝐴) / 𝐶)) + (𝐶 · 𝑅)))
155	36	recnd 11233	. . . . . . . . . . . 12 ⊢ (𝜑 → (vol*‘𝐴) ∈ ℂ)
156	155, 96, 103	divcan2d 11989	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐶 · ((vol*‘𝐴) / 𝐶)) = (vol*‘𝐴))
157	156	oveq1d 7423	. . . . . . . . . 10 ⊢ (𝜑 → ((𝐶 · ((vol*‘𝐴) / 𝐶)) + (𝐶 · 𝑅)) = ((vol*‘𝐴) + (𝐶 · 𝑅)))
158	154, 157	eqtrd 2804	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅)) = ((vol*‘𝐴) + (𝐶 · 𝑅)))
159	158	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅)) = ((vol*‘𝐴) + (𝐶 · 𝑅)))
160	145, 151, 159	3brtr4d 5144	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ≤ (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅)))
161	95, 101	fsumrecl 15781	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ∈ ℝ)
162	40	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (((vol*‘𝐴) / 𝐶) + 𝑅) ∈ ℝ)
163	13	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐶 ∈ ℝ ∧ 0 < 𝐶))
164		ledivmul 12087	. . . . . . . 8 ⊢ ((Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ∈ ℝ ∧ (((vol*‘𝐴) / 𝐶) + 𝑅) ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ≤ (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅))))
165	161, 162, 163, 164	syl3anc 1396	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) ≤ (𝐶 · (((vol*‘𝐴) / 𝐶) + 𝑅))))
166	160, 165	mpbird 260	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (Σ𝑛 ∈ (1...𝑘)((2nd ‘(𝐹‘𝑛)) − (1st ‘(𝐹‘𝑛))) / 𝐶) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))
167	125, 166	eqbrtrrd 5136	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))
168	167	ralrimiva 3163	. . . 4 ⊢ (𝜑 → ∀𝑘 ∈ ℕ (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))
169	30	ffnd 6704	. . . . 5 ⊢ (𝜑 → seq1( + , ((abs ∘ − ) ∘ 𝐺)) Fn ℕ)
170		breq1 5113	. . . . . 6 ⊢ (𝑦 = (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) → (𝑦 ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅)))
171	170	ralrn 7081	. . . . 5 ⊢ (seq1( + , ((abs ∘ − ) ∘ 𝐺)) Fn ℕ → (∀𝑦 ∈ ran seq1( + , ((abs ∘ − ) ∘ 𝐺))𝑦 ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ ∀𝑘 ∈ ℕ (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅)))
172	169, 171	syl 18	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ ran seq1( + , ((abs ∘ − ) ∘ 𝐺))𝑦 ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ ∀𝑘 ∈ ℕ (seq1( + , ((abs ∘ − ) ∘ 𝐺))‘𝑘) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅)))
173	168, 172	mpbird 260	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ ran seq1( + , ((abs ∘ − ) ∘ 𝐺))𝑦 ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))
174		supxrleub 13348	. . . 4 ⊢ ((ran seq1( + , ((abs ∘ − ) ∘ 𝐺)) ⊆ ℝ* ∧ (((vol*‘𝐴) / 𝐶) + 𝑅) ∈ ℝ*) → (sup(ran seq1( + , ((abs ∘ − ) ∘ 𝐺)), ℝ*, < ) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅) ↔ ∀𝑦 ∈ ran seq1( + , ((abs ∘ − ) ∘ 𝐺))𝑦 ≤ (((vol*‘𝐴) / 𝐶) + 𝑅)))
175	33, 41, 174	syl2anc 595	. . 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 13183	1 ⊢ (𝜑 → (vol*‘𝐵) ≤ (((vol*‘𝐴) / 𝐶) + 𝑅))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149   ≠ wne 2964  ∀wral 3085  ∃wrex 3095  {crab 3423  Vcvv 3463   ∩ cin 3912   ⊆ wss 3913  ⟨cop 4597  ∪ cuni 4873   class class class wbr 5110   ↦ cmpt 5193   × cxp 5657  ran crn 5660   ∘ ccom 5663   Fn wfn 6528  ⟶wf 6529  ‘cfv 6533  (class class class)co 7408  1^st c1st 7980  2^nd c2nd 7981  supcsup 9396  ℂcc 11094  ℝcr 11095  0cc0 11096  1c1 11097   + caddc 11099   · cmul 11101  +∞cpnf 11236  ℝ^*cxr 11238   < clt 11239   ≤ cle 11240   − cmin 11437   / cdiv 11867  ℕcn 12229  ℤ_≥cuz 12858  ℝ⁺crp 13012  (,)cioo 13368  [,)cico 13370  ...cfz 13531  seqcseq 14033  abscabs 15281  Σcsu 15733  vol*covol 25586

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730  ax-inf2 9606  ax-cnex 11152  ax-resscn 11153  ax-1cn 11154  ax-icn 11155  ax-addcl 11156  ax-addrcl 11157  ax-mulcl 11158  ax-mulrcl 11159  ax-mulcom 11160  ax-addass 11161  ax-mulass 11162  ax-distr 11163  ax-i2m1 11164  ax-1ne0 11165  ax-1rid 11166  ax-rnegex 11167  ax-rrecex 11168  ax-cnre 11169  ax-pre-lttri 11170  ax-pre-lttrn 11171  ax-pre-ltadd 11172  ax-pre-mulgt0 11173  ax-pre-sup 11174

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  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 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-isom 6542  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-er 8690  df-map 8822  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-sup 9398  df-inf 9399  df-oi 9468  df-card 9921  df-pnf 11241  df-mnf 11242  df-xr 11243  df-ltxr 11244  df-le 11245  df-sub 11439  df-neg 11440  df-div 11868  df-nn 12230  df-2 12299  df-3 12300  df-n0 12501  df-z 12588  df-uz 12859  df-rp 13013  df-ioo 13372  df-ico 13374  df-fz 13532  df-fzo 13679  df-seq 14034  df-exp 14094  df-hash 14363  df-cj 15146  df-re 15147  df-im 15148  df-sqrt 15282  df-abs 15283  df-clim 15535  df-sum 15734  df-ovol 25588

This theorem is referenced by:  ovolscalem2  25638