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 47359

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 3918	. . . . 5 ⊢ (𝜑 → 𝑍 ∈ 𝑋)
4	1, 3	ffvelcdmd 7084	. . . 4 ⊢ (𝜑 → (𝐴‘𝑍) ∈ ℝ)
5		hsphoidmvle2.b	. . . . . 6 ⊢ (𝜑 → 𝐵:𝑋⟶ℝ)
6	5, 3	ffvelcdmd 7084	. . . . 5 ⊢ (𝜑 → (𝐵‘𝑍) ∈ ℝ)
7		hsphoidmvle2.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℝ)
8	6, 7	ifcld 4536	. . . 4 ⊢ (𝜑 → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ∈ ℝ)
9		volicore 47355	. . . 4 ⊢ (((𝐴‘𝑍) ∈ ℝ ∧ if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ∈ ℝ) → (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) ∈ ℝ)
10	4, 8, 9	syl2anc 596	. . 3 ⊢ (𝜑 → (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) ∈ ℝ)
11		hsphoidmvle2.d	. . . . 5 ⊢ (𝜑 → 𝐷 ∈ ℝ)
12	6, 11	ifcld 4536	. . . 4 ⊢ (𝜑 → if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) ∈ ℝ)
13		volicore 47355	. . . 4 ⊢ (((𝐴‘𝑍) ∈ ℝ ∧ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) ∈ ℝ) → (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) ∈ ℝ)
14	4, 12, 13	syl2anc 596	. . 3 ⊢ (𝜑 → (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) ∈ ℝ)
15		hsphoidmvle2.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ Fin)
16		difssd 4091	. . . . 5 ⊢ (𝜑 → (𝑋 ∖ {𝑍}) ⊆ 𝑋)
17		ssfi 9164	. . . . 5 ⊢ ((𝑋 ∈ Fin ∧ (𝑋 ∖ {𝑍}) ⊆ 𝑋) → (𝑋 ∖ {𝑍}) ∈ Fin)
18	15, 16, 17	syl2anc 596	. . . 4 ⊢ (𝜑 → (𝑋 ∖ {𝑍}) ∈ Fin)
19		eldifi 4085	. . . . . 6 ⊢ (𝑘 ∈ (𝑋 ∖ {𝑍}) → 𝑘 ∈ 𝑋)
20	19	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → 𝑘 ∈ 𝑋)
21	1	ffvelcdmda 7083	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) ∈ ℝ)
22	5	ffvelcdmda 7083	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐵‘𝑘) ∈ ℝ)
23		volicore 47355	. . . . . 6 ⊢ (((𝐴‘𝑘) ∈ ℝ ∧ (𝐵‘𝑘) ∈ ℝ) → (vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))) ∈ ℝ)
24	21, 22, 23	syl2anc 596	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))) ∈ ℝ)
25	20, 24	syldan 603	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))) ∈ ℝ)
26	18, 25	fprodrecl 16032	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))) ∈ ℝ)
27		nfv 1947	. . . 4 ⊢ Ⅎ𝑘𝜑
28	20, 21	syldan 603	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (𝐴‘𝑘) ∈ ℝ)
29	20, 22	syldan 603	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (𝐵‘𝑘) ∈ ℝ)
30	29	rexrd 11276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (𝐵‘𝑘) ∈ ℝ^*)
31		icombl 25776	. . . . . 6 ⊢ (((𝐴‘𝑘) ∈ ℝ ∧ (𝐵‘𝑘) ∈ ℝ^*) → ((𝐴‘𝑘)[,)(𝐵‘𝑘)) ∈ dom vol)
32	28, 30, 31	syl2anc 596	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → ((𝐴‘𝑘)[,)(𝐵‘𝑘)) ∈ dom vol)
33		volge0 46735	. . . . 5 ⊢ (((𝐴‘𝑘)[,)(𝐵‘𝑘)) ∈ dom vol → 0 ≤ (vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))
34	32, 33	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → 0 ≤ (vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))
35	27, 18, 25, 34	fprodge0 16072	. . 3 ⊢ (𝜑 → 0 ≤ ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))
36	8	rexrd 11276	. . . . 5 ⊢ (𝜑 → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ∈ ℝ^*)
37		icombl 25776	. . . . 5 ⊢ (((𝐴‘𝑍) ∈ ℝ ∧ if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ∈ ℝ^*) → ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)) ∈ dom vol)
38	4, 36, 37	syl2anc 596	. . . 4 ⊢ (𝜑 → ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)) ∈ dom vol)
39	12	rexrd 11276	. . . . 5 ⊢ (𝜑 → if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) ∈ ℝ^*)
40		icombl 25776	. . . . 5 ⊢ (((𝐴‘𝑍) ∈ ℝ ∧ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) ∈ ℝ^*) → ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)) ∈ dom vol)
41	4, 39, 40	syl2anc 596	. . . 4 ⊢ (𝜑 → ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)) ∈ dom vol)
42	4	rexrd 11276	. . . . 5 ⊢ (𝜑 → (𝐴‘𝑍) ∈ ℝ^*)
43	4	leidd 11797	. . . . 5 ⊢ (𝜑 → (𝐴‘𝑍) ≤ (𝐴‘𝑍))
44	6	leidd 11797	. . . . . . . 8 ⊢ (𝜑 → (𝐵‘𝑍) ≤ (𝐵‘𝑍))
45	44	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → (𝐵‘𝑍) ≤ (𝐵‘𝑍))
46		iftrue 4495	. . . . . . . . 9 ⊢ ((𝐵‘𝑍) ≤ 𝐶 → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) = (𝐵‘𝑍))
47	46	adantl 487	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) = (𝐵‘𝑍))
48	6	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → (𝐵‘𝑍) ∈ ℝ)
49	7	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → 𝐶 ∈ ℝ)
50	11	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → 𝐷 ∈ ℝ)
51		simpr 490	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → (𝐵‘𝑍) ≤ 𝐶)
52		hsphoidmvle2.e	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐶 ≤ 𝐷)
53	52	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → 𝐶 ≤ 𝐷)
54	48, 49, 50, 51, 53	letrd 11384	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → (𝐵‘𝑍) ≤ 𝐷)
55	54	iftrued 4497	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) = (𝐵‘𝑍))
56	47, 55	breq12d 5124	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → (if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) ↔ (𝐵‘𝑍) ≤ (𝐵‘𝑍)))
57	45, 56	mpbird 260	. . . . . 6 ⊢ ((𝜑 ∧ (𝐵‘𝑍) ≤ 𝐶) → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
58		simpl 488	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → 𝜑)
59		simpr 490	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → ¬ (𝐵‘𝑍) ≤ 𝐶)
60	58, 7	syl 18	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → 𝐶 ∈ ℝ)
61	58, 6	syl 18	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → (𝐵‘𝑍) ∈ ℝ)
62	60, 61	ltnled 11374	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → (𝐶 < (𝐵‘𝑍) ↔ ¬ (𝐵‘𝑍) ≤ 𝐶))
63	59, 62	mpbird 260	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → 𝐶 < (𝐵‘𝑍))
64	7	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) → 𝐶 ∈ ℝ)
65	6	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) → (𝐵‘𝑍) ∈ ℝ)
66		simpr 490	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) → 𝐶 < (𝐵‘𝑍))
67	64, 65, 66	ltled 11375	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) → 𝐶 ≤ (𝐵‘𝑍))
68	67	adantr 486	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) ∧ (𝐵‘𝑍) ≤ 𝐷) → 𝐶 ≤ (𝐵‘𝑍))
69		iftrue 4495	. . . . . . . . . . . 12 ⊢ ((𝐵‘𝑍) ≤ 𝐷 → if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) = (𝐵‘𝑍))
70	69	eqcomd 2771	. . . . . . . . . . 11 ⊢ ((𝐵‘𝑍) ≤ 𝐷 → (𝐵‘𝑍) = if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
71	70	adantl 487	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) ∧ (𝐵‘𝑍) ≤ 𝐷) → (𝐵‘𝑍) = if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
72	68, 71	breqtrd 5139	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) ∧ (𝐵‘𝑍) ≤ 𝐷) → 𝐶 ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
73	52	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) ∧ ¬ (𝐵‘𝑍) ≤ 𝐷) → 𝐶 ≤ 𝐷)
74		iffalse 4498	. . . . . . . . . . . 12 ⊢ (¬ (𝐵‘𝑍) ≤ 𝐷 → if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) = 𝐷)
75	74	eqcomd 2771	. . . . . . . . . . 11 ⊢ (¬ (𝐵‘𝑍) ≤ 𝐷 → 𝐷 = if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
76	75	adantl 487	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) ∧ ¬ (𝐵‘𝑍) ≤ 𝐷) → 𝐷 = if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
77	73, 76	breqtrd 5139	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) ∧ ¬ (𝐵‘𝑍) ≤ 𝐷) → 𝐶 ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
78	72, 77	pm2.61dan 825	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 < (𝐵‘𝑍)) → 𝐶 ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
79	58, 63, 78	syl2anc 596	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → 𝐶 ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
80		iffalse 4498	. . . . . . . . 9 ⊢ (¬ (𝐵‘𝑍) ≤ 𝐶 → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) = 𝐶)
81	80	adantl 487	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) = 𝐶)
82	81	breq1d 5121	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → (if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) ↔ 𝐶 ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)))
83	79, 82	mpbird 260	. . . . . 6 ⊢ ((𝜑 ∧ ¬ (𝐵‘𝑍) ≤ 𝐶) → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
84	57, 83	pm2.61dan 825	. . . . 5 ⊢ (𝜑 → if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
85		icossico 13461	. . . . 5 ⊢ ((((𝐴‘𝑍) ∈ ℝ^* ∧ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷) ∈ ℝ^*) ∧ ((𝐴‘𝑍) ≤ (𝐴‘𝑍) ∧ if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶) ≤ if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) → ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)) ⊆ ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)))
86	42, 39, 43, 84, 85	syl22anc 852	. . . 4 ⊢ (𝜑 → ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)) ⊆ ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)))
87		volss 25745	. . . 4 ⊢ ((((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)) ∈ dom vol ∧ ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)) ∈ dom vol ∧ ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)) ⊆ ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) → (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) ≤ (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))))
88	38, 41, 86, 87	syl3anc 1398	. . 3 ⊢ (𝜑 → (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) ≤ (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))))
89	10, 14, 26, 35, 88	lemul1ad 12171	. 2 ⊢ (𝜑 → ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘)))) ≤ ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘)))))
90		hsphoidmvle2.l	. . . . 5 ⊢ 𝐿 = (𝑥 ∈ Fin ↦ (𝑎 ∈ (ℝ ↑_m 𝑥), 𝑏 ∈ (ℝ ↑_m 𝑥) ↦ if(𝑥 = ∅, 0, ∏𝑘 ∈ 𝑥 (vol‘((𝑎‘𝑘)[,)(𝑏‘𝑘))))))
91	3	ne0d 4295	. . . . 5 ⊢ (𝜑 → 𝑋 ≠ ∅)
92		hsphoidmvle2.h	. . . . . 6 ⊢ 𝐻 = (𝑥 ∈ ℝ ↦ (𝑐 ∈ (ℝ ↑_m 𝑋) ↦ (𝑗 ∈ 𝑋 ↦ if(𝑗 ∈ 𝑌, (𝑐‘𝑗), if((𝑐‘𝑗) ≤ 𝑥, (𝑐‘𝑗), 𝑥)))))
93	92, 7, 15, 5	hsphoif 47350	. . . . 5 ⊢ (𝜑 → ((𝐻‘𝐶)‘𝐵):𝑋⟶ℝ)
94	90, 15, 91, 1, 93	hoidmvn0val 47358	. . . 4 ⊢ (𝜑 → (𝐴(𝐿‘𝑋)((𝐻‘𝐶)‘𝐵)) = ∏𝑘 ∈ 𝑋 (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))))
95	93	ffvelcdmda 7083	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (((𝐻‘𝐶)‘𝐵)‘𝑘) ∈ ℝ)
96		volicore 47355	. . . . . . 7 ⊢ (((𝐴‘𝑘) ∈ ℝ ∧ (((𝐻‘𝐶)‘𝐵)‘𝑘) ∈ ℝ) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) ∈ ℝ)
97	21, 95, 96	syl2anc 596	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) ∈ ℝ)
98	97	recnd 11254	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) ∈ ℂ)
99		fveq2 6885	. . . . . . . . 9 ⊢ (𝑘 = 𝑍 → (𝐴‘𝑘) = (𝐴‘𝑍))
100		fveq2 6885	. . . . . . . . 9 ⊢ (𝑘 = 𝑍 → (((𝐻‘𝐶)‘𝐵)‘𝑘) = (((𝐻‘𝐶)‘𝐵)‘𝑍))
101	99, 100	oveq12d 7437	. . . . . . . 8 ⊢ (𝑘 = 𝑍 → ((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘)) = ((𝐴‘𝑍)[,)(((𝐻‘𝐶)‘𝐵)‘𝑍)))
102	101	fveq2d 6889	. . . . . . 7 ⊢ (𝑘 = 𝑍 → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) = (vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐶)‘𝐵)‘𝑍))))
103	102	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 𝑍) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) = (vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐶)‘𝐵)‘𝑍))))
104	92, 7, 15, 5, 3	hsphoival 47353	. . . . . . . . . 10 ⊢ (𝜑 → (((𝐻‘𝐶)‘𝐵)‘𝑍) = if(𝑍 ∈ 𝑌, (𝐵‘𝑍), if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)))
105	2	eldifbd 3919	. . . . . . . . . . 11 ⊢ (𝜑 → ¬ 𝑍 ∈ 𝑌)
106	105	iffalsed 4500	. . . . . . . . . 10 ⊢ (𝜑 → if(𝑍 ∈ 𝑌, (𝐵‘𝑍), if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)) = if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))
107	104, 106	eqtrd 2800	. . . . . . . . 9 ⊢ (𝜑 → (((𝐻‘𝐶)‘𝐵)‘𝑍) = if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))
108	107	oveq2d 7435	. . . . . . . 8 ⊢ (𝜑 → ((𝐴‘𝑍)[,)(((𝐻‘𝐶)‘𝐵)‘𝑍)) = ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶)))
109	108	fveq2d 6889	. . . . . . 7 ⊢ (𝜑 → (vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐶)‘𝐵)‘𝑍))) = (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))))
110	109	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 𝑍) → (vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐶)‘𝐵)‘𝑍))) = (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))))
111	103, 110	eqtrd 2800	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 = 𝑍) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) = (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))))
112	15, 98, 3, 111	fprodsplit1 46369	. . . 4 ⊢ (𝜑 → ∏𝑘 ∈ 𝑋 (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) = ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘)))))
113	7	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → 𝐶 ∈ ℝ)
114	15	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → 𝑋 ∈ Fin)
115	5	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → 𝐵:𝑋⟶ℝ)
116	92, 113, 114, 115, 20	hsphoival 47353	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (((𝐻‘𝐶)‘𝐵)‘𝑘) = if(𝑘 ∈ 𝑌, (𝐵‘𝑘), if((𝐵‘𝑘) ≤ 𝐶, (𝐵‘𝑘), 𝐶)))
117		hsphoidmvle2.y	. . . . . . . . . . . . 13 ⊢ 𝑋 = (𝑌 ∪ {𝑍})
118	19, 117	eleqtrdi 2875	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ (𝑋 ∖ {𝑍}) → 𝑘 ∈ (𝑌 ∪ {𝑍}))
119		eldifn 4086	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ (𝑋 ∖ {𝑍}) → ¬ 𝑘 ∈ {𝑍})
120		elunnel2 4109	. . . . . . . . . . . 12 ⊢ ((𝑘 ∈ (𝑌 ∪ {𝑍}) ∧ ¬ 𝑘 ∈ {𝑍}) → 𝑘 ∈ 𝑌)
121	118, 119, 120	syl2anc 596	. . . . . . . . . . 11 ⊢ (𝑘 ∈ (𝑋 ∖ {𝑍}) → 𝑘 ∈ 𝑌)
122	121	adantl 487	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → 𝑘 ∈ 𝑌)
123	122	iftrued 4497	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → if(𝑘 ∈ 𝑌, (𝐵‘𝑘), if((𝐵‘𝑘) ≤ 𝐶, (𝐵‘𝑘), 𝐶)) = (𝐵‘𝑘))
124	116, 123	eqtrd 2800	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (((𝐻‘𝐶)‘𝐵)‘𝑘) = (𝐵‘𝑘))
125	124	oveq2d 7435	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → ((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘)) = ((𝐴‘𝑘)[,)(𝐵‘𝑘)))
126	125	fveq2d 6889	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) = (vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))
127	126	prodeq2dv 16001	. . . . 5 ⊢ (𝜑 → ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘))) = ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))
128	127	oveq2d 7435	. . . 4 ⊢ (𝜑 → ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐶)‘𝐵)‘𝑘)))) = ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘)))))
129	94, 112, 128	3eqtrd 2804	. . 3 ⊢ (𝜑 → (𝐴(𝐿‘𝑋)((𝐻‘𝐶)‘𝐵)) = ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘)))))
130	92, 11, 15, 5	hsphoif 47350	. . . . 5 ⊢ (𝜑 → ((𝐻‘𝐷)‘𝐵):𝑋⟶ℝ)
131	90, 15, 91, 1, 130	hoidmvn0val 47358	. . . 4 ⊢ (𝜑 → (𝐴(𝐿‘𝑋)((𝐻‘𝐷)‘𝐵)) = ∏𝑘 ∈ 𝑋 (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))))
132	130	ffvelcdmda 7083	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (((𝐻‘𝐷)‘𝐵)‘𝑘) ∈ ℝ)
133		volicore 47355	. . . . . . 7 ⊢ (((𝐴‘𝑘) ∈ ℝ ∧ (((𝐻‘𝐷)‘𝐵)‘𝑘) ∈ ℝ) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) ∈ ℝ)
134	21, 132, 133	syl2anc 596	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) ∈ ℝ)
135	134	recnd 11254	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) ∈ ℂ)
136		fveq2 6885	. . . . . . . 8 ⊢ (𝑘 = 𝑍 → (((𝐻‘𝐷)‘𝐵)‘𝑘) = (((𝐻‘𝐷)‘𝐵)‘𝑍))
137	99, 136	oveq12d 7437	. . . . . . 7 ⊢ (𝑘 = 𝑍 → ((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘)) = ((𝐴‘𝑍)[,)(((𝐻‘𝐷)‘𝐵)‘𝑍)))
138	137	fveq2d 6889	. . . . . 6 ⊢ (𝑘 = 𝑍 → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) = (vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐷)‘𝐵)‘𝑍))))
139	138	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 = 𝑍) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) = (vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐷)‘𝐵)‘𝑍))))
140	15, 135, 3, 139	fprodsplit1 46369	. . . 4 ⊢ (𝜑 → ∏𝑘 ∈ 𝑋 (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) = ((vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐷)‘𝐵)‘𝑍))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘)))))
141	92, 11, 15, 5, 3	hsphoival 47353	. . . . . . . 8 ⊢ (𝜑 → (((𝐻‘𝐷)‘𝐵)‘𝑍) = if(𝑍 ∈ 𝑌, (𝐵‘𝑍), if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)))
142	105	iffalsed 4500	. . . . . . . 8 ⊢ (𝜑 → if(𝑍 ∈ 𝑌, (𝐵‘𝑍), if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)) = if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
143	141, 142	eqtrd 2800	. . . . . . 7 ⊢ (𝜑 → (((𝐻‘𝐷)‘𝐵)‘𝑍) = if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))
144	143	oveq2d 7435	. . . . . 6 ⊢ (𝜑 → ((𝐴‘𝑍)[,)(((𝐻‘𝐷)‘𝐵)‘𝑍)) = ((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷)))
145	144	fveq2d 6889	. . . . 5 ⊢ (𝜑 → (vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐷)‘𝐵)‘𝑍))) = (vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))))
146	11	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → 𝐷 ∈ ℝ)
147	92, 146, 114, 115, 20	hsphoival 47353	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (((𝐻‘𝐷)‘𝐵)‘𝑘) = if(𝑘 ∈ 𝑌, (𝐵‘𝑘), if((𝐵‘𝑘) ≤ 𝐷, (𝐵‘𝑘), 𝐷)))
148	122	iftrued 4497	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → if(𝑘 ∈ 𝑌, (𝐵‘𝑘), if((𝐵‘𝑘) ≤ 𝐷, (𝐵‘𝑘), 𝐷)) = (𝐵‘𝑘))
149	147, 148	eqtrd 2800	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (((𝐻‘𝐷)‘𝐵)‘𝑘) = (𝐵‘𝑘))
150	149	oveq2d 7435	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → ((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘)) = ((𝐴‘𝑘)[,)(𝐵‘𝑘)))
151	150	fveq2d 6889	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑋 ∖ {𝑍})) → (vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) = (vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))
152	151	prodeq2dv 16001	. . . . 5 ⊢ (𝜑 → ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘))) = ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))
153	145, 152	oveq12d 7437	. . . 4 ⊢ (𝜑 → ((vol‘((𝐴‘𝑍)[,)(((𝐻‘𝐷)‘𝐵)‘𝑍))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(((𝐻‘𝐷)‘𝐵)‘𝑘)))) = ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘)))))
154	131, 140, 153	3eqtrd 2804	. . 3 ⊢ (𝜑 → (𝐴(𝐿‘𝑋)((𝐻‘𝐷)‘𝐵)) = ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘)))))
155	129, 154	breq12d 5124	. 2 ⊢ (𝜑 → ((𝐴(𝐿‘𝑋)((𝐻‘𝐶)‘𝐵)) ≤ (𝐴(𝐿‘𝑋)((𝐻‘𝐷)‘𝐵)) ↔ ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐶, (𝐵‘𝑍), 𝐶))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘)))) ≤ ((vol‘((𝐴‘𝑍)[,)if((𝐵‘𝑍) ≤ 𝐷, (𝐵‘𝑍), 𝐷))) · ∏𝑘 ∈ (𝑋 ∖ {𝑍})(vol‘((𝐴‘𝑘)[,)(𝐵‘𝑘))))))
156	89, 155	mpbird 260	1 ⊢ (𝜑 → (𝐴(𝐿‘𝑋)((𝐻‘𝐶)‘𝐵)) ≤ (𝐴(𝐿‘𝑋)((𝐻‘𝐷)‘𝐵)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∖ cdif 3903 ∪ cun 3904 ⊆ wss 3906 ∅c0 4286 ifcif 4489 {csn 4591 class class class wbr 5111 ↦ cmpt 5194 dom cdm 5663 ⟶wf 6536 ‘cfv 6540 (class class class)co 7419 ∈ cmpo 7421 ↑_m cmap 8830 Fincfn 8949 ℝcr 11116 0cc0 11117 · cmul 11122 ℝ^*cxr 11259 < clt 11260 ≤ cle 11261 [,)cico 13392 ∏cprod 15982 volcvol 25675

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-inf2 9617 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 ax-pre-mulgt0 11194 ax-pre-sup 11195

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-of 7684 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-er 8700 df-map 8832 df-pm 8833 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-fi 9378 df-sup 9409 df-inf 9410 df-oi 9479 df-dju 9903 df-card 9941 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-div 11889 df-nn 12251 df-2 12320 df-3 12321 df-n0 12522 df-z 12609 df-uz 12881 df-q 12991 df-rp 13035 df-xneg 13155 df-xadd 13156 df-xmul 13157 df-ioo 13394 df-ico 13396 df-icc 13397 df-fz 13554 df-fzo 13702 df-fl 13845 df-seq 14058 df-exp 14118 df-hash 14387 df-cj 15176 df-re 15177 df-im 15178 df-sqrt 15312 df-abs 15313 df-clim 15565 df-rlim 15566 df-sum 15764 df-prod 15983 df-rest 17499 df-topgen 17520 df-psmet 21566 df-xmet 21567 df-met 21568 df-bl 21569 df-mopn 21570 df-top 23103 df-topon 23120 df-bases 23155 df-cmp 23596 df-ovol 25676 df-vol 25677

This theorem is used by: hoidmvlelem1 47369 hoidmvlelem2 47370

W3C validator