Theorem hoidmv1lelem3 46753

Description: The dimensional volume of a 1-dimensional half-open interval is less than or equal the generalized sum of the dimensional volumes of countable half-open intervals that cover it. This is the nonempty, finite generalized sum, sub case in Lemma 114B of [Fremlin1] p. 23. (Contributed by Glauco Siliprandi, 21-Nov-2020.)

Hypotheses

Ref	Expression
hoidmv1lelem3.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
hoidmv1lelem3.b	⊢ (𝜑 → 𝐵 ∈ ℝ)
hoidmv1lelem3.l	⊢ (𝜑 → 𝐴 < 𝐵)
hoidmv1lelem3.c	⊢ (𝜑 → 𝐶:ℕ⟶ℝ)
hoidmv1lelem3.d	⊢ (𝜑 → 𝐷:ℕ⟶ℝ)
hoidmv1lelem3.x	⊢ (𝜑 → (𝐴[,)𝐵) ⊆ ∪ 𝑗 ∈ ℕ ((𝐶‘𝑗)[,)(𝐷‘𝑗)))
hoidmv1lelem3.r	⊢ (𝜑 → (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)(𝐷‘𝑗))))) ∈ ℝ)
hoidmv1lelem3.u	⊢ 𝑈 = {𝑧 ∈ (𝐴[,]𝐵) ∣ (𝑧 − 𝐴) ≤ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧)))))}
hoidmv1lelem3.s	⊢ 𝑆 = sup(𝑈, ℝ, < )

Assertion

Ref	Expression
hoidmv1lelem3	⊢ (𝜑 → (𝐵 − 𝐴) ≤ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)(𝐷‘𝑗))))))

Distinct variable groups:   𝐴,𝑗,𝑧   𝐵,𝑗,𝑧   𝐶,𝑗,𝑧   𝐷,𝑗,𝑧   𝑆,𝑗,𝑧   𝑈,𝑗,𝑧   𝜑,𝑗,𝑧

Proof of Theorem hoidmv1lelem3

Dummy variables 𝑦 𝑖 𝑢 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		hoidmv1lelem3.b	. . 3 ⊢ (𝜑 → 𝐵 ∈ ℝ)
2		hoidmv1lelem3.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ)
3	1, 2	resubcld 11556	. 2 ⊢ (𝜑 → (𝐵 − 𝐴) ∈ ℝ)
4		nnex 12142	. . . . . . 7 ⊢ ℕ ∈ V
5	4	a1i 11	. . . . . 6 ⊢ (𝜑 → ℕ ∈ V)
6		icossicc 13343	. . . . . . . 8 ⊢ (0[,)+∞) ⊆ (0[,]+∞)
7		0xr 11170	. . . . . . . . . 10 ⊢ 0 ∈ ℝ*
8	7	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → 0 ∈ ℝ*)
9		pnfxr 11177	. . . . . . . . . 10 ⊢ +∞ ∈ ℝ*
10	9	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → +∞ ∈ ℝ*)
11		hoidmv1lelem3.c	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐶:ℕ⟶ℝ)
12	11	ffvelcdmda 7026	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (𝐶‘𝑗) ∈ ℝ)
13		hoidmv1lelem3.d	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐷:ℕ⟶ℝ)
14	13	ffvelcdmda 7026	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (𝐷‘𝑗) ∈ ℝ)
15	1	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → 𝐵 ∈ ℝ)
16	14, 15	ifcld 4523	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵) ∈ ℝ)
17		volicore 46741	. . . . . . . . . . 11 ⊢ (((𝐶‘𝑗) ∈ ℝ ∧ if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵) ∈ ℝ) → (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))) ∈ ℝ)
18	12, 16, 17	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))) ∈ ℝ)
19	18	rexrd 11173	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))) ∈ ℝ*)
20	16	rexrd 11173	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵) ∈ ℝ*)
21		icombl 25512	. . . . . . . . . . 11 ⊢ (((𝐶‘𝑗) ∈ ℝ ∧ if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵) ∈ ℝ*) → ((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵)) ∈ dom vol)
22	12, 20, 21	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵)) ∈ dom vol)
23		volge0 46121	. . . . . . . . . 10 ⊢ (((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵)) ∈ dom vol → 0 ≤ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))))
24	22, 23	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → 0 ≤ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))))
25	18	ltpnfd 13026	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))) < +∞)
26	8, 10, 19, 24, 25	elicod 13302	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))) ∈ (0[,)+∞))
27	6, 26	sselid 3928	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))) ∈ (0[,]+∞))
28		eqid 2733	. . . . . . 7 ⊢ (𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵)))) = (𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))))
29	27, 28	fmptd 7056	. . . . . 6 ⊢ (𝜑 → (𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵)))):ℕ⟶(0[,]+∞))
30	5, 29	sge0xrcl 46545	. . . . 5 ⊢ (𝜑 → (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))))) ∈ ℝ*)
31	9	a1i 11	. . . . 5 ⊢ (𝜑 → +∞ ∈ ℝ*)
32		hoidmv1lelem3.r	. . . . . . 7 ⊢ (𝜑 → (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)(𝐷‘𝑗))))) ∈ ℝ)
33	32	rexrd 11173	. . . . . 6 ⊢ (𝜑 → (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)(𝐷‘𝑗))))) ∈ ℝ*)
34		nfv 1915	. . . . . . 7 ⊢ Ⅎ𝑗𝜑
35		volf 25477	. . . . . . . . 9 ⊢ vol:dom vol⟶(0[,]+∞)
36	35	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → vol:dom vol⟶(0[,]+∞))
37	14	rexrd 11173	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (𝐷‘𝑗) ∈ ℝ*)
38		icombl 25512	. . . . . . . . 9 ⊢ (((𝐶‘𝑗) ∈ ℝ ∧ (𝐷‘𝑗) ∈ ℝ*) → ((𝐶‘𝑗)[,)(𝐷‘𝑗)) ∈ dom vol)
39	12, 37, 38	syl2anc 584	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((𝐶‘𝑗)[,)(𝐷‘𝑗)) ∈ dom vol)
40	36, 39	ffvelcdmd 7027	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (vol‘((𝐶‘𝑗)[,)(𝐷‘𝑗))) ∈ (0[,]+∞))
41	12	rexrd 11173	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (𝐶‘𝑗) ∈ ℝ*)
42	12	leidd 11694	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (𝐶‘𝑗) ≤ (𝐶‘𝑗))
43		min1 13095	. . . . . . . . . 10 ⊢ (((𝐷‘𝑗) ∈ ℝ ∧ 𝐵 ∈ ℝ) → if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵) ≤ (𝐷‘𝑗))
44	14, 15, 43	syl2anc 584	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵) ≤ (𝐷‘𝑗))
45		icossico 13323	. . . . . . . . 9 ⊢ ((((𝐶‘𝑗) ∈ ℝ* ∧ (𝐷‘𝑗) ∈ ℝ*) ∧ ((𝐶‘𝑗) ≤ (𝐶‘𝑗) ∧ if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵) ≤ (𝐷‘𝑗))) → ((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵)) ⊆ ((𝐶‘𝑗)[,)(𝐷‘𝑗)))
46	41, 37, 42, 44, 45	syl22anc 838	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵)) ⊆ ((𝐶‘𝑗)[,)(𝐷‘𝑗)))
47		volss 25481	. . . . . . . 8 ⊢ ((((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵)) ∈ dom vol ∧ ((𝐶‘𝑗)[,)(𝐷‘𝑗)) ∈ dom vol ∧ ((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵)) ⊆ ((𝐶‘𝑗)[,)(𝐷‘𝑗))) → (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))) ≤ (vol‘((𝐶‘𝑗)[,)(𝐷‘𝑗))))
48	22, 39, 46, 47	syl3anc 1373	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))) ≤ (vol‘((𝐶‘𝑗)[,)(𝐷‘𝑗))))
49	34, 5, 27, 40, 48	sge0lempt 46570	. . . . . 6 ⊢ (𝜑 → (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))))) ≤ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)(𝐷‘𝑗))))))
50	32	ltpnfd 13026	. . . . . 6 ⊢ (𝜑 → (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)(𝐷‘𝑗))))) < +∞)
51	30, 33, 31, 49, 50	xrlelttrd 13065	. . . . 5 ⊢ (𝜑 → (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))))) < +∞)
52	30, 31, 51	xrltned 45518	. . . 4 ⊢ (𝜑 → (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))))) ≠ +∞)
53	52	neneqd 2934	. . 3 ⊢ (𝜑 → ¬ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))))) = +∞)
54	5, 29	sge0repnf 46546	. . 3 ⊢ (𝜑 → ((Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))))) ∈ ℝ ↔ ¬ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))))) = +∞))
55	53, 54	mpbird 257	. 2 ⊢ (𝜑 → (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))))) ∈ ℝ)
56	1	rexrd 11173	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ*)
57	2, 1	iccssred 13341	. . . . . . . . 9 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ)
58		hoidmv1lelem3.u	. . . . . . . . . . 11 ⊢ 𝑈 = {𝑧 ∈ (𝐴[,]𝐵) ∣ (𝑧 − 𝐴) ≤ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧)))))}
59		ssrab2 4029	. . . . . . . . . . 11 ⊢ {𝑧 ∈ (𝐴[,]𝐵) ∣ (𝑧 − 𝐴) ≤ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧)))))} ⊆ (𝐴[,]𝐵)
60	58, 59	eqsstri 3977	. . . . . . . . . 10 ⊢ 𝑈 ⊆ (𝐴[,]𝐵)
61		hoidmv1lelem3.l	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 < 𝐵)
62		hoidmv1lelem3.s	. . . . . . . . . . . 12 ⊢ 𝑆 = sup(𝑈, ℝ, < )
63	2, 1, 61, 11, 13, 32, 58, 62	hoidmv1lelem1 46751	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑆 ∈ 𝑈 ∧ 𝐴 ∈ 𝑈 ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝑈 𝑦 ≤ 𝑥))
64	63	simp1d 1142	. . . . . . . . . 10 ⊢ (𝜑 → 𝑆 ∈ 𝑈)
65	60, 64	sselid 3928	. . . . . . . . 9 ⊢ (𝜑 → 𝑆 ∈ (𝐴[,]𝐵))
66	57, 65	sseldd 3931	. . . . . . . 8 ⊢ (𝜑 → 𝑆 ∈ ℝ)
67	66	rexrd 11173	. . . . . . 7 ⊢ (𝜑 → 𝑆 ∈ ℝ*)
68		simpl 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝑆) → 𝜑)
69		simpr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝑆) → ¬ 𝐵 ≤ 𝑆)
70	68, 66	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝑆) → 𝑆 ∈ ℝ)
71	68, 1	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝑆) → 𝐵 ∈ ℝ)
72	70, 71	ltnled 11271	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝑆) → (𝑆 < 𝐵 ↔ ¬ 𝐵 ≤ 𝑆))
73	69, 72	mpbird 257	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝑆) → 𝑆 < 𝐵)
74		hoidmv1lelem3.x	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐴[,)𝐵) ⊆ ∪ 𝑗 ∈ ℕ ((𝐶‘𝑗)[,)(𝐷‘𝑗)))
75	74	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → (𝐴[,)𝐵) ⊆ ∪ 𝑗 ∈ ℕ ((𝐶‘𝑗)[,)(𝐷‘𝑗)))
76	2	rexrd 11173	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐴 ∈ ℝ*)
77	76	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → 𝐴 ∈ ℝ*)
78	56	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → 𝐵 ∈ ℝ*)
79	67	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → 𝑆 ∈ ℝ*)
80	60, 57	sstrid 3942	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑈 ⊆ ℝ)
81	64	ne0d 4291	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑈 ≠ ∅)
82	63	simp3d 1144	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝑈 𝑦 ≤ 𝑥)
83	63	simp2d 1143	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
84		suprub 12094	. . . . . . . . . . . . . . . 16 ⊢ (((𝑈 ⊆ ℝ ∧ 𝑈 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝑈 𝑦 ≤ 𝑥) ∧ 𝐴 ∈ 𝑈) → 𝐴 ≤ sup(𝑈, ℝ, < ))
85	80, 81, 82, 83, 84	syl31anc 1375	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐴 ≤ sup(𝑈, ℝ, < ))
86	85, 62	breqtrrdi 5137	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐴 ≤ 𝑆)
87	86	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → 𝐴 ≤ 𝑆)
88		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → 𝑆 < 𝐵)
89	77, 78, 79, 87, 88	elicod 13302	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → 𝑆 ∈ (𝐴[,)𝐵))
90	75, 89	sseldd 3931	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → 𝑆 ∈ ∪ 𝑗 ∈ ℕ ((𝐶‘𝑗)[,)(𝐷‘𝑗)))
91		eliun 4947	. . . . . . . . . . 11 ⊢ (𝑆 ∈ ∪ 𝑗 ∈ ℕ ((𝐶‘𝑗)[,)(𝐷‘𝑗)) ↔ ∃𝑗 ∈ ℕ 𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗)))
92	90, 91	sylib 218	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → ∃𝑗 ∈ ℕ 𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗)))
93	2	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → 𝐴 ∈ ℝ)
94	93	3ad2ant1 1133	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑆 < 𝐵) ∧ 𝑗 ∈ ℕ ∧ 𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗))) → 𝐴 ∈ ℝ)
95	1	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → 𝐵 ∈ ℝ)
96	95	3ad2ant1 1133	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑆 < 𝐵) ∧ 𝑗 ∈ ℕ ∧ 𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗))) → 𝐵 ∈ ℝ)
97	11	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → 𝐶:ℕ⟶ℝ)
98	97	3ad2ant1 1133	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑆 < 𝐵) ∧ 𝑗 ∈ ℕ ∧ 𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗))) → 𝐶:ℕ⟶ℝ)
99	13	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → 𝐷:ℕ⟶ℝ)
100	99	3ad2ant1 1133	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑆 < 𝐵) ∧ 𝑗 ∈ ℕ ∧ 𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗))) → 𝐷:ℕ⟶ℝ)
101		fveq2 6831	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑖 = 𝑗 → (𝐶‘𝑖) = (𝐶‘𝑗))
102		fveq2 6831	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑖 = 𝑗 → (𝐷‘𝑖) = (𝐷‘𝑗))
103	101, 102	oveq12d 7373	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑖 = 𝑗 → ((𝐶‘𝑖)[,)(𝐷‘𝑖)) = ((𝐶‘𝑗)[,)(𝐷‘𝑗)))
104	103	fveq2d 6835	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑖 = 𝑗 → (vol‘((𝐶‘𝑖)[,)(𝐷‘𝑖))) = (vol‘((𝐶‘𝑗)[,)(𝐷‘𝑗))))
105	104	cbvmptv 5199	. . . . . . . . . . . . . . . . 17 ⊢ (𝑖 ∈ ℕ ↦ (vol‘((𝐶‘𝑖)[,)(𝐷‘𝑖)))) = (𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)(𝐷‘𝑗))))
106	105	fveq2i 6834	. . . . . . . . . . . . . . . 16 ⊢ (Σ^‘(𝑖 ∈ ℕ ↦ (vol‘((𝐶‘𝑖)[,)(𝐷‘𝑖))))) = (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)(𝐷‘𝑗)))))
107	106, 32	eqeltrid 2837	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (Σ^‘(𝑖 ∈ ℕ ↦ (vol‘((𝐶‘𝑖)[,)(𝐷‘𝑖))))) ∈ ℝ)
108	107	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → (Σ^‘(𝑖 ∈ ℕ ↦ (vol‘((𝐶‘𝑖)[,)(𝐷‘𝑖))))) ∈ ℝ)
109	108	3ad2ant1 1133	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑆 < 𝐵) ∧ 𝑗 ∈ ℕ ∧ 𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗))) → (Σ^‘(𝑖 ∈ ℕ ↦ (vol‘((𝐶‘𝑖)[,)(𝐷‘𝑖))))) ∈ ℝ)
110	102	breq1d 5105	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑖 = 𝑗 → ((𝐷‘𝑖) ≤ 𝑧 ↔ (𝐷‘𝑗) ≤ 𝑧))
111	110, 102	ifbieq1d 4501	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑖 = 𝑗 → if((𝐷‘𝑖) ≤ 𝑧, (𝐷‘𝑖), 𝑧) = if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧))
112	101, 111	oveq12d 7373	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑖 = 𝑗 → ((𝐶‘𝑖)[,)if((𝐷‘𝑖) ≤ 𝑧, (𝐷‘𝑖), 𝑧)) = ((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧)))
113	112	fveq2d 6835	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑖 = 𝑗 → (vol‘((𝐶‘𝑖)[,)if((𝐷‘𝑖) ≤ 𝑧, (𝐷‘𝑖), 𝑧))) = (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧))))
114	113	cbvmptv 5199	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑖 ∈ ℕ ↦ (vol‘((𝐶‘𝑖)[,)if((𝐷‘𝑖) ≤ 𝑧, (𝐷‘𝑖), 𝑧)))) = (𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧))))
115	114	eqcomi 2742	. . . . . . . . . . . . . . . . 17 ⊢ (𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧)))) = (𝑖 ∈ ℕ ↦ (vol‘((𝐶‘𝑖)[,)if((𝐷‘𝑖) ≤ 𝑧, (𝐷‘𝑖), 𝑧))))
116	115	fveq2i 6834	. . . . . . . . . . . . . . . 16 ⊢ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧))))) = (Σ^‘(𝑖 ∈ ℕ ↦ (vol‘((𝐶‘𝑖)[,)if((𝐷‘𝑖) ≤ 𝑧, (𝐷‘𝑖), 𝑧)))))
117	116	breq2i 5103	. . . . . . . . . . . . . . 15 ⊢ ((𝑧 − 𝐴) ≤ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧))))) ↔ (𝑧 − 𝐴) ≤ (Σ^‘(𝑖 ∈ ℕ ↦ (vol‘((𝐶‘𝑖)[,)if((𝐷‘𝑖) ≤ 𝑧, (𝐷‘𝑖), 𝑧))))))
118	117	rabbii 3401	. . . . . . . . . . . . . 14 ⊢ {𝑧 ∈ (𝐴[,]𝐵) ∣ (𝑧 − 𝐴) ≤ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧)))))} = {𝑧 ∈ (𝐴[,]𝐵) ∣ (𝑧 − 𝐴) ≤ (Σ^‘(𝑖 ∈ ℕ ↦ (vol‘((𝐶‘𝑖)[,)if((𝐷‘𝑖) ≤ 𝑧, (𝐷‘𝑖), 𝑧)))))}
119	58, 118	eqtri 2756	. . . . . . . . . . . . 13 ⊢ 𝑈 = {𝑧 ∈ (𝐴[,]𝐵) ∣ (𝑧 − 𝐴) ≤ (Σ^‘(𝑖 ∈ ℕ ↦ (vol‘((𝐶‘𝑖)[,)if((𝐷‘𝑖) ≤ 𝑧, (𝐷‘𝑖), 𝑧)))))}
120	64	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → 𝑆 ∈ 𝑈)
121	120	3ad2ant1 1133	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑆 < 𝐵) ∧ 𝑗 ∈ ℕ ∧ 𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗))) → 𝑆 ∈ 𝑈)
122	87	3ad2ant1 1133	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑆 < 𝐵) ∧ 𝑗 ∈ ℕ ∧ 𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗))) → 𝐴 ≤ 𝑆)
123	88	3ad2ant1 1133	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑆 < 𝐵) ∧ 𝑗 ∈ ℕ ∧ 𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗))) → 𝑆 < 𝐵)
124		simp2 1137	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑆 < 𝐵) ∧ 𝑗 ∈ ℕ ∧ 𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗))) → 𝑗 ∈ ℕ)
125		simp3 1138	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑆 < 𝐵) ∧ 𝑗 ∈ ℕ ∧ 𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗))) → 𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗)))
126		eqid 2733	. . . . . . . . . . . . 13 ⊢ if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵) = if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵)
127	94, 96, 98, 100, 109, 119, 121, 122, 123, 124, 125, 126	hoidmv1lelem2 46752	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑆 < 𝐵) ∧ 𝑗 ∈ ℕ ∧ 𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗))) → ∃𝑢 ∈ 𝑈 𝑆 < 𝑢)
128	127	3exp 1119	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → (𝑗 ∈ ℕ → (𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗)) → ∃𝑢 ∈ 𝑈 𝑆 < 𝑢)))
129	128	rexlimdv 3132	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → (∃𝑗 ∈ ℕ 𝑆 ∈ ((𝐶‘𝑗)[,)(𝐷‘𝑗)) → ∃𝑢 ∈ 𝑈 𝑆 < 𝑢))
130	92, 129	mpd 15	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑆 < 𝐵) → ∃𝑢 ∈ 𝑈 𝑆 < 𝑢)
131	68, 73, 130	syl2anc 584	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝑆) → ∃𝑢 ∈ 𝑈 𝑆 < 𝑢)
132	57	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → (𝐴[,]𝐵) ⊆ ℝ)
133	60, 132	sstrid 3942	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝑈 ⊆ ℝ)
134	81	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝑈 ≠ ∅)
135	2, 1	jca 511	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
136	135	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
137	60	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝑈 ⊆ (𝐴[,]𝐵))
138	64	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝑆 ∈ 𝑈)
139		iccsupr 13349	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑈 ⊆ (𝐴[,]𝐵) ∧ 𝑆 ∈ 𝑈) → (𝑈 ⊆ ℝ ∧ 𝑈 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝑈 𝑦 ≤ 𝑥))
140	136, 137, 138, 139	syl3anc 1373	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → (𝑈 ⊆ ℝ ∧ 𝑈 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝑈 𝑦 ≤ 𝑥))
141	140	simp3d 1144	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝑈 𝑦 ≤ 𝑥)
142		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝑢 ∈ 𝑈)
143		suprub 12094	. . . . . . . . . . . . . 14 ⊢ (((𝑈 ⊆ ℝ ∧ 𝑈 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝑈 𝑦 ≤ 𝑥) ∧ 𝑢 ∈ 𝑈) → 𝑢 ≤ sup(𝑈, ℝ, < ))
144	133, 134, 141, 142, 143	syl31anc 1375	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝑢 ≤ sup(𝑈, ℝ, < ))
145	144, 62	breqtrrdi 5137	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝑢 ≤ 𝑆)
146	145	ralrimiva 3125	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑢 ∈ 𝑈 𝑢 ≤ 𝑆)
147	60	sseli 3926	. . . . . . . . . . . . . . 15 ⊢ (𝑢 ∈ 𝑈 → 𝑢 ∈ (𝐴[,]𝐵))
148	147	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝑢 ∈ (𝐴[,]𝐵))
149	132, 148	sseldd 3931	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝑢 ∈ ℝ)
150	66	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝑆 ∈ ℝ)
151	149, 150	lenltd 11270	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → (𝑢 ≤ 𝑆 ↔ ¬ 𝑆 < 𝑢))
152	151	ralbidva 3154	. . . . . . . . . . 11 ⊢ (𝜑 → (∀𝑢 ∈ 𝑈 𝑢 ≤ 𝑆 ↔ ∀𝑢 ∈ 𝑈 ¬ 𝑆 < 𝑢))
153	146, 152	mpbid 232	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑢 ∈ 𝑈 ¬ 𝑆 < 𝑢)
154		ralnex 3059	. . . . . . . . . 10 ⊢ (∀𝑢 ∈ 𝑈 ¬ 𝑆 < 𝑢 ↔ ¬ ∃𝑢 ∈ 𝑈 𝑆 < 𝑢)
155	153, 154	sylib 218	. . . . . . . . 9 ⊢ (𝜑 → ¬ ∃𝑢 ∈ 𝑈 𝑆 < 𝑢)
156	155	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝑆) → ¬ ∃𝑢 ∈ 𝑈 𝑆 < 𝑢)
157	131, 156	condan 817	. . . . . . 7 ⊢ (𝜑 → 𝐵 ≤ 𝑆)
158		iccleub 13308	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑆 ∈ (𝐴[,]𝐵)) → 𝑆 ≤ 𝐵)
159	76, 56, 65, 158	syl3anc 1373	. . . . . . 7 ⊢ (𝜑 → 𝑆 ≤ 𝐵)
160	56, 67, 157, 159	xrletrid 13060	. . . . . 6 ⊢ (𝜑 → 𝐵 = 𝑆)
161	160, 64	eqeltrd 2833	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑈)
162	161, 58	eleqtrdi 2843	. . . 4 ⊢ (𝜑 → 𝐵 ∈ {𝑧 ∈ (𝐴[,]𝐵) ∣ (𝑧 − 𝐴) ≤ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧)))))})
163		oveq1 7362	. . . . . 6 ⊢ (𝑧 = 𝐵 → (𝑧 − 𝐴) = (𝐵 − 𝐴))
164		breq2 5099	. . . . . . . . . . 11 ⊢ (𝑧 = 𝐵 → ((𝐷‘𝑗) ≤ 𝑧 ↔ (𝐷‘𝑗) ≤ 𝐵))
165		id 22	. . . . . . . . . . 11 ⊢ (𝑧 = 𝐵 → 𝑧 = 𝐵)
166	164, 165	ifbieq2d 4503	. . . . . . . . . 10 ⊢ (𝑧 = 𝐵 → if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧) = if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))
167	166	oveq2d 7371	. . . . . . . . 9 ⊢ (𝑧 = 𝐵 → ((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧)) = ((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵)))
168	167	fveq2d 6835	. . . . . . . 8 ⊢ (𝑧 = 𝐵 → (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧))) = (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))))
169	168	mpteq2dv 5189	. . . . . . 7 ⊢ (𝑧 = 𝐵 → (𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧)))) = (𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵)))))
170	169	fveq2d 6835	. . . . . 6 ⊢ (𝑧 = 𝐵 → (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧))))) = (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))))))
171	163, 170	breq12d 5108	. . . . 5 ⊢ (𝑧 = 𝐵 → ((𝑧 − 𝐴) ≤ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧))))) ↔ (𝐵 − 𝐴) ≤ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵)))))))
172	171	elrab 3643	. . . 4 ⊢ (𝐵 ∈ {𝑧 ∈ (𝐴[,]𝐵) ∣ (𝑧 − 𝐴) ≤ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝑧, (𝐷‘𝑗), 𝑧)))))} ↔ (𝐵 ∈ (𝐴[,]𝐵) ∧ (𝐵 − 𝐴) ≤ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵)))))))
173	162, 172	sylib 218	. . 3 ⊢ (𝜑 → (𝐵 ∈ (𝐴[,]𝐵) ∧ (𝐵 − 𝐴) ≤ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵)))))))
174	173	simprd 495	. 2 ⊢ (𝜑 → (𝐵 − 𝐴) ≤ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)if((𝐷‘𝑗) ≤ 𝐵, (𝐷‘𝑗), 𝐵))))))
175	3, 55, 32, 174, 49	letrd 11281	1 ⊢ (𝜑 → (𝐵 − 𝐴) ≤ (Σ^‘(𝑗 ∈ ℕ ↦ (vol‘((𝐶‘𝑗)[,)(𝐷‘𝑗))))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   ≠ wne 2929  ∀wral 3048  ∃wrex 3057  {crab 3396  Vcvv 3437   ⊆ wss 3898  ∅c0 4282  ifcif 4476  ∪ ciun 4943   class class class wbr 5095   ↦ cmpt 5176  dom cdm 5621  ⟶wf 6485  ‘cfv 6489  (class class class)co 7355  supcsup 9335  ℝcr 11016  0cc0 11017  +∞cpnf 11154  ℝ^*cxr 11156   < clt 11157   ≤ cle 11158   − cmin 11355  ℕcn 12136  [,)cico 13254  [,]cicc 13255  volcvol 25411  Σ^{^}csumge0 46522

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677  ax-inf2 9542  ax-cnex 11073  ax-resscn 11074  ax-1cn 11075  ax-icn 11076  ax-addcl 11077  ax-addrcl 11078  ax-mulcl 11079  ax-mulrcl 11080  ax-mulcom 11081  ax-addass 11082  ax-mulass 11083  ax-distr 11084  ax-i2m1 11085  ax-1ne0 11086  ax-1rid 11087  ax-rnegex 11088  ax-rrecex 11089  ax-cnre 11090  ax-pre-lttri 11091  ax-pre-lttrn 11092  ax-pre-ltadd 11093  ax-pre-mulgt0 11094  ax-pre-sup 11095

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-int 4900  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-se 5575  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-isom 6498  df-riota 7312  df-ov 7358  df-oprab 7359  df-mpo 7360  df-of 7619  df-om 7806  df-1st 7930  df-2nd 7931  df-frecs 8220  df-wrecs 8251  df-recs 8300  df-rdg 8338  df-1o 8394  df-2o 8395  df-er 8631  df-map 8761  df-pm 8762  df-en 8880  df-dom 8881  df-sdom 8882  df-fin 8883  df-fi 9306  df-sup 9337  df-inf 9338  df-oi 9407  df-dju 9805  df-card 9843  df-pnf 11159  df-mnf 11160  df-xr 11161  df-ltxr 11162  df-le 11163  df-sub 11357  df-neg 11358  df-div 11786  df-nn 12137  df-2 12199  df-3 12200  df-n0 12393  df-z 12480  df-uz 12743  df-q 12853  df-rp 12897  df-xneg 13017  df-xadd 13018  df-xmul 13019  df-ioo 13256  df-ico 13258  df-icc 13259  df-fz 13415  df-fzo 13562  df-fl 13703  df-seq 13916  df-exp 13976  df-hash 14245  df-cj 15013  df-re 15014  df-im 15015  df-sqrt 15149  df-abs 15150  df-clim 15402  df-rlim 15403  df-sum 15601  df-rest 17333  df-topgen 17354  df-psmet 21292  df-xmet 21293  df-met 21294  df-bl 21295  df-mopn 21296  df-top 22829  df-topon 22846  df-bases 22881  df-cmp 23322  df-ovol 25412  df-vol 25413  df-sumge0 46523

This theorem is referenced by:  hoidmv1le  46754