itgmulc2nclem2 - Mathbox for Brendan Leahy

	Mathbox for Brendan Leahy		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > itgmulc2nclem2		Structured version Visualization version GIF version

Theorem itgmulc2nclem2 37095

Description: Lemma for itgmulc2nc 37096; cf. itgmulc2lem2 25749. (Contributed by Brendan Leahy, 19-Nov-2017.)

**Hypotheses**
Ref	Expression
itgmulc2nc.1	⊢ (𝜑 → 𝐶 ∈ ℂ)
itgmulc2nc.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
itgmulc2nc.3	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)
itgmulc2nc.m	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn)
itgmulc2nc.4	⊢ (𝜑 → 𝐶 ∈ ℝ)
itgmulc2nc.5	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)

**Assertion**
Ref	Expression
itgmulc2nclem2	⊢ (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = ∫𝐴(𝐶 · 𝐵) d𝑥)

Distinct variable groups: 𝑥,𝐴 𝑥,𝐶 𝜑,𝑥 𝑥,𝑉 Allowed substitution hint: 𝐵(𝑥)

**Proof of Theorem itgmulc2nclem2**
Step	Hyp	Ref	Expression
1		itgmulc2nc.4	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℝ)
2		max0sub 13199	. . . . . . 7 ⊢ (𝐶 ∈ ℝ → (if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) = 𝐶)
3	1, 2	syl 17	. . . . . 6 ⊢ (𝜑 → (if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) = 𝐶)
4	3	oveq1d 7429	. . . . 5 ⊢ (𝜑 → ((if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) · 𝐵) = (𝐶 · 𝐵))
5	4	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) · 𝐵) = (𝐶 · 𝐵))
6		0re 11238	. . . . . . . 8 ⊢ 0 ∈ ℝ
7		ifcl 4569	. . . . . . . 8 ⊢ ((𝐶 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℝ)
8	1, 6, 7	sylancl 585	. . . . . . 7 ⊢ (𝜑 → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℝ)
9	8	recnd 11264	. . . . . 6 ⊢ (𝜑 → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℂ)
10	9	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℂ)
11	1	renegcld 11663	. . . . . . . 8 ⊢ (𝜑 → -𝐶 ∈ ℝ)
12		ifcl 4569	. . . . . . . 8 ⊢ ((-𝐶 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ -𝐶, -𝐶, 0) ∈ ℝ)
13	11, 6, 12	sylancl 585	. . . . . . 7 ⊢ (𝜑 → if(0 ≤ -𝐶, -𝐶, 0) ∈ ℝ)
14	13	recnd 11264	. . . . . 6 ⊢ (𝜑 → if(0 ≤ -𝐶, -𝐶, 0) ∈ ℂ)
15	14	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -𝐶, -𝐶, 0) ∈ ℂ)
16		itgmulc2nc.5	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)
17	16	recnd 11264	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
18	10, 15, 17	subdird 11693	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) · 𝐵) = ((if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) − (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)))
19	5, 18	eqtr3d 2769	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 · 𝐵) = ((if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) − (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)))
20	19	itgeq2dv 25698	. 2 ⊢ (𝜑 → ∫𝐴(𝐶 · 𝐵) d𝑥 = ∫𝐴((if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) − (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)) d𝑥)
21		ovexd 7449	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) ∈ V)
22		itgmulc2nc.3	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)
23		itgmulc2nc.m	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn)
24		ovexd 7449	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 · 𝐵) ∈ V)
25	23, 24	mbfdm2 25553	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ dom vol)
26	8	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℝ)
27		fconstmpt 5734	. . . . . . 7 ⊢ (𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐶, 𝐶, 0))
28	27	a1i 11	. . . . . 6 ⊢ (𝜑 → (𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐶, 𝐶, 0)))
29		eqidd 2728	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵))
30	25, 26, 16, 28, 29	offval2 7699	. . . . 5 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) ∘_f · (𝑥 ∈ 𝐴 ↦ 𝐵)) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · 𝐵)))
31		iblmbf 25684	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
32	22, 31	syl 17	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
33	17	fmpttd 7119	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ)
34	32, 8, 33	mbfmulc2re 25564	. . . . 5 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) ∘_f · (𝑥 ∈ 𝐴 ↦ 𝐵)) ∈ MblFn)
35	30, 34	eqeltrrd 2829	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · 𝐵)) ∈ MblFn)
36	9, 16, 22, 35	iblmulc2nc 37093	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · 𝐵)) ∈ 𝐿¹)
37		ovexd 7449	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵) ∈ V)
38	13	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -𝐶, -𝐶, 0) ∈ ℝ)
39		fconstmpt 5734	. . . . . . 7 ⊢ (𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐶, -𝐶, 0))
40	39	a1i 11	. . . . . 6 ⊢ (𝜑 → (𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐶, -𝐶, 0)))
41	25, 38, 16, 40, 29	offval2 7699	. . . . 5 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) ∘_f · (𝑥 ∈ 𝐴 ↦ 𝐵)) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)))
42	32, 13, 33	mbfmulc2re 25564	. . . . 5 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) ∘_f · (𝑥 ∈ 𝐴 ↦ 𝐵)) ∈ MblFn)
43	41, 42	eqeltrrd 2829	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)) ∈ MblFn)
44	14, 16, 22, 43	iblmulc2nc 37093	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)) ∈ 𝐿¹)
45	19	mpteq2dva 5242	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) = (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) − (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵))))
46	45, 23	eqeltrrd 2829	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) − (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵))) ∈ MblFn)
47	21, 36, 37, 44, 46	itgsubnc 37090	. 2 ⊢ (𝜑 → ∫𝐴((if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) − (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)) d𝑥 = (∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) d𝑥 − ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · 𝐵) d𝑥))
48		ovexd 7449	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) ∈ V)
49		ifcl 4569	. . . . . . . 8 ⊢ ((𝐵 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ 𝐵, 𝐵, 0) ∈ ℝ)
50	16, 6, 49	sylancl 585	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ 𝐵, 𝐵, 0) ∈ ℝ)
51	16	iblre 25710	. . . . . . . . 9 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ 𝐿¹)))
52	22, 51	mpbid 231	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ 𝐿¹))
53	52	simpld 494	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ 𝐿¹)
54		eqidd 2728	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)))
55	25, 26, 50, 28, 54	offval2 7699	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) ∘_f · (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0))) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0))))
56	16, 32	mbfpos 25567	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn)
57	50	recnd 11264	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ 𝐵, 𝐵, 0) ∈ ℂ)
58	57	fmpttd 7119	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)):𝐴⟶ℂ)
59	56, 8, 58	mbfmulc2re 25564	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) ∘_f · (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0))) ∈ MblFn)
60	55, 59	eqeltrrd 2829	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0))) ∈ MblFn)
61	9, 50, 53, 60	iblmulc2nc 37093	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0))) ∈ 𝐿¹)
62		ovexd 7449	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) ∈ V)
63	16	renegcld 11663	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐵 ∈ ℝ)
64		ifcl 4569	. . . . . . . 8 ⊢ ((-𝐵 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ -𝐵, -𝐵, 0) ∈ ℝ)
65	63, 6, 64	sylancl 585	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -𝐵, -𝐵, 0) ∈ ℝ)
66	52	simprd 495	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ 𝐿¹)
67		eqidd 2728	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)))
68	25, 26, 65, 28, 67	offval2 7699	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) ∘_f · (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0))) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))))
69	16, 32	mbfneg 25566	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ -𝐵) ∈ MblFn)
70	63, 69	mbfpos 25567	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)
71	65	recnd 11264	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -𝐵, -𝐵, 0) ∈ ℂ)
72	71	fmpttd 7119	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)):𝐴⟶ℂ)
73	70, 8, 72	mbfmulc2re 25564	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) ∘_f · (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0))) ∈ MblFn)
74	68, 73	eqeltrrd 2829	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))) ∈ MblFn)
75	9, 65, 66, 74	iblmulc2nc 37093	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))) ∈ 𝐿¹)
76		max0sub 13199	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ ℝ → (if(0 ≤ 𝐵, 𝐵, 0) − if(0 ≤ -𝐵, -𝐵, 0)) = 𝐵)
77	16, 76	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐵, 𝐵, 0) − if(0 ≤ -𝐵, -𝐵, 0)) = 𝐵)
78	77	oveq2d 7430	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐶, 𝐶, 0) · (if(0 ≤ 𝐵, 𝐵, 0) − if(0 ≤ -𝐵, -𝐵, 0))) = (if(0 ≤ 𝐶, 𝐶, 0) · 𝐵))
79	10, 57, 71	subdid 11692	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐶, 𝐶, 0) · (if(0 ≤ 𝐵, 𝐵, 0) − if(0 ≤ -𝐵, -𝐵, 0))) = ((if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))))
80	78, 79	eqtr3d 2769	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) = ((if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))))
81	80	mpteq2dva 5242	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · 𝐵)) = (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)))))
82	30, 81	eqtrd 2767	. . . . . . 7 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) ∘_f · (𝑥 ∈ 𝐴 ↦ 𝐵)) = (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)))))
83	82, 34	eqeltrrd 2829	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)))) ∈ MblFn)
84	48, 61, 62, 75, 83	itgsubnc 37090	. . . . 5 ⊢ (𝜑 → ∫𝐴((if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))) d𝑥 = (∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) d𝑥 − ∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) d𝑥))
85	80	itgeq2dv 25698	. . . . 5 ⊢ (𝜑 → ∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) d𝑥 = ∫𝐴((if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))) d𝑥)
86	16, 22	itgreval 25713	. . . . . . 7 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 = (∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥))
87	86	oveq2d 7430	. . . . . 6 ⊢ (𝜑 → (if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴𝐵 d𝑥) = (if(0 ≤ 𝐶, 𝐶, 0) · (∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥)))
88	50, 53	itgcl 25700	. . . . . . 7 ⊢ (𝜑 → ∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 ∈ ℂ)
89	65, 66	itgcl 25700	. . . . . . 7 ⊢ (𝜑 → ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥 ∈ ℂ)
90	9, 88, 89	subdid 11692	. . . . . 6 ⊢ (𝜑 → (if(0 ≤ 𝐶, 𝐶, 0) · (∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥)) = ((if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥) − (if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥)))
91		max1 13188	. . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 0 ≤ if(0 ≤ 𝐶, 𝐶, 0))
92	6, 1, 91	sylancr 586	. . . . . . . 8 ⊢ (𝜑 → 0 ≤ if(0 ≤ 𝐶, 𝐶, 0))
93		max1 13188	. . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 0 ≤ if(0 ≤ 𝐵, 𝐵, 0))
94	6, 16, 93	sylancr 586	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ 𝐵, 𝐵, 0))
95	9, 50, 53, 60, 8, 50, 92, 94	itgmulc2nclem1 37094	. . . . . . 7 ⊢ (𝜑 → (if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥) = ∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) d𝑥)
96		max1 13188	. . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ -𝐵 ∈ ℝ) → 0 ≤ if(0 ≤ -𝐵, -𝐵, 0))
97	6, 63, 96	sylancr 586	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ -𝐵, -𝐵, 0))
98	9, 65, 66, 74, 8, 65, 92, 97	itgmulc2nclem1 37094	. . . . . . 7 ⊢ (𝜑 → (if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥) = ∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) d𝑥)
99	95, 98	oveq12d 7432	. . . . . 6 ⊢ (𝜑 → ((if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥) − (if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥)) = (∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) d𝑥 − ∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) d𝑥))
100	87, 90, 99	3eqtrd 2771	. . . . 5 ⊢ (𝜑 → (if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴𝐵 d𝑥) = (∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) d𝑥 − ∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) d𝑥))
101	84, 85, 100	3eqtr4d 2777	. . . 4 ⊢ (𝜑 → ∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) d𝑥 = (if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴𝐵 d𝑥))
102		ovexd 7449	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) ∈ V)
103	25, 38, 50, 40, 54	offval2 7699	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) ∘_f · (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0))) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0))))
104	56, 13, 58	mbfmulc2re 25564	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) ∘_f · (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0))) ∈ MblFn)
105	103, 104	eqeltrrd 2829	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0))) ∈ MblFn)
106	14, 50, 53, 105	iblmulc2nc 37093	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0))) ∈ 𝐿¹)
107		ovexd 7449	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) ∈ V)
108	25, 38, 65, 40, 67	offval2 7699	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) ∘_f · (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0))) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))))
109	70, 13, 72	mbfmulc2re 25564	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) ∘_f · (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0))) ∈ MblFn)
110	108, 109	eqeltrrd 2829	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))) ∈ MblFn)
111	14, 65, 66, 110	iblmulc2nc 37093	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))) ∈ 𝐿¹)
112	77	oveq2d 7430	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -𝐶, -𝐶, 0) · (if(0 ≤ 𝐵, 𝐵, 0) − if(0 ≤ -𝐵, -𝐵, 0))) = (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵))
113	15, 57, 71	subdid 11692	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -𝐶, -𝐶, 0) · (if(0 ≤ 𝐵, 𝐵, 0) − if(0 ≤ -𝐵, -𝐵, 0))) = ((if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))))
114	112, 113	eqtr3d 2769	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵) = ((if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))))
115	114	mpteq2dva 5242	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)) = (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)))))
116	41, 115	eqtrd 2767	. . . . . . 7 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) ∘_f · (𝑥 ∈ 𝐴 ↦ 𝐵)) = (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)))))
117	116, 42	eqeltrrd 2829	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)))) ∈ MblFn)
118	102, 106, 107, 111, 117	itgsubnc 37090	. . . . 5 ⊢ (𝜑 → ∫𝐴((if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))) d𝑥 = (∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) d𝑥 − ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) d𝑥))
119	114	itgeq2dv 25698	. . . . 5 ⊢ (𝜑 → ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · 𝐵) d𝑥 = ∫𝐴((if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))) d𝑥)
120	86	oveq2d 7430	. . . . . 6 ⊢ (𝜑 → (if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴𝐵 d𝑥) = (if(0 ≤ -𝐶, -𝐶, 0) · (∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥)))
121	14, 88, 89	subdid 11692	. . . . . 6 ⊢ (𝜑 → (if(0 ≤ -𝐶, -𝐶, 0) · (∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥)) = ((if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥) − (if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥)))
122		max1 13188	. . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ -𝐶 ∈ ℝ) → 0 ≤ if(0 ≤ -𝐶, -𝐶, 0))
123	6, 11, 122	sylancr 586	. . . . . . . 8 ⊢ (𝜑 → 0 ≤ if(0 ≤ -𝐶, -𝐶, 0))
124	14, 50, 53, 105, 13, 50, 123, 94	itgmulc2nclem1 37094	. . . . . . 7 ⊢ (𝜑 → (if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥) = ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) d𝑥)
125	14, 65, 66, 110, 13, 65, 123, 97	itgmulc2nclem1 37094	. . . . . . 7 ⊢ (𝜑 → (if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥) = ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) d𝑥)
126	124, 125	oveq12d 7432	. . . . . 6 ⊢ (𝜑 → ((if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥) − (if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥)) = (∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) d𝑥 − ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) d𝑥))
127	120, 121, 126	3eqtrd 2771	. . . . 5 ⊢ (𝜑 → (if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴𝐵 d𝑥) = (∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) d𝑥 − ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) d𝑥))
128	118, 119, 127	3eqtr4d 2777	. . . 4 ⊢ (𝜑 → ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · 𝐵) d𝑥 = (if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴𝐵 d𝑥))
129	101, 128	oveq12d 7432	. . 3 ⊢ (𝜑 → (∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) d𝑥 − ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · 𝐵) d𝑥) = ((if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴𝐵 d𝑥) − (if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴𝐵 d𝑥)))
130	16, 22	itgcl 25700	. . . 4 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 ∈ ℂ)
131	9, 14, 130	subdird 11693	. . 3 ⊢ (𝜑 → ((if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) · ∫𝐴𝐵 d𝑥) = ((if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴𝐵 d𝑥) − (if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴𝐵 d𝑥)))
132	3	oveq1d 7429	. . 3 ⊢ (𝜑 → ((if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) · ∫𝐴𝐵 d𝑥) = (𝐶 · ∫𝐴𝐵 d𝑥))
133	129, 131, 132	3eqtr2d 2773	. 2 ⊢ (𝜑 → (∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) d𝑥 − ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · 𝐵) d𝑥) = (𝐶 · ∫𝐴𝐵 d𝑥))
134	20, 47, 133	3eqtrrd 2772	1 ⊢ (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = ∫𝐴(𝐶 · 𝐵) d𝑥)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1534 ∈ wcel 2099 Vcvv 3469 ifcif 4524 {csn 4624 class class class wbr 5142 ↦ cmpt 5225 × cxp 5670 dom cdm 5672 (class class class)co 7414 ∘_f cof 7677 ℂcc 11128 ℝcr 11129 0cc0 11130 · cmul 11135 ≤ cle 11271 − cmin 11466 -cneg 11467 volcvol 25379 MblFncmbf 25530 𝐿¹cibl 25533 ∫citg 25534

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7734 ax-inf2 9656 ax-cnex 11186 ax-resscn 11187 ax-1cn 11188 ax-icn 11189 ax-addcl 11190 ax-addrcl 11191 ax-mulcl 11192 ax-mulrcl 11193 ax-mulcom 11194 ax-addass 11195 ax-mulass 11196 ax-distr 11197 ax-i2m1 11198 ax-1ne0 11199 ax-1rid 11200 ax-rnegex 11201 ax-rrecex 11202 ax-cnre 11203 ax-pre-lttri 11204 ax-pre-lttrn 11205 ax-pre-ltadd 11206 ax-pre-mulgt0 11207 ax-pre-sup 11208 ax-addf 11209

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-int 4945 df-iun 4993 df-disj 5108 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-se 5628 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-isom 6551 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-of 7679 df-ofr 7680 df-om 7865 df-1st 7987 df-2nd 7988 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-2o 8481 df-er 8718 df-map 8838 df-pm 8839 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-fi 9426 df-sup 9457 df-inf 9458 df-oi 9525 df-dju 9916 df-card 9954 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11468 df-neg 11469 df-div 11894 df-nn 12235 df-2 12297 df-3 12298 df-4 12299 df-n0 12495 df-z 12581 df-uz 12845 df-q 12955 df-rp 12999 df-xneg 13116 df-xadd 13117 df-xmul 13118 df-ioo 13352 df-ico 13354 df-icc 13355 df-fz 13509 df-fzo 13652 df-fl 13781 df-mod 13859 df-seq 13991 df-exp 14051 df-hash 14314 df-cj 15070 df-re 15071 df-im 15072 df-sqrt 15206 df-abs 15207 df-clim 15456 df-sum 15657 df-rest 17395 df-topgen 17416 df-psmet 21258 df-xmet 21259 df-met 21260 df-bl 21261 df-mopn 21262 df-top 22783 df-topon 22800 df-bases 22836 df-cmp 23278 df-ovol 25380 df-vol 25381 df-mbf 25535 df-itg1 25536 df-itg2 25537 df-ibl 25538 df-itg 25539 df-0p 25586

This theorem is referenced by: itgmulc2nc 37096

W3C validator