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 34013

Description: Lemma for itgmulc2nc 34014; cf. itgmulc2lem2 23998. (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 12315	. . . . . . 7 ⊢ (𝐶 ∈ ℝ → (if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) = 𝐶)
3	1, 2	syl 17	. . . . . 6 ⊢ (𝜑 → (if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) = 𝐶)
4	3	oveq1d 6920	. . . . 5 ⊢ (𝜑 → ((if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) · 𝐵) = (𝐶 · 𝐵))
5	4	adantr 474	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) · 𝐵) = (𝐶 · 𝐵))
6		0re 10358	. . . . . . . 8 ⊢ 0 ∈ ℝ
7		ifcl 4350	. . . . . . . 8 ⊢ ((𝐶 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℝ)
8	1, 6, 7	sylancl 580	. . . . . . 7 ⊢ (𝜑 → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℝ)
9	8	recnd 10385	. . . . . 6 ⊢ (𝜑 → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℂ)
10	9	adantr 474	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℂ)
11	1	renegcld 10781	. . . . . . . 8 ⊢ (𝜑 → -𝐶 ∈ ℝ)
12		ifcl 4350	. . . . . . . 8 ⊢ ((-𝐶 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ -𝐶, -𝐶, 0) ∈ ℝ)
13	11, 6, 12	sylancl 580	. . . . . . 7 ⊢ (𝜑 → if(0 ≤ -𝐶, -𝐶, 0) ∈ ℝ)
14	13	recnd 10385	. . . . . 6 ⊢ (𝜑 → if(0 ≤ -𝐶, -𝐶, 0) ∈ ℂ)
15	14	adantr 474	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -𝐶, -𝐶, 0) ∈ ℂ)
16		itgmulc2nc.5	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)
17	16	recnd 10385	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
18	10, 15, 17	subdird 10811	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) · 𝐵) = ((if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) − (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)))
19	5, 18	eqtr3d 2863	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 · 𝐵) = ((if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) − (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)))
20	19	itgeq2dv 23947	. 2 ⊢ (𝜑 → ∫𝐴(𝐶 · 𝐵) d𝑥 = ∫𝐴((if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) − (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)) d𝑥)
21		ovexd 6939	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) ∈ V)
22		itgmulc2nc.3	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)
23		itgmulc2nc.m	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn)
24		ovexd 6939	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 · 𝐵) ∈ V)
25	23, 24	mbfdm2 23803	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ dom vol)
26	8	adantr 474	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℝ)
27		fconstmpt 5398	. . . . . . 7 ⊢ (𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐶, 𝐶, 0))
28	27	a1i 11	. . . . . 6 ⊢ (𝜑 → (𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐶, 𝐶, 0)))
29		eqidd 2826	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵))
30	25, 26, 16, 28, 29	offval2 7174	. . . . 5 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) ∘_𝑓 · (𝑥 ∈ 𝐴 ↦ 𝐵)) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · 𝐵)))
31		iblmbf 23933	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
32	22, 31	syl 17	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
33	17	fmpttd 6634	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ)
34	32, 8, 33	mbfmulc2re 23814	. . . . 5 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) ∘_𝑓 · (𝑥 ∈ 𝐴 ↦ 𝐵)) ∈ MblFn)
35	30, 34	eqeltrrd 2907	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · 𝐵)) ∈ MblFn)
36	9, 16, 22, 35	iblmulc2nc 34011	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · 𝐵)) ∈ 𝐿¹)
37		ovexd 6939	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵) ∈ V)
38	13	adantr 474	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -𝐶, -𝐶, 0) ∈ ℝ)
39		fconstmpt 5398	. . . . . . 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 7174	. . . . 5 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) ∘_𝑓 · (𝑥 ∈ 𝐴 ↦ 𝐵)) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)))
42	32, 13, 33	mbfmulc2re 23814	. . . . 5 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) ∘_𝑓 · (𝑥 ∈ 𝐴 ↦ 𝐵)) ∈ MblFn)
43	41, 42	eqeltrrd 2907	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)) ∈ MblFn)
44	14, 16, 22, 43	iblmulc2nc 34011	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)) ∈ 𝐿¹)
45	19	mpteq2dva 4967	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) = (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) − (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵))))
46	45, 23	eqeltrrd 2907	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) − (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵))) ∈ MblFn)
47	21, 36, 37, 44, 46	itgsubnc 34008	. 2 ⊢ (𝜑 → ∫𝐴((if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) − (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)) d𝑥 = (∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) d𝑥 − ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · 𝐵) d𝑥))
48		ovexd 6939	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) ∈ V)
49		ifcl 4350	. . . . . . . 8 ⊢ ((𝐵 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ 𝐵, 𝐵, 0) ∈ ℝ)
50	16, 6, 49	sylancl 580	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ 𝐵, 𝐵, 0) ∈ ℝ)
51	16	iblre 23959	. . . . . . . . 9 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ 𝐿¹)))
52	22, 51	mpbid 224	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ 𝐿¹))
53	52	simpld 490	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ 𝐿¹)
54		eqidd 2826	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)))
55	25, 26, 50, 28, 54	offval2 7174	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) ∘_𝑓 · (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0))) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0))))
56	16, 32	mbfpos 23817	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn)
57	50	recnd 10385	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ 𝐵, 𝐵, 0) ∈ ℂ)
58	57	fmpttd 6634	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)):𝐴⟶ℂ)
59	56, 8, 58	mbfmulc2re 23814	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) ∘_𝑓 · (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0))) ∈ MblFn)
60	55, 59	eqeltrrd 2907	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0))) ∈ MblFn)
61	9, 50, 53, 60	iblmulc2nc 34011	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0))) ∈ 𝐿¹)
62		ovexd 6939	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) ∈ V)
63	16	renegcld 10781	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐵 ∈ ℝ)
64		ifcl 4350	. . . . . . . 8 ⊢ ((-𝐵 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ -𝐵, -𝐵, 0) ∈ ℝ)
65	63, 6, 64	sylancl 580	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -𝐵, -𝐵, 0) ∈ ℝ)
66	52	simprd 491	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ 𝐿¹)
67		eqidd 2826	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)))
68	25, 26, 65, 28, 67	offval2 7174	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) ∘_𝑓 · (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0))) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))))
69	16, 32	mbfneg 23816	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ -𝐵) ∈ MblFn)
70	63, 69	mbfpos 23817	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)
71	65	recnd 10385	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -𝐵, -𝐵, 0) ∈ ℂ)
72	71	fmpttd 6634	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)):𝐴⟶ℂ)
73	70, 8, 72	mbfmulc2re 23814	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) ∘_𝑓 · (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0))) ∈ MblFn)
74	68, 73	eqeltrrd 2907	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))) ∈ MblFn)
75	9, 65, 66, 74	iblmulc2nc 34011	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))) ∈ 𝐿¹)
76		max0sub 12315	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ ℝ → (if(0 ≤ 𝐵, 𝐵, 0) − if(0 ≤ -𝐵, -𝐵, 0)) = 𝐵)
77	16, 76	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐵, 𝐵, 0) − if(0 ≤ -𝐵, -𝐵, 0)) = 𝐵)
78	77	oveq2d 6921	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐶, 𝐶, 0) · (if(0 ≤ 𝐵, 𝐵, 0) − if(0 ≤ -𝐵, -𝐵, 0))) = (if(0 ≤ 𝐶, 𝐶, 0) · 𝐵))
79	10, 57, 71	subdid 10810	. . . . . . . . . 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 2863	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) = ((if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))))
81	80	mpteq2dva 4967	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐶, 𝐶, 0) · 𝐵)) = (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)))))
82	30, 81	eqtrd 2861	. . . . . . 7 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ 𝐶, 𝐶, 0)}) ∘_𝑓 · (𝑥 ∈ 𝐴 ↦ 𝐵)) = (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)))))
83	82, 34	eqeltrrd 2907	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)))) ∈ MblFn)
84	48, 61, 62, 75, 83	itgsubnc 34008	. . . . 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 23947	. . . . 5 ⊢ (𝜑 → ∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) d𝑥 = ∫𝐴((if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))) d𝑥)
86	16, 22	itgreval 23962	. . . . . . 7 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 = (∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥))
87	86	oveq2d 6921	. . . . . 6 ⊢ (𝜑 → (if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴𝐵 d𝑥) = (if(0 ≤ 𝐶, 𝐶, 0) · (∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥)))
88	50, 53	itgcl 23949	. . . . . . 7 ⊢ (𝜑 → ∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 ∈ ℂ)
89	65, 66	itgcl 23949	. . . . . . 7 ⊢ (𝜑 → ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥 ∈ ℂ)
90	9, 88, 89	subdid 10810	. . . . . 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 12304	. . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 0 ≤ if(0 ≤ 𝐶, 𝐶, 0))
92	6, 1, 91	sylancr 581	. . . . . . . 8 ⊢ (𝜑 → 0 ≤ if(0 ≤ 𝐶, 𝐶, 0))
93		max1 12304	. . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 0 ≤ if(0 ≤ 𝐵, 𝐵, 0))
94	6, 16, 93	sylancr 581	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ 𝐵, 𝐵, 0))
95	9, 50, 53, 60, 8, 50, 92, 94	itgmulc2nclem1 34012	. . . . . . 7 ⊢ (𝜑 → (if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥) = ∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) d𝑥)
96		max1 12304	. . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ -𝐵 ∈ ℝ) → 0 ≤ if(0 ≤ -𝐵, -𝐵, 0))
97	6, 63, 96	sylancr 581	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ -𝐵, -𝐵, 0))
98	9, 65, 66, 74, 8, 65, 92, 97	itgmulc2nclem1 34012	. . . . . . 7 ⊢ (𝜑 → (if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥) = ∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) d𝑥)
99	95, 98	oveq12d 6923	. . . . . 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 2865	. . . . 5 ⊢ (𝜑 → (if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴𝐵 d𝑥) = (∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) d𝑥 − ∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) d𝑥))
101	84, 85, 100	3eqtr4d 2871	. . . 4 ⊢ (𝜑 → ∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) d𝑥 = (if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴𝐵 d𝑥))
102		ovexd 6939	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) ∈ V)
103	25, 38, 50, 40, 54	offval2 7174	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) ∘_𝑓 · (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0))) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0))))
104	56, 13, 58	mbfmulc2re 23814	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) ∘_𝑓 · (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0))) ∈ MblFn)
105	103, 104	eqeltrrd 2907	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0))) ∈ MblFn)
106	14, 50, 53, 105	iblmulc2nc 34011	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0))) ∈ 𝐿¹)
107		ovexd 6939	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) ∈ V)
108	25, 38, 65, 40, 67	offval2 7174	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) ∘_𝑓 · (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0))) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))))
109	70, 13, 72	mbfmulc2re 23814	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) ∘_𝑓 · (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0))) ∈ MblFn)
110	108, 109	eqeltrrd 2907	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))) ∈ MblFn)
111	14, 65, 66, 110	iblmulc2nc 34011	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))) ∈ 𝐿¹)
112	77	oveq2d 6921	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -𝐶, -𝐶, 0) · (if(0 ≤ 𝐵, 𝐵, 0) − if(0 ≤ -𝐵, -𝐵, 0))) = (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵))
113	15, 57, 71	subdid 10810	. . . . . . . . . 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 2863	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵) = ((if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))))
115	114	mpteq2dva 4967	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐶, -𝐶, 0) · 𝐵)) = (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)))))
116	41, 115	eqtrd 2861	. . . . . . 7 ⊢ (𝜑 → ((𝐴 × {if(0 ≤ -𝐶, -𝐶, 0)}) ∘_𝑓 · (𝑥 ∈ 𝐴 ↦ 𝐵)) = (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)))))
117	116, 42	eqeltrrd 2907	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)))) ∈ MblFn)
118	102, 106, 107, 111, 117	itgsubnc 34008	. . . . 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 23947	. . . . 5 ⊢ (𝜑 → ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · 𝐵) d𝑥 = ∫𝐴((if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) − (if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0))) d𝑥)
120	86	oveq2d 6921	. . . . . 6 ⊢ (𝜑 → (if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴𝐵 d𝑥) = (if(0 ≤ -𝐶, -𝐶, 0) · (∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥)))
121	14, 88, 89	subdid 10810	. . . . . 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 12304	. . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ -𝐶 ∈ ℝ) → 0 ≤ if(0 ≤ -𝐶, -𝐶, 0))
123	6, 11, 122	sylancr 581	. . . . . . . 8 ⊢ (𝜑 → 0 ≤ if(0 ≤ -𝐶, -𝐶, 0))
124	14, 50, 53, 105, 13, 50, 123, 94	itgmulc2nclem1 34012	. . . . . . 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 34012	. . . . . . 7 ⊢ (𝜑 → (if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥) = ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) d𝑥)
126	124, 125	oveq12d 6923	. . . . . 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 2865	. . . . 5 ⊢ (𝜑 → (if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴𝐵 d𝑥) = (∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ 𝐵, 𝐵, 0)) d𝑥 − ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · if(0 ≤ -𝐵, -𝐵, 0)) d𝑥))
128	118, 119, 127	3eqtr4d 2871	. . . 4 ⊢ (𝜑 → ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · 𝐵) d𝑥 = (if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴𝐵 d𝑥))
129	101, 128	oveq12d 6923	. . 3 ⊢ (𝜑 → (∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) d𝑥 − ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · 𝐵) d𝑥) = ((if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴𝐵 d𝑥) − (if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴𝐵 d𝑥)))
130	16, 22	itgcl 23949	. . . 4 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 ∈ ℂ)
131	9, 14, 130	subdird 10811	. . 3 ⊢ (𝜑 → ((if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) · ∫𝐴𝐵 d𝑥) = ((if(0 ≤ 𝐶, 𝐶, 0) · ∫𝐴𝐵 d𝑥) − (if(0 ≤ -𝐶, -𝐶, 0) · ∫𝐴𝐵 d𝑥)))
132	3	oveq1d 6920	. . 3 ⊢ (𝜑 → ((if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) · ∫𝐴𝐵 d𝑥) = (𝐶 · ∫𝐴𝐵 d𝑥))
133	129, 131, 132	3eqtr2d 2867	. 2 ⊢ (𝜑 → (∫𝐴(if(0 ≤ 𝐶, 𝐶, 0) · 𝐵) d𝑥 − ∫𝐴(if(0 ≤ -𝐶, -𝐶, 0) · 𝐵) d𝑥) = (𝐶 · ∫𝐴𝐵 d𝑥))
134	20, 47, 133	3eqtrrd 2866	1 ⊢ (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = ∫𝐴(𝐶 · 𝐵) d𝑥)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 386 = wceq 1656 ∈ wcel 2164 Vcvv 3414 ifcif 4306 {csn 4397 class class class wbr 4873 ↦ cmpt 4952 × cxp 5340 dom cdm 5342 (class class class)co 6905 ∘_𝑓 cof 7155 ℂcc 10250 ℝcr 10251 0cc0 10252 · cmul 10257 ≤ cle 10392 − cmin 10585 -cneg 10586 volcvol 23629 MblFncmbf 23780 𝐿¹cibl 23783 ∫citg 23784

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1894 ax-4 1908 ax-5 2009 ax-6 2075 ax-7 2112 ax-8 2166 ax-9 2173 ax-10 2192 ax-11 2207 ax-12 2220 ax-13 2389 ax-ext 2803 ax-rep 4994 ax-sep 5005 ax-nul 5013 ax-pow 5065 ax-pr 5127 ax-un 7209 ax-inf2 8815 ax-cnex 10308 ax-resscn 10309 ax-1cn 10310 ax-icn 10311 ax-addcl 10312 ax-addrcl 10313 ax-mulcl 10314 ax-mulrcl 10315 ax-mulcom 10316 ax-addass 10317 ax-mulass 10318 ax-distr 10319 ax-i2m1 10320 ax-1ne0 10321 ax-1rid 10322 ax-rnegex 10323 ax-rrecex 10324 ax-cnre 10325 ax-pre-lttri 10326 ax-pre-lttrn 10327 ax-pre-ltadd 10328 ax-pre-mulgt0 10329 ax-pre-sup 10330 ax-addf 10331

This theorem depends on definitions: df-bi 199 df-an 387 df-or 879 df-3or 1112 df-3an 1113 df-tru 1660 df-fal 1670 df-ex 1879 df-nf 1883 df-sb 2068 df-mo 2605 df-eu 2640 df-clab 2812 df-cleq 2818 df-clel 2821 df-nfc 2958 df-ne 3000 df-nel 3103 df-ral 3122 df-rex 3123 df-reu 3124 df-rmo 3125 df-rab 3126 df-v 3416 df-sbc 3663 df-csb 3758 df-dif 3801 df-un 3803 df-in 3805 df-ss 3812 df-pss 3814 df-nul 4145 df-if 4307 df-pw 4380 df-sn 4398 df-pr 4400 df-tp 4402 df-op 4404 df-uni 4659 df-int 4698 df-iun 4742 df-disj 4842 df-br 4874 df-opab 4936 df-mpt 4953 df-tr 4976 df-id 5250 df-eprel 5255 df-po 5263 df-so 5264 df-fr 5301 df-se 5302 df-we 5303 df-xp 5348 df-rel 5349 df-cnv 5350 df-co 5351 df-dm 5352 df-rn 5353 df-res 5354 df-ima 5355 df-pred 5920 df-ord 5966 df-on 5967 df-lim 5968 df-suc 5969 df-iota 6086 df-fun 6125 df-fn 6126 df-f 6127 df-f1 6128 df-fo 6129 df-f1o 6130 df-fv 6131 df-isom 6132 df-riota 6866 df-ov 6908 df-oprab 6909 df-mpt2 6910 df-of 7157 df-ofr 7158 df-om 7327 df-1st 7428 df-2nd 7429 df-wrecs 7672 df-recs 7734 df-rdg 7772 df-1o 7826 df-2o 7827 df-oadd 7830 df-er 8009 df-map 8124 df-pm 8125 df-en 8223 df-dom 8224 df-sdom 8225 df-fin 8226 df-fi 8586 df-sup 8617 df-inf 8618 df-oi 8684 df-card 9078 df-cda 9305 df-pnf 10393 df-mnf 10394 df-xr 10395 df-ltxr 10396 df-le 10397 df-sub 10587 df-neg 10588 df-div 11010 df-nn 11351 df-2 11414 df-3 11415 df-4 11416 df-n0 11619 df-z 11705 df-uz 11969 df-q 12072 df-rp 12113 df-xneg 12232 df-xadd 12233 df-xmul 12234 df-ioo 12467 df-ico 12469 df-icc 12470 df-fz 12620 df-fzo 12761 df-fl 12888 df-mod 12964 df-seq 13096 df-exp 13155 df-hash 13411 df-cj 14216 df-re 14217 df-im 14218 df-sqrt 14352 df-abs 14353 df-clim 14596 df-sum 14794 df-rest 16436 df-topgen 16457 df-psmet 20098 df-xmet 20099 df-met 20100 df-bl 20101 df-mopn 20102 df-top 21069 df-topon 21086 df-bases 21121 df-cmp 21561 df-ovol 23630 df-vol 23631 df-mbf 23785 df-itg1 23786 df-itg2 23787 df-ibl 23788 df-itg 23789 df-0p 23836

This theorem is referenced by: itgmulc2nc 34014

W3C validator