hsphoidmvle2 - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > hsphoidmvle2		Structured version Visualization version GIF version

Theorem hsphoidmvle2 44013

Description: The dimensional volume of a half-open interval intersected with a two half-spaces. Used in the last inequality of step (c) of Lemma 115B of [Fremlin1] p. 29. (Contributed by Glauco Siliprandi, 21-Nov-2020.)

**Hypotheses**
Ref	Expression
hsphoidmvle2.l	⊢ 𝐿 = (𝑥 ∈ Fin ↦ (𝑎 ∈ (ℝ ↑_m 𝑥), 𝑏 ∈ (ℝ ↑_m 𝑥) ↦ if(𝑥 = ∅, 0, ∏𝑘 ∈ 𝑥 (vol‘((𝑎‘𝑘)[,)(𝑏‘𝑘))))))
hsphoidmvle2.x	⊢ (𝜑 → 𝑋 ∈ Fin)
hsphoidmvle2.z	⊢ (𝜑 → 𝑍 ∈ (𝑋 ∖ 𝑌))
hsphoidmvle2.y	⊢ 𝑋 = (𝑌 ∪ {𝑍})
hsphoidmvle2.c	⊢ (𝜑 → 𝐶 ∈ ℝ)
hsphoidmvle2.d	⊢ (𝜑 → 𝐷 ∈ ℝ)
hsphoidmvle2.e	⊢ (𝜑 → 𝐶 ≤ 𝐷)
hsphoidmvle2.h	⊢ 𝐻 = (𝑥 ∈ ℝ ↦ (𝑐 ∈ (ℝ ↑_m 𝑋) ↦ (𝑗 ∈ 𝑋 ↦ if(𝑗 ∈ 𝑌, (𝑐‘𝑗), if((𝑐‘𝑗) ≤ 𝑥, (𝑐‘𝑗), 𝑥)))))
hsphoidmvle2.a	⊢ (𝜑 → 𝐴:𝑋⟶ℝ)
hsphoidmvle2.b	⊢ (𝜑 → 𝐵:𝑋⟶ℝ)

**Assertion**
Ref	Expression
hsphoidmvle2	⊢ (𝜑 → (𝐴(𝐿‘𝑋)((𝐻‘𝐶)‘𝐵)) ≤ (𝐴(𝐿‘𝑋)((𝐻‘𝐷)‘𝐵)))

Distinct variable groups: 𝐴,𝑎,𝑏,𝑘 𝐵,𝑎,𝑏,𝑘 𝐵,𝑐,𝑗,𝑘 𝐶,𝑎,𝑏,𝑘,𝑥 𝐶,𝑐,𝑗,𝑥 𝐷,𝑎,𝑏,𝑘,𝑥 𝐷,𝑐,𝑗 𝐻,𝑎,𝑏,𝑘 𝑋,𝑎,𝑏,𝑘,𝑥 𝑋,𝑐,𝑗 𝑌,𝑐,𝑗,𝑥 𝑍,𝑐,𝑗,𝑘,𝑥 𝜑,𝑎,𝑏,𝑘,𝑥 𝜑,𝑐,𝑗 Allowed substitution hints: 𝐴(𝑥,𝑗,𝑐) 𝐵(𝑥) 𝐻(𝑥,𝑗,𝑐) 𝐿(𝑥,𝑗,𝑘,𝑎,𝑏,𝑐) 𝑌(𝑘,𝑎,𝑏) 𝑍(𝑎,𝑏)

**Proof of Theorem hsphoidmvle2**
Step	Hyp	Ref	Expression
1		hsphoidmvle2.a	. . . . 5 ⊢ (𝜑 → 𝐴:𝑋⟶ℝ)
2		hsphoidmvle2.z	. . . . . 6 ⊢ (𝜑 → 𝑍 ∈ (𝑋 ∖ 𝑌))
3	2	eldifad 3895	. . . . 5 ⊢ (𝜑 → 𝑍 ∈ 𝑋)
4	1, 3	ffvelrnd 6944	. . . 4 ⊢ (𝜑 → (𝐴‘𝑍) ∈ ℝ)
5		hsphoidmvle2.b	. . . . . 6 ⊢ (𝜑 → 𝐵:𝑋⟶ℝ)
6	5, 3	ffvelrnd 6944	. . . . 5 ⊢ (𝜑 → (𝐵‘𝑍) ∈ ℝ)
7		hsphoidmvle2.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℝ)
8	6, 7	ifcld 4502	. . . 4 ⊢ (𝜑 → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ∈ ℝ)
9		volicore 44009	. . . 4 ⊢ (((𝐴‘𝑍) ∈ ℝ ∧ if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ∈ ℝ) → (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) ∈ ℝ)
10	4, 8, 9	syl2anc 583	. . 3 ⊢ (𝜑 → (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) ∈ ℝ)
11		hsphoidmvle2.d	. . . . 5 ⊢ (𝜑 → 𝐷 ∈ ℝ)
12	6, 11	ifcld 4502	. . . 4 ⊢ (𝜑 → if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) ∈ ℝ)
13		volicore 44009	. . . 4 ⊢ (((𝐴‘𝑍) ∈ ℝ ∧ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) ∈ ℝ) → (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) ∈ ℝ)
14	4, 12, 13	syl2anc 583	. . 3 ⊢ (𝜑 → (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) ∈ ℝ)
15		hsphoidmvle2.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ Fin)
16		difssd 4063	. . . . 5 ⊢ (𝜑 → (𝑋 ∖ {𝑍}) ⊆ 𝑋)
17		ssfi 8918	. . . . 5 ⊢ ((𝑋 ∈ Fin ∧ (𝑋 ∖ {𝑍}) ⊆ 𝑋) → (𝑋 ∖ {𝑍}) ∈ Fin)
18	15, 16, 17	syl2anc 583	. . . 4 ⊢ (𝜑 → (𝑋 ∖ {𝑍}) ∈ Fin)
19		eldifi 4057	. . . . . 6 ⊢ (𝑘 ∈ (𝑋 ∖ {𝑍}) → 𝑘 ∈ 𝑋)
20	19	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → 𝑘 ∈ 𝑋)
21	1	ffvelrnda 6943	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) ∈ ℝ)
22	5	ffvelrnda 6943	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐵‘𝑘) ∈ ℝ)
23		volicore 44009	. . . . . 6 ⊢ (((𝐴‘𝑘) ∈ ℝ ∧ (𝐵‘𝑘) ∈ ℝ) → (vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))) ∈ ℝ)
24	21, 22, 23	syl2anc 583	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))) ∈ ℝ)
25	20, 24	syldan 590	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))) ∈ ℝ)
26	18, 25	fprodrecl 15591	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))) ∈ ℝ)
27		nfv 1918	. . . 4 ⊢ Ⅎ𝑘𝜑
28	20, 21	syldan 590	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (𝐴‘𝑘) ∈ ℝ)
29	20, 22	syldan 590	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (𝐵‘𝑘) ∈ ℝ)
30	29	rexrd 10956	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (𝐵‘𝑘) ∈ ℝ^*)
31		icombl 24633	. . . . . 6 ⊢ (((𝐴‘𝑘) ∈ ℝ ∧ (𝐵‘𝑘) ∈ ℝ^*) → ((𝐴‘𝑘)[,)(𝐵‘𝑘)) ∈ dom vol)
32	28, 30, 31	syl2anc 583	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → ((𝐴‘𝑘)[,)(𝐵‘𝑘)) ∈ dom vol)
33		volge0 43392	. . . . 5 ⊢ (((𝐴‘𝑘)[,)(𝐵‘𝑘)) ∈ dom vol → 0 ≤ (vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))
34	32, 33	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → 0 ≤ (vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))
35	27, 18, 25, 34	fprodge0 15631	. . 3 ⊢ (𝜑 → 0 ≤ ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))
36	8	rexrd 10956	. . . . 5 ⊢ (𝜑 → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ∈ ℝ^*)
37		icombl 24633	. . . . 5 ⊢ (((𝐴‘𝑍) ∈ ℝ ∧ if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ∈ ℝ^*) → ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)) ∈ dom vol)
38	4, 36, 37	syl2anc 583	. . . 4 ⊢ (𝜑 → ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)) ∈ dom vol)
39	12	rexrd 10956	. . . . 5 ⊢ (𝜑 → if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) ∈ ℝ^*)
40		icombl 24633	. . . . 5 ⊢ (((𝐴‘𝑍) ∈ ℝ ∧ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) ∈ ℝ^*) → ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)) ∈ dom vol)
41	4, 39, 40	syl2anc 583	. . . 4 ⊢ (𝜑 → ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)) ∈ dom vol)
42	4	rexrd 10956	. . . . 5 ⊢ (𝜑 → (𝐴‘𝑍) ∈ ℝ^*)
43	4	leidd 11471	. . . . 5 ⊢ (𝜑 → (𝐴‘𝑍) ≤ (𝐴‘𝑍))
44	6	leidd 11471	. . . . . . . 8 ⊢ (𝜑 → (𝐵‘𝑍) ≤ (𝐵‘𝑍))
45	44	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → (𝐵‘𝑍) ≤ (𝐵‘𝑍))
46		iftrue 4462	. . . . . . . . 9 ⊢ ((𝐵‘𝑍) ≤ 𝐶 → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) = (𝐵‘𝑍))
47	46	adantl 481	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) = (𝐵‘𝑍))
48	6	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → (𝐵‘𝑍) ∈ ℝ)
49	7	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → 𝐶 ∈ ℝ)
50	11	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → 𝐷 ∈ ℝ)
51		simpr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → (𝐵‘𝑍) ≤ 𝐶)
52		hsphoidmvle2.e	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐶 ≤ 𝐷)
53	52	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → 𝐶 ≤ 𝐷)
54	48, 49, 50, 51, 53	letrd 11062	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → (𝐵‘𝑍) ≤ 𝐷)
55	54	iftrued 4464	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) = (𝐵‘𝑍))
56	47, 55	breq12d 5083	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → (if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) ↔ (𝐵‘𝑍) ≤ (𝐵‘𝑍)))
57	45, 56	mpbird 256	. . . . . 6 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
58		simpl 482	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → 𝜑)
59		simpr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → ¬ (𝐵‘𝑍) ≤ 𝐶)
60	58, 7	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → 𝐶 ∈ ℝ)
61	58, 6	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → (𝐵‘𝑍) ∈ ℝ)
62	60, 61	ltnled 11052	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → (𝐶 < (𝐵‘𝑍) ↔ ¬ (𝐵‘𝑍) ≤ 𝐶))
63	59, 62	mpbird 256	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → 𝐶 < (𝐵‘𝑍))
64	7	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) → 𝐶 ∈ ℝ)
65	6	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) → (𝐵‘𝑍) ∈ ℝ)
66		simpr 484	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) → 𝐶 < (𝐵‘𝑍))
67	64, 65, 66	ltled 11053	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) → 𝐶 ≤ (𝐵‘𝑍))
68	67	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) ∧ (𝐵‘𝑍) ≤ 𝐷) → 𝐶 ≤ (𝐵‘𝑍))
69		iftrue 4462	. . . . . . . . . . . 12 ⊢ ((𝐵‘𝑍) ≤ 𝐷 → if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) = (𝐵‘𝑍))
70	69	eqcomd 2744	. . . . . . . . . . 11 ⊢ ((𝐵‘𝑍) ≤ 𝐷 → (𝐵‘𝑍) = if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
71	70	adantl 481	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) ∧ (𝐵‘𝑍) ≤ 𝐷) → (𝐵‘𝑍) = if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
72	68, 71	breqtrd 5096	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) ∧ (𝐵‘𝑍) ≤ 𝐷) → 𝐶 ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
73	52	ad2antrr 722	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) ∧ ¬ (𝐵‘𝑍) ≤ 𝐷) → 𝐶 ≤ 𝐷)
74		iffalse 4465	. . . . . . . . . . . 12 ⊢ (¬ (𝐵‘𝑍) ≤ 𝐷 → if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) = 𝐷)
75	74	eqcomd 2744	. . . . . . . . . . 11 ⊢ (¬ (𝐵‘𝑍) ≤ 𝐷 → 𝐷 = if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
76	75	adantl 481	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) ∧ ¬ (𝐵‘𝑍) ≤ 𝐷) → 𝐷 = if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
77	73, 76	breqtrd 5096	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) ∧ ¬ (𝐵‘𝑍) ≤ 𝐷) → 𝐶 ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
78	72, 77	pm2.61dan 809	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) → 𝐶 ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
79	58, 63, 78	syl2anc 583	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → 𝐶 ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
80		iffalse 4465	. . . . . . . . 9 ⊢ (¬ (𝐵‘𝑍) ≤ 𝐶 → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) = 𝐶)
81	80	adantl 481	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) = 𝐶)
82	81	breq1d 5080	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → (if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) ↔ 𝐶 ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)))
83	79, 82	mpbird 256	. . . . . 6 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
84	57, 83	pm2.61dan 809	. . . . 5 ⊢ (𝜑 → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
85		icossico 13078	. . . . 5 ⊢ ((((𝐴‘𝑍) ∈ ℝ^* ∧ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) ∈ ℝ^*) ∧ ((𝐴‘𝑍) ≤ (𝐴‘𝑍) ∧ if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) → ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)) ⊆ ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)))
86	42, 39, 43, 84, 85	syl22anc 835	. . . 4 ⊢ (𝜑 → ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)) ⊆ ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)))
87		volss 24602	. . . 4 ⊢ ((((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)) ∈ dom vol ∧ ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)) ∈ dom vol ∧ ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)) ⊆ ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) → (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) ≤ (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))))
88	38, 41, 86, 87	syl3anc 1369	. . 3 ⊢ (𝜑 → (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) ≤ (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))))
89	10, 14, 26, 35, 88	lemul1ad 11844	. 2 ⊢ (𝜑 → ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘)))) ≤ ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘)))))
90		hsphoidmvle2.l	. . . . 5 ⊢ 𝐿 = (𝑥 ∈ Fin ↦ (𝑎 ∈ (ℝ ↑_m 𝑥), 𝑏 ∈ (ℝ ↑_m 𝑥) ↦ if(𝑥 = ∅, 0, ∏𝑘 ∈ 𝑥 (vol‘((𝑎‘𝑘)[,)(𝑏‘𝑘))))))
91	3	ne0d 4266	. . . . 5 ⊢ (𝜑 → 𝑋 ≠ ∅)
92		hsphoidmvle2.h	. . . . . 6 ⊢ 𝐻 = (𝑥 ∈ ℝ ↦ (𝑐 ∈ (ℝ ↑_m 𝑋) ↦ (𝑗 ∈ 𝑋 ↦ if(𝑗 ∈ 𝑌, (𝑐‘𝑗), if((𝑐‘𝑗) ≤ 𝑥, (𝑐‘𝑗), 𝑥)))))
93	92, 7, 15, 5	hsphoif 44004	. . . . 5 ⊢ (𝜑 → ((𝐻‘𝐶)‘𝐵):𝑋⟶ℝ)
94	90, 15, 91, 1, 93	hoidmvn0val 44012	. . . 4 ⊢ (𝜑 → (𝐴(𝐿‘𝑋)((𝐻‘𝐶)‘𝐵)) = ∏𝑘 ∈ 𝑋 (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))))
95	93	ffvelrnda 6943	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (((𝐻‘𝐶)‘𝐵)‘𝑘) ∈ ℝ)
96		volicore 44009	. . . . . . 7 ⊢ (((𝐴‘𝑘) ∈ ℝ ∧ (((𝐻‘𝐶)‘𝐵)‘𝑘) ∈ ℝ) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) ∈ ℝ)
97	21, 95, 96	syl2anc 583	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) ∈ ℝ)
98	97	recnd 10934	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) ∈ ℂ)
99		fveq2 6756	. . . . . . . . 9 ⊢ (𝑘 = 𝑍 → (𝐴‘𝑘) = (𝐴‘𝑍))
100		fveq2 6756	. . . . . . . . 9 ⊢ (𝑘 = 𝑍 → (((𝐻‘𝐶)‘𝐵)‘𝑘) = (((𝐻‘𝐶)‘𝐵)‘𝑍))
101	99, 100	oveq12d 7273	. . . . . . . 8 ⊢ (𝑘 = 𝑍 → ((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘)) = ((𝐴‘𝑍)[,)(((𝐻‘𝐶)‘𝐵)‘𝑍)))
102	101	fveq2d 6760	. . . . . . 7 ⊢ (𝑘 = 𝑍 → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) = (vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐶)‘𝐵)‘𝑍))))
103	102	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 𝑍) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) = (vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐶)‘𝐵)‘𝑍))))
104	92, 7, 15, 5, 3	hsphoival 44007	. . . . . . . . . 10 ⊢ (𝜑 → (((𝐻‘𝐶)‘𝐵)‘𝑍) = if(𝑍 ∈ 𝑌, (𝐵‘𝑍), if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)))
105	2	eldifbd 3896	. . . . . . . . . . 11 ⊢ (𝜑 → ¬ 𝑍 ∈ 𝑌)
106	105	iffalsed 4467	. . . . . . . . . 10 ⊢ (𝜑 → if(𝑍 ∈ 𝑌, (𝐵‘𝑍), if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)) = if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))
107	104, 106	eqtrd 2778	. . . . . . . . 9 ⊢ (𝜑 → (((𝐻‘𝐶)‘𝐵)‘𝑍) = if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))
108	107	oveq2d 7271	. . . . . . . 8 ⊢ (𝜑 → ((𝐴‘𝑍)[,)(((𝐻‘𝐶)‘𝐵)‘𝑍)) = ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)))
109	108	fveq2d 6760	. . . . . . 7 ⊢ (𝜑 → (vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐶)‘𝐵)‘𝑍))) = (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))))
110	109	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 𝑍) → (vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐶)‘𝐵)‘𝑍))) = (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))))
111	103, 110	eqtrd 2778	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 = 𝑍) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) = (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))))
112	15, 98, 3, 111	fprodsplit1 43024	. . . 4 ⊢ (𝜑 → ∏𝑘 ∈ 𝑋 (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) = ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘)))))
113	7	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → 𝐶 ∈ ℝ)
114	15	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → 𝑋 ∈ Fin)
115	5	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → 𝐵:𝑋⟶ℝ)
116	92, 113, 114, 115, 20	hsphoival 44007	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (((𝐻‘𝐶)‘𝐵)‘𝑘) = if(𝑘 ∈ 𝑌, (𝐵‘𝑘), if((𝐵‘𝑘) ≤ 𝐶, (𝐵‘𝑘), 𝐶)))
117		hsphoidmvle2.y	. . . . . . . . . . . . 13 ⊢ 𝑋 = (𝑌 ∪ {𝑍})
118	19, 117	eleqtrdi 2849	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ (𝑋 ∖ {𝑍}) → 𝑘 ∈ (𝑌 ∪ {𝑍}))
119		eldifn 4058	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ (𝑋 ∖ {𝑍}) → ¬ 𝑘 ∈ {𝑍})
120		elunnel2 42471	. . . . . . . . . . . 12 ⊢ ((𝑘 ∈ (𝑌 ∪ {𝑍}) ∧ ¬ 𝑘 ∈ {𝑍}) → 𝑘 ∈ 𝑌)
121	118, 119, 120	syl2anc 583	. . . . . . . . . . 11 ⊢ (𝑘 ∈ (𝑋 ∖ {𝑍}) → 𝑘 ∈ 𝑌)
122	121	adantl 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → 𝑘 ∈ 𝑌)
123	122	iftrued 4464	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → if(𝑘 ∈ 𝑌, (𝐵‘𝑘), if((𝐵‘𝑘) ≤ 𝐶, (𝐵‘𝑘), 𝐶)) = (𝐵‘𝑘))
124	116, 123	eqtrd 2778	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (((𝐻‘𝐶)‘𝐵)‘𝑘) = (𝐵‘𝑘))
125	124	oveq2d 7271	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → ((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘)) = ((𝐴‘𝑘)[,)(𝐵‘𝑘)))
126	125	fveq2d 6760	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) = (vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))
127	126	prodeq2dv 15561	. . . . 5 ⊢ (𝜑 → ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) = ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))
128	127	oveq2d 7271	. . . 4 ⊢ (𝜑 → ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘)))) = ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘)))))
129	94, 112, 128	3eqtrd 2782	. . 3 ⊢ (𝜑 → (𝐴(𝐿‘𝑋)((𝐻‘𝐶)‘𝐵)) = ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘)))))
130	92, 11, 15, 5	hsphoif 44004	. . . . 5 ⊢ (𝜑 → ((𝐻‘𝐷)‘𝐵):𝑋⟶ℝ)
131	90, 15, 91, 1, 130	hoidmvn0val 44012	. . . 4 ⊢ (𝜑 → (𝐴(𝐿‘𝑋)((𝐻‘𝐷)‘𝐵)) = ∏𝑘 ∈ 𝑋 (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))))
132	130	ffvelrnda 6943	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (((𝐻‘𝐷)‘𝐵)‘𝑘) ∈ ℝ)
133		volicore 44009	. . . . . . 7 ⊢ (((𝐴‘𝑘) ∈ ℝ ∧ (((𝐻‘𝐷)‘𝐵)‘𝑘) ∈ ℝ) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) ∈ ℝ)
134	21, 132, 133	syl2anc 583	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) ∈ ℝ)
135	134	recnd 10934	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) ∈ ℂ)
136		fveq2 6756	. . . . . . . 8 ⊢ (𝑘 = 𝑍 → (((𝐻‘𝐷)‘𝐵)‘𝑘) = (((𝐻‘𝐷)‘𝐵)‘𝑍))
137	99, 136	oveq12d 7273	. . . . . . 7 ⊢ (𝑘 = 𝑍 → ((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘)) = ((𝐴‘𝑍)[,)(((𝐻‘𝐷)‘𝐵)‘𝑍)))
138	137	fveq2d 6760	. . . . . 6 ⊢ (𝑘 = 𝑍 → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) = (vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐷)‘𝐵)‘𝑍))))
139	138	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 = 𝑍) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) = (vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐷)‘𝐵)‘𝑍))))
140	15, 135, 3, 139	fprodsplit1 43024	. . . 4 ⊢ (𝜑 → ∏𝑘 ∈ 𝑋 (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) = ((vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐷)‘𝐵)‘𝑍))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘)))))
141	92, 11, 15, 5, 3	hsphoival 44007	. . . . . . . 8 ⊢ (𝜑 → (((𝐻‘𝐷)‘𝐵)‘𝑍) = if(𝑍 ∈ 𝑌, (𝐵‘𝑍), if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)))
142	105	iffalsed 4467	. . . . . . . 8 ⊢ (𝜑 → if(𝑍 ∈ 𝑌, (𝐵‘𝑍), if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)) = if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
143	141, 142	eqtrd 2778	. . . . . . 7 ⊢ (𝜑 → (((𝐻‘𝐷)‘𝐵)‘𝑍) = if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
144	143	oveq2d 7271	. . . . . 6 ⊢ (𝜑 → ((𝐴‘𝑍)[,)(((𝐻‘𝐷)‘𝐵)‘𝑍)) = ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)))
145	144	fveq2d 6760	. . . . 5 ⊢ (𝜑 → (vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐷)‘𝐵)‘𝑍))) = (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))))
146	11	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → 𝐷 ∈ ℝ)
147	92, 146, 114, 115, 20	hsphoival 44007	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (((𝐻‘𝐷)‘𝐵)‘𝑘) = if(𝑘 ∈ 𝑌, (𝐵‘𝑘), if((𝐵‘𝑘) ≤ 𝐷, (𝐵‘𝑘), 𝐷)))
148	122	iftrued 4464	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → if(𝑘 ∈ 𝑌, (𝐵‘𝑘), if((𝐵‘𝑘) ≤ 𝐷, (𝐵‘𝑘), 𝐷)) = (𝐵‘𝑘))
149	147, 148	eqtrd 2778	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (((𝐻‘𝐷)‘𝐵)‘𝑘) = (𝐵‘𝑘))
150	149	oveq2d 7271	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → ((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘)) = ((𝐴‘𝑘)[,)(𝐵‘𝑘)))
151	150	fveq2d 6760	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) = (vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))
152	151	prodeq2dv 15561	. . . . 5 ⊢ (𝜑 → ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) = ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))
153	145, 152	oveq12d 7273	. . . 4 ⊢ (𝜑 → ((vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐷)‘𝐵)‘𝑍))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘)))) = ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘)))))
154	131, 140, 153	3eqtrd 2782	. . 3 ⊢ (𝜑 → (𝐴(𝐿‘𝑋)((𝐻‘𝐷)‘𝐵)) = ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘)))))
155	129, 154	breq12d 5083	. 2 ⊢ (𝜑 → ((𝐴(𝐿‘𝑋)((𝐻‘𝐶)‘𝐵)) ≤ (𝐴(𝐿‘𝑋)((𝐻‘𝐷)‘𝐵)) ↔ ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘)))) ≤ ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))))
156	89, 155	mpbird 256	1 ⊢ (𝜑 → (𝐴(𝐿‘𝑋)((𝐻‘𝐶)‘𝐵)) ≤ (𝐴(𝐿‘𝑋)((𝐻‘𝐷)‘𝐵)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∖ cdif 3880 ∪ cun 3881 ⊆ wss 3883 ∅c0 4253 ifcif 4456 {csn 4558 class class class wbr 5070 ↦ cmpt 5153 dom cdm 5580 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 ∈ cmpo 7257 ↑_m cmap 8573 Fincfn 8691 ℝcr 10801 0cc0 10802 · cmul 10807 ℝ^*cxr 10939 < clt 10940 ≤ cle 10941 [,)cico 13010 ∏cprod 15543 volcvol 24532

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-inf2 9329 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-se 5536 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-isom 6427 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-of 7511 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-2o 8268 df-er 8456 df-map 8575 df-pm 8576 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-fi 9100 df-sup 9131 df-inf 9132 df-oi 9199 df-dju 9590 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-n0 12164 df-z 12250 df-uz 12512 df-q 12618 df-rp 12660 df-xneg 12777 df-xadd 12778 df-xmul 12779 df-ioo 13012 df-ico 13014 df-icc 13015 df-fz 13169 df-fzo 13312 df-fl 13440 df-seq 13650 df-exp 13711 df-hash 13973 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-clim 15125 df-rlim 15126 df-sum 15326 df-prod 15544 df-rest 17050 df-topgen 17071 df-psmet 20502 df-xmet 20503 df-met 20504 df-bl 20505 df-mopn 20506 df-top 21951 df-topon 21968 df-bases 22004 df-cmp 22446 df-ovol 24533 df-vol 24534

This theorem is referenced by: hoidmvlelem1 44023 hoidmvlelem2 44024

W3C validator