itgaddnclem2 - Mathbox for Brendan Leahy

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

Theorem itgaddnclem2 35116

Description: Lemma for itgaddnc 35117; cf. itgaddlem2 24427. (Contributed by Brendan Leahy, 10-Nov-2017.) (Revised by Brendan Leahy, 3-Apr-2018.)

**Hypotheses**
Ref	Expression
ibladdnc.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
ibladdnc.2	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)
ibladdnc.3	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑉)
ibladdnc.4	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹)
ibladdnc.m	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn)
itgaddnclem.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)
itgaddnclem.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ)

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

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

**Proof of Theorem itgaddnclem2**
Step	Hyp	Ref	Expression
1		itgaddnclem.1	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)
2		max0sub 12577	. . . . . . . . . 10 ⊢ (𝐵 ∈ ℝ → (if(0 ≤ 𝐵, 𝐵, 0) − if(0 ≤ -𝐵, -𝐵, 0)) = 𝐵)
3	1, 2	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐵, 𝐵, 0) − if(0 ≤ -𝐵, -𝐵, 0)) = 𝐵)
4		itgaddnclem.2	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ)
5		max0sub 12577	. . . . . . . . . 10 ⊢ (𝐶 ∈ ℝ → (if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) = 𝐶)
6	4, 5	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0)) = 𝐶)
7	3, 6	oveq12d 7153	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((if(0 ≤ 𝐵, 𝐵, 0) − if(0 ≤ -𝐵, -𝐵, 0)) + (if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0))) = (𝐵 + 𝐶))
8		0re 10632	. . . . . . . . . . 11 ⊢ 0 ∈ ℝ
9		ifcl 4469	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ 𝐵, 𝐵, 0) ∈ ℝ)
10	1, 8, 9	sylancl 589	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ 𝐵, 𝐵, 0) ∈ ℝ)
11	10	recnd 10658	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ 𝐵, 𝐵, 0) ∈ ℂ)
12		ifcl 4469	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℝ)
13	4, 8, 12	sylancl 589	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℝ)
14	13	recnd 10658	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℂ)
15	1	renegcld 11056	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐵 ∈ ℝ)
16		ifcl 4469	. . . . . . . . . . 11 ⊢ ((-𝐵 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ -𝐵, -𝐵, 0) ∈ ℝ)
17	15, 8, 16	sylancl 589	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -𝐵, -𝐵, 0) ∈ ℝ)
18	17	recnd 10658	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -𝐵, -𝐵, 0) ∈ ℂ)
19	4	renegcld 11056	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐶 ∈ ℝ)
20		ifcl 4469	. . . . . . . . . . 11 ⊢ ((-𝐶 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ -𝐶, -𝐶, 0) ∈ ℝ)
21	19, 8, 20	sylancl 589	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -𝐶, -𝐶, 0) ∈ ℝ)
22	21	recnd 10658	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -𝐶, -𝐶, 0) ∈ ℂ)
23	11, 14, 18, 22	addsub4d 11033	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)) − (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0))) = ((if(0 ≤ 𝐵, 𝐵, 0) − if(0 ≤ -𝐵, -𝐵, 0)) + (if(0 ≤ 𝐶, 𝐶, 0) − if(0 ≤ -𝐶, -𝐶, 0))))
24	1, 4	readdcld 10659	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 + 𝐶) ∈ ℝ)
25		max0sub 12577	. . . . . . . . 9 ⊢ ((𝐵 + 𝐶) ∈ ℝ → (if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) − if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0)) = (𝐵 + 𝐶))
26	24, 25	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) − if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0)) = (𝐵 + 𝐶))
27	7, 23, 26	3eqtr4rd 2844	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) − if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0)) = ((if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)) − (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0))))
28	24	renegcld 11056	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -(𝐵 + 𝐶) ∈ ℝ)
29		ifcl 4469	. . . . . . . . . 10 ⊢ ((-(𝐵 + 𝐶) ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) ∈ ℝ)
30	28, 8, 29	sylancl 589	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) ∈ ℝ)
31	30	recnd 10658	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) ∈ ℂ)
32	10, 13	readdcld 10659	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)) ∈ ℝ)
33	32	recnd 10658	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)) ∈ ℂ)
34		ifcl 4469	. . . . . . . . . 10 ⊢ (((𝐵 + 𝐶) ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) ∈ ℝ)
35	24, 8, 34	sylancl 589	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) ∈ ℝ)
36	35	recnd 10658	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) ∈ ℂ)
37	17, 21	readdcld 10659	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)) ∈ ℝ)
38	37	recnd 10658	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)) ∈ ℂ)
39	31, 33, 36, 38	addsubeq4d 11037	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) + (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0))) = (if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) + (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0))) ↔ (if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) − if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0)) = ((if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)) − (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)))))
40	27, 39	mpbird 260	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) + (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0))) = (if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) + (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0))))
41	40	itgeq2dv 24385	. . . . 5 ⊢ (𝜑 → ∫𝐴(if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) + (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0))) d𝑥 = ∫𝐴(if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) + (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0))) d𝑥)
42		ibladdnc.2	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)
43		ibladdnc.4	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹)
44		ibladdnc.m	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn)
45	1, 42, 4, 43, 44	ibladdnc 35114	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ 𝐿¹)
46	24	iblre 24397	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0)) ∈ 𝐿¹)))
47	45, 46	mpbid 235	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0)) ∈ 𝐿¹))
48	47	simprd 499	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0)) ∈ 𝐿¹)
49	1	iblre 24397	. . . . . . . . 9 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ 𝐿¹)))
50	42, 49	mpbid 235	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ 𝐿¹))
51	50	simpld 498	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ 𝐿¹)
52	4	iblre 24397	. . . . . . . . 9 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐶, 𝐶, 0)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐶, -𝐶, 0)) ∈ 𝐿¹)))
53	43, 52	mpbid 235	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐶, 𝐶, 0)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐶, -𝐶, 0)) ∈ 𝐿¹))
54	53	simpld 498	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐶, 𝐶, 0)) ∈ 𝐿¹)
55		iblmbf 24371	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
56	42, 55	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
57		iblmbf 24371	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ MblFn)
58	43, 57	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ MblFn)
59	56, 1, 58, 4, 44	mbfposadd 35104	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0))) ∈ MblFn)
60	10, 51, 13, 54, 59	ibladdnc 35114	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0))) ∈ 𝐿¹)
61		max1 12566	. . . . . . . . . . . 12 ⊢ ((0 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 0 ≤ if(0 ≤ 𝐵, 𝐵, 0))
62	8, 1, 61	sylancr 590	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ 𝐵, 𝐵, 0))
63		max1 12566	. . . . . . . . . . . 12 ⊢ ((0 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 0 ≤ if(0 ≤ 𝐶, 𝐶, 0))
64	8, 4, 63	sylancr 590	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ 𝐶, 𝐶, 0))
65	10, 13, 62, 64	addge0d 11205	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)))
66	65	iftrued 4433	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)), (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)), 0) = (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)))
67	66	oveq2d 7151	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) + if(0 ≤ (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)), (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)), 0)) = (if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) + (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0))))
68	67	mpteq2dva 5125	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) + if(0 ≤ (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)), (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)), 0))) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) + (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)))))
69	24, 44	mbfneg 24254	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ -(𝐵 + 𝐶)) ∈ MblFn)
70	1	recnd 10658	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
71	4	recnd 10658	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℂ)
72	70, 71	negdid 10999	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -(𝐵 + 𝐶) = (-𝐵 + -𝐶))
73	72	oveq1d 7150	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-(𝐵 + 𝐶) + (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0))) = ((-𝐵 + -𝐶) + (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0))))
74	15	recnd 10658	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐵 ∈ ℂ)
75	19	recnd 10658	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐶 ∈ ℂ)
76	74, 75, 11, 14	add4d 10857	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((-𝐵 + -𝐶) + (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0))) = ((-𝐵 + if(0 ≤ 𝐵, 𝐵, 0)) + (-𝐶 + if(0 ≤ 𝐶, 𝐶, 0))))
77		negeq 10867	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 = 0 → -𝐵 = -0)
78		neg0 10921	. . . . . . . . . . . . . . . 16 ⊢ -0 = 0
79	77, 78	eqtrdi 2849	. . . . . . . . . . . . . . 15 ⊢ (𝐵 = 0 → -𝐵 = 0)
80		0le0 11726	. . . . . . . . . . . . . . . . 17 ⊢ 0 ≤ 0
81	80, 79	breqtrrid 5068	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 = 0 → 0 ≤ -𝐵)
82	81	iftrued 4433	. . . . . . . . . . . . . . 15 ⊢ (𝐵 = 0 → if(0 ≤ -𝐵, -𝐵, 0) = -𝐵)
83		id 22	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐵 = 0 → 𝐵 = 0)
84	80, 83	breqtrrid 5068	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐵 = 0 → 0 ≤ 𝐵)
85	84	iftrued 4433	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 = 0 → if(0 ≤ 𝐵, 𝐵, 0) = 𝐵)
86	85, 83	eqtrd 2833	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 = 0 → if(0 ≤ 𝐵, 𝐵, 0) = 0)
87	79, 86	oveq12d 7153	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 = 0 → (-𝐵 + if(0 ≤ 𝐵, 𝐵, 0)) = (0 + 0))
88		00id 10804	. . . . . . . . . . . . . . . 16 ⊢ (0 + 0) = 0
89	87, 88	eqtrdi 2849	. . . . . . . . . . . . . . 15 ⊢ (𝐵 = 0 → (-𝐵 + if(0 ≤ 𝐵, 𝐵, 0)) = 0)
90	79, 82, 89	3eqtr4rd 2844	. . . . . . . . . . . . . 14 ⊢ (𝐵 = 0 → (-𝐵 + if(0 ≤ 𝐵, 𝐵, 0)) = if(0 ≤ -𝐵, -𝐵, 0))
91	90	adantl 485	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 = 0) → (-𝐵 + if(0 ≤ 𝐵, 𝐵, 0)) = if(0 ≤ -𝐵, -𝐵, 0))
92		ovif2 7231	. . . . . . . . . . . . . 14 ⊢ (-𝐵 + if(0 ≤ 𝐵, 𝐵, 0)) = if(0 ≤ 𝐵, (-𝐵 + 𝐵), (-𝐵 + 0))
93	70	negne0bd 10979	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 ≠ 0 ↔ -𝐵 ≠ 0))
94	93	biimpa 480	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → -𝐵 ≠ 0)
95	1	le0neg2d 11201	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (0 ≤ 𝐵 ↔ -𝐵 ≤ 0))
96		leloe 10716	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((-𝐵 ∈ ℝ ∧ 0 ∈ ℝ) → (-𝐵 ≤ 0 ↔ (-𝐵 < 0 ∨ -𝐵 = 0)))
97	15, 8, 96	sylancl 589	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐵 ≤ 0 ↔ (-𝐵 < 0 ∨ -𝐵 = 0)))
98	95, 97	bitrd 282	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (0 ≤ 𝐵 ↔ (-𝐵 < 0 ∨ -𝐵 = 0)))
99		df-ne 2988	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (-𝐵 ≠ 0 ↔ ¬ -𝐵 = 0)
100		biorf 934	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (¬ -𝐵 = 0 → (-𝐵 < 0 ↔ (-𝐵 = 0 ∨ -𝐵 < 0)))
101	99, 100	sylbi 220	. . . . . . . . . . . . . . . . . . . 20 ⊢ (-𝐵 ≠ 0 → (-𝐵 < 0 ↔ (-𝐵 = 0 ∨ -𝐵 < 0)))
102		orcom 867	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((-𝐵 = 0 ∨ -𝐵 < 0) ↔ (-𝐵 < 0 ∨ -𝐵 = 0))
103	101, 102	syl6rbb 291	. . . . . . . . . . . . . . . . . . 19 ⊢ (-𝐵 ≠ 0 → ((-𝐵 < 0 ∨ -𝐵 = 0) ↔ -𝐵 < 0))
104	98, 103	sylan9bb 513	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ -𝐵 ≠ 0) → (0 ≤ 𝐵 ↔ -𝐵 < 0))
105	94, 104	syldan 594	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → (0 ≤ 𝐵 ↔ -𝐵 < 0))
106		ltnle 10709	. . . . . . . . . . . . . . . . . . 19 ⊢ ((-𝐵 ∈ ℝ ∧ 0 ∈ ℝ) → (-𝐵 < 0 ↔ ¬ 0 ≤ -𝐵))
107	15, 8, 106	sylancl 589	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐵 < 0 ↔ ¬ 0 ≤ -𝐵))
108	107	adantr 484	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → (-𝐵 < 0 ↔ ¬ 0 ≤ -𝐵))
109	105, 108	bitrd 282	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → (0 ≤ 𝐵 ↔ ¬ 0 ≤ -𝐵))
110	74, 70	addcomd 10831	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐵 + 𝐵) = (𝐵 + -𝐵))
111	70	negidd 10976	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 + -𝐵) = 0)
112	110, 111	eqtrd 2833	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐵 + 𝐵) = 0)
113	112	adantr 484	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → (-𝐵 + 𝐵) = 0)
114	74	addid1d 10829	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐵 + 0) = -𝐵)
115	114	adantr 484	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → (-𝐵 + 0) = -𝐵)
116	109, 113, 115	ifbieq12d 4452	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → if(0 ≤ 𝐵, (-𝐵 + 𝐵), (-𝐵 + 0)) = if(¬ 0 ≤ -𝐵, 0, -𝐵))
117		ifnot 4475	. . . . . . . . . . . . . . 15 ⊢ if(¬ 0 ≤ -𝐵, 0, -𝐵) = if(0 ≤ -𝐵, -𝐵, 0)
118	116, 117	eqtrdi 2849	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → if(0 ≤ 𝐵, (-𝐵 + 𝐵), (-𝐵 + 0)) = if(0 ≤ -𝐵, -𝐵, 0))
119	92, 118	syl5eq 2845	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → (-𝐵 + if(0 ≤ 𝐵, 𝐵, 0)) = if(0 ≤ -𝐵, -𝐵, 0))
120	91, 119	pm2.61dane 3074	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐵 + if(0 ≤ 𝐵, 𝐵, 0)) = if(0 ≤ -𝐵, -𝐵, 0))
121		negeq 10867	. . . . . . . . . . . . . . . 16 ⊢ (𝐶 = 0 → -𝐶 = -0)
122	121, 78	eqtrdi 2849	. . . . . . . . . . . . . . 15 ⊢ (𝐶 = 0 → -𝐶 = 0)
123	80, 122	breqtrrid 5068	. . . . . . . . . . . . . . . 16 ⊢ (𝐶 = 0 → 0 ≤ -𝐶)
124	123	iftrued 4433	. . . . . . . . . . . . . . 15 ⊢ (𝐶 = 0 → if(0 ≤ -𝐶, -𝐶, 0) = -𝐶)
125		id 22	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐶 = 0 → 𝐶 = 0)
126	80, 125	breqtrrid 5068	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐶 = 0 → 0 ≤ 𝐶)
127	126	iftrued 4433	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐶 = 0 → if(0 ≤ 𝐶, 𝐶, 0) = 𝐶)
128	127, 125	eqtrd 2833	. . . . . . . . . . . . . . . . 17 ⊢ (𝐶 = 0 → if(0 ≤ 𝐶, 𝐶, 0) = 0)
129	122, 128	oveq12d 7153	. . . . . . . . . . . . . . . 16 ⊢ (𝐶 = 0 → (-𝐶 + if(0 ≤ 𝐶, 𝐶, 0)) = (0 + 0))
130	129, 88	eqtrdi 2849	. . . . . . . . . . . . . . 15 ⊢ (𝐶 = 0 → (-𝐶 + if(0 ≤ 𝐶, 𝐶, 0)) = 0)
131	122, 124, 130	3eqtr4rd 2844	. . . . . . . . . . . . . 14 ⊢ (𝐶 = 0 → (-𝐶 + if(0 ≤ 𝐶, 𝐶, 0)) = if(0 ≤ -𝐶, -𝐶, 0))
132	131	adantl 485	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 = 0) → (-𝐶 + if(0 ≤ 𝐶, 𝐶, 0)) = if(0 ≤ -𝐶, -𝐶, 0))
133		ovif2 7231	. . . . . . . . . . . . . 14 ⊢ (-𝐶 + if(0 ≤ 𝐶, 𝐶, 0)) = if(0 ≤ 𝐶, (-𝐶 + 𝐶), (-𝐶 + 0))
134	71	negne0bd 10979	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 ≠ 0 ↔ -𝐶 ≠ 0))
135	134	biimpa 480	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → -𝐶 ≠ 0)
136	4	le0neg2d 11201	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (0 ≤ 𝐶 ↔ -𝐶 ≤ 0))
137		leloe 10716	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((-𝐶 ∈ ℝ ∧ 0 ∈ ℝ) → (-𝐶 ≤ 0 ↔ (-𝐶 < 0 ∨ -𝐶 = 0)))
138	19, 8, 137	sylancl 589	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐶 ≤ 0 ↔ (-𝐶 < 0 ∨ -𝐶 = 0)))
139	136, 138	bitrd 282	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (0 ≤ 𝐶 ↔ (-𝐶 < 0 ∨ -𝐶 = 0)))
140		df-ne 2988	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (-𝐶 ≠ 0 ↔ ¬ -𝐶 = 0)
141		biorf 934	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (¬ -𝐶 = 0 → (-𝐶 < 0 ↔ (-𝐶 = 0 ∨ -𝐶 < 0)))
142	140, 141	sylbi 220	. . . . . . . . . . . . . . . . . . . 20 ⊢ (-𝐶 ≠ 0 → (-𝐶 < 0 ↔ (-𝐶 = 0 ∨ -𝐶 < 0)))
143		orcom 867	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((-𝐶 = 0 ∨ -𝐶 < 0) ↔ (-𝐶 < 0 ∨ -𝐶 = 0))
144	142, 143	syl6rbb 291	. . . . . . . . . . . . . . . . . . 19 ⊢ (-𝐶 ≠ 0 → ((-𝐶 < 0 ∨ -𝐶 = 0) ↔ -𝐶 < 0))
145	139, 144	sylan9bb 513	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ -𝐶 ≠ 0) → (0 ≤ 𝐶 ↔ -𝐶 < 0))
146	135, 145	syldan 594	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → (0 ≤ 𝐶 ↔ -𝐶 < 0))
147		ltnle 10709	. . . . . . . . . . . . . . . . . . 19 ⊢ ((-𝐶 ∈ ℝ ∧ 0 ∈ ℝ) → (-𝐶 < 0 ↔ ¬ 0 ≤ -𝐶))
148	19, 8, 147	sylancl 589	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐶 < 0 ↔ ¬ 0 ≤ -𝐶))
149	148	adantr 484	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → (-𝐶 < 0 ↔ ¬ 0 ≤ -𝐶))
150	146, 149	bitrd 282	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → (0 ≤ 𝐶 ↔ ¬ 0 ≤ -𝐶))
151	75, 71	addcomd 10831	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐶 + 𝐶) = (𝐶 + -𝐶))
152	71	negidd 10976	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 + -𝐶) = 0)
153	151, 152	eqtrd 2833	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐶 + 𝐶) = 0)
154	153	adantr 484	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → (-𝐶 + 𝐶) = 0)
155	75	addid1d 10829	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐶 + 0) = -𝐶)
156	155	adantr 484	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → (-𝐶 + 0) = -𝐶)
157	150, 154, 156	ifbieq12d 4452	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → if(0 ≤ 𝐶, (-𝐶 + 𝐶), (-𝐶 + 0)) = if(¬ 0 ≤ -𝐶, 0, -𝐶))
158		ifnot 4475	. . . . . . . . . . . . . . 15 ⊢ if(¬ 0 ≤ -𝐶, 0, -𝐶) = if(0 ≤ -𝐶, -𝐶, 0)
159	157, 158	eqtrdi 2849	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → if(0 ≤ 𝐶, (-𝐶 + 𝐶), (-𝐶 + 0)) = if(0 ≤ -𝐶, -𝐶, 0))
160	133, 159	syl5eq 2845	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → (-𝐶 + if(0 ≤ 𝐶, 𝐶, 0)) = if(0 ≤ -𝐶, -𝐶, 0))
161	132, 160	pm2.61dane 3074	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐶 + if(0 ≤ 𝐶, 𝐶, 0)) = if(0 ≤ -𝐶, -𝐶, 0))
162	120, 161	oveq12d 7153	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((-𝐵 + if(0 ≤ 𝐵, 𝐵, 0)) + (-𝐶 + if(0 ≤ 𝐶, 𝐶, 0))) = (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)))
163	73, 76, 162	3eqtrd 2837	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-(𝐵 + 𝐶) + (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0))) = (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)))
164	163	mpteq2dva 5125	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (-(𝐵 + 𝐶) + (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)))) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0))))
165	1, 56	mbfneg 24254	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ -𝐵) ∈ MblFn)
166	4, 58	mbfneg 24254	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ -𝐶) ∈ MblFn)
167	72	mpteq2dva 5125	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ -(𝐵 + 𝐶)) = (𝑥 ∈ 𝐴 ↦ (-𝐵 + -𝐶)))
168	167, 69	eqeltrrd 2891	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (-𝐵 + -𝐶)) ∈ MblFn)
169	165, 15, 166, 19, 168	mbfposadd 35104	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0))) ∈ MblFn)
170	164, 169	eqeltrd 2890	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (-(𝐵 + 𝐶) + (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)))) ∈ MblFn)
171	69, 28, 59, 32, 170	mbfposadd 35104	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) + if(0 ≤ (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)), (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)), 0))) ∈ MblFn)
172	68, 171	eqeltrrd 2891	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) + (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)))) ∈ MblFn)
173		max1 12566	. . . . . . 7 ⊢ ((0 ∈ ℝ ∧ -(𝐵 + 𝐶) ∈ ℝ) → 0 ≤ if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0))
174	8, 28, 173	sylancr 590	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0))
175	30, 48, 32, 60, 172, 30, 32, 174, 65	itgaddnclem1 35115	. . . . 5 ⊢ (𝜑 → ∫𝐴(if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) + (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0))) d𝑥 = (∫𝐴if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) d𝑥 + ∫𝐴(if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)) d𝑥))
176	47	simpld 498	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0)) ∈ 𝐿¹)
177	50	simprd 499	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ 𝐿¹)
178	53	simprd 499	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐶, -𝐶, 0)) ∈ 𝐿¹)
179	17, 177, 21, 178, 169	ibladdnc 35114	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0))) ∈ 𝐿¹)
180		max1 12566	. . . . . . . . . . . 12 ⊢ ((0 ∈ ℝ ∧ -𝐵 ∈ ℝ) → 0 ≤ if(0 ≤ -𝐵, -𝐵, 0))
181	8, 15, 180	sylancr 590	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ -𝐵, -𝐵, 0))
182		max1 12566	. . . . . . . . . . . 12 ⊢ ((0 ∈ ℝ ∧ -𝐶 ∈ ℝ) → 0 ≤ if(0 ≤ -𝐶, -𝐶, 0))
183	8, 19, 182	sylancr 590	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ -𝐶, -𝐶, 0))
184	17, 21, 181, 183	addge0d 11205	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)))
185	184	iftrued 4433	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)), (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)), 0) = (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)))
186	185	oveq2d 7151	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) + if(0 ≤ (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)), (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)), 0)) = (if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) + (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0))))
187	186	mpteq2dva 5125	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) + if(0 ≤ (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)), (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)), 0))) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) + (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)))))
188	70, 71, 18, 22	add4d 10857	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐵 + 𝐶) + (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0))) = ((𝐵 + if(0 ≤ -𝐵, -𝐵, 0)) + (𝐶 + if(0 ≤ -𝐶, -𝐶, 0))))
189	82, 79	eqtrd 2833	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 = 0 → if(0 ≤ -𝐵, -𝐵, 0) = 0)
190	83, 189	oveq12d 7153	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 = 0 → (𝐵 + if(0 ≤ -𝐵, -𝐵, 0)) = (0 + 0))
191	190, 88	eqtrdi 2849	. . . . . . . . . . . . . . 15 ⊢ (𝐵 = 0 → (𝐵 + if(0 ≤ -𝐵, -𝐵, 0)) = 0)
192	83, 85, 191	3eqtr4rd 2844	. . . . . . . . . . . . . 14 ⊢ (𝐵 = 0 → (𝐵 + if(0 ≤ -𝐵, -𝐵, 0)) = if(0 ≤ 𝐵, 𝐵, 0))
193	192	adantl 485	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 = 0) → (𝐵 + if(0 ≤ -𝐵, -𝐵, 0)) = if(0 ≤ 𝐵, 𝐵, 0))
194		ovif2 7231	. . . . . . . . . . . . . 14 ⊢ (𝐵 + if(0 ≤ -𝐵, -𝐵, 0)) = if(0 ≤ -𝐵, (𝐵 + -𝐵), (𝐵 + 0))
195	1	le0neg1d 11200	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 ≤ 0 ↔ 0 ≤ -𝐵))
196		leloe 10716	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐵 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐵 ≤ 0 ↔ (𝐵 < 0 ∨ 𝐵 = 0)))
197	1, 8, 196	sylancl 589	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 ≤ 0 ↔ (𝐵 < 0 ∨ 𝐵 = 0)))
198	195, 197	bitr3d 284	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (0 ≤ -𝐵 ↔ (𝐵 < 0 ∨ 𝐵 = 0)))
199		df-ne 2988	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐵 ≠ 0 ↔ ¬ 𝐵 = 0)
200		biorf 934	. . . . . . . . . . . . . . . . . . . 20 ⊢ (¬ 𝐵 = 0 → (𝐵 < 0 ↔ (𝐵 = 0 ∨ 𝐵 < 0)))
201	199, 200	sylbi 220	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐵 ≠ 0 → (𝐵 < 0 ↔ (𝐵 = 0 ∨ 𝐵 < 0)))
202		orcom 867	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐵 = 0 ∨ 𝐵 < 0) ↔ (𝐵 < 0 ∨ 𝐵 = 0))
203	201, 202	syl6rbb 291	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 ≠ 0 → ((𝐵 < 0 ∨ 𝐵 = 0) ↔ 𝐵 < 0))
204	198, 203	sylan9bb 513	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → (0 ≤ -𝐵 ↔ 𝐵 < 0))
205		ltnle 10709	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐵 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐵 < 0 ↔ ¬ 0 ≤ 𝐵))
206	1, 8, 205	sylancl 589	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 < 0 ↔ ¬ 0 ≤ 𝐵))
207	206	adantr 484	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → (𝐵 < 0 ↔ ¬ 0 ≤ 𝐵))
208	204, 207	bitrd 282	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → (0 ≤ -𝐵 ↔ ¬ 0 ≤ 𝐵))
209	111	adantr 484	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → (𝐵 + -𝐵) = 0)
210	70	addid1d 10829	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 + 0) = 𝐵)
211	210	adantr 484	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → (𝐵 + 0) = 𝐵)
212	208, 209, 211	ifbieq12d 4452	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → if(0 ≤ -𝐵, (𝐵 + -𝐵), (𝐵 + 0)) = if(¬ 0 ≤ 𝐵, 0, 𝐵))
213		ifnot 4475	. . . . . . . . . . . . . . 15 ⊢ if(¬ 0 ≤ 𝐵, 0, 𝐵) = if(0 ≤ 𝐵, 𝐵, 0)
214	212, 213	eqtrdi 2849	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → if(0 ≤ -𝐵, (𝐵 + -𝐵), (𝐵 + 0)) = if(0 ≤ 𝐵, 𝐵, 0))
215	194, 214	syl5eq 2845	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐵 ≠ 0) → (𝐵 + if(0 ≤ -𝐵, -𝐵, 0)) = if(0 ≤ 𝐵, 𝐵, 0))
216	193, 215	pm2.61dane 3074	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 + if(0 ≤ -𝐵, -𝐵, 0)) = if(0 ≤ 𝐵, 𝐵, 0))
217	124, 122	eqtrd 2833	. . . . . . . . . . . . . . . . 17 ⊢ (𝐶 = 0 → if(0 ≤ -𝐶, -𝐶, 0) = 0)
218	125, 217	oveq12d 7153	. . . . . . . . . . . . . . . 16 ⊢ (𝐶 = 0 → (𝐶 + if(0 ≤ -𝐶, -𝐶, 0)) = (0 + 0))
219	218, 88	eqtrdi 2849	. . . . . . . . . . . . . . 15 ⊢ (𝐶 = 0 → (𝐶 + if(0 ≤ -𝐶, -𝐶, 0)) = 0)
220	125, 127, 219	3eqtr4rd 2844	. . . . . . . . . . . . . 14 ⊢ (𝐶 = 0 → (𝐶 + if(0 ≤ -𝐶, -𝐶, 0)) = if(0 ≤ 𝐶, 𝐶, 0))
221	220	adantl 485	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 = 0) → (𝐶 + if(0 ≤ -𝐶, -𝐶, 0)) = if(0 ≤ 𝐶, 𝐶, 0))
222		ovif2 7231	. . . . . . . . . . . . . 14 ⊢ (𝐶 + if(0 ≤ -𝐶, -𝐶, 0)) = if(0 ≤ -𝐶, (𝐶 + -𝐶), (𝐶 + 0))
223	4	le0neg1d 11200	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 ≤ 0 ↔ 0 ≤ -𝐶))
224		leloe 10716	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐶 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐶 ≤ 0 ↔ (𝐶 < 0 ∨ 𝐶 = 0)))
225	4, 8, 224	sylancl 589	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 ≤ 0 ↔ (𝐶 < 0 ∨ 𝐶 = 0)))
226	223, 225	bitr3d 284	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (0 ≤ -𝐶 ↔ (𝐶 < 0 ∨ 𝐶 = 0)))
227		df-ne 2988	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐶 ≠ 0 ↔ ¬ 𝐶 = 0)
228		biorf 934	. . . . . . . . . . . . . . . . . . . 20 ⊢ (¬ 𝐶 = 0 → (𝐶 < 0 ↔ (𝐶 = 0 ∨ 𝐶 < 0)))
229	227, 228	sylbi 220	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐶 ≠ 0 → (𝐶 < 0 ↔ (𝐶 = 0 ∨ 𝐶 < 0)))
230		orcom 867	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐶 = 0 ∨ 𝐶 < 0) ↔ (𝐶 < 0 ∨ 𝐶 = 0))
231	229, 230	syl6rbb 291	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐶 ≠ 0 → ((𝐶 < 0 ∨ 𝐶 = 0) ↔ 𝐶 < 0))
232	226, 231	sylan9bb 513	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → (0 ≤ -𝐶 ↔ 𝐶 < 0))
233		ltnle 10709	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐶 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐶 < 0 ↔ ¬ 0 ≤ 𝐶))
234	4, 8, 233	sylancl 589	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 < 0 ↔ ¬ 0 ≤ 𝐶))
235	234	adantr 484	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → (𝐶 < 0 ↔ ¬ 0 ≤ 𝐶))
236	232, 235	bitrd 282	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → (0 ≤ -𝐶 ↔ ¬ 0 ≤ 𝐶))
237	152	adantr 484	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → (𝐶 + -𝐶) = 0)
238	71	addid1d 10829	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 + 0) = 𝐶)
239	238	adantr 484	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → (𝐶 + 0) = 𝐶)
240	236, 237, 239	ifbieq12d 4452	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → if(0 ≤ -𝐶, (𝐶 + -𝐶), (𝐶 + 0)) = if(¬ 0 ≤ 𝐶, 0, 𝐶))
241		ifnot 4475	. . . . . . . . . . . . . . 15 ⊢ if(¬ 0 ≤ 𝐶, 0, 𝐶) = if(0 ≤ 𝐶, 𝐶, 0)
242	240, 241	eqtrdi 2849	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → if(0 ≤ -𝐶, (𝐶 + -𝐶), (𝐶 + 0)) = if(0 ≤ 𝐶, 𝐶, 0))
243	222, 242	syl5eq 2845	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ≠ 0) → (𝐶 + if(0 ≤ -𝐶, -𝐶, 0)) = if(0 ≤ 𝐶, 𝐶, 0))
244	221, 243	pm2.61dane 3074	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 + if(0 ≤ -𝐶, -𝐶, 0)) = if(0 ≤ 𝐶, 𝐶, 0))
245	216, 244	oveq12d 7153	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐵 + if(0 ≤ -𝐵, -𝐵, 0)) + (𝐶 + if(0 ≤ -𝐶, -𝐶, 0))) = (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)))
246	188, 245	eqtrd 2833	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐵 + 𝐶) + (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0))) = (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)))
247	246	mpteq2dva 5125	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((𝐵 + 𝐶) + (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)))) = (𝑥 ∈ 𝐴 ↦ (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0))))
248	247, 59	eqeltrd 2890	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((𝐵 + 𝐶) + (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)))) ∈ MblFn)
249	44, 24, 169, 37, 248	mbfposadd 35104	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) + if(0 ≤ (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)), (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)), 0))) ∈ MblFn)
250	187, 249	eqeltrrd 2891	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) + (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)))) ∈ MblFn)
251		max1 12566	. . . . . . 7 ⊢ ((0 ∈ ℝ ∧ (𝐵 + 𝐶) ∈ ℝ) → 0 ≤ if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0))
252	8, 24, 251	sylancr 590	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0))
253	35, 176, 37, 179, 250, 35, 37, 252, 184	itgaddnclem1 35115	. . . . 5 ⊢ (𝜑 → ∫𝐴(if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) + (if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0))) d𝑥 = (∫𝐴if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) d𝑥 + ∫𝐴(if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)) d𝑥))
254	41, 175, 253	3eqtr3d 2841	. . . 4 ⊢ (𝜑 → (∫𝐴if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) d𝑥 + ∫𝐴(if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)) d𝑥) = (∫𝐴if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) d𝑥 + ∫𝐴(if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)) d𝑥))
255	30, 48	itgcl 24387	. . . . 5 ⊢ (𝜑 → ∫𝐴if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) d𝑥 ∈ ℂ)
256	10, 51, 13, 54, 59, 10, 13, 62, 64	itgaddnclem1 35115	. . . . . 6 ⊢ (𝜑 → ∫𝐴(if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)) d𝑥 = (∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 + ∫𝐴if(0 ≤ 𝐶, 𝐶, 0) d𝑥))
257	10, 51	itgcl 24387	. . . . . . 7 ⊢ (𝜑 → ∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 ∈ ℂ)
258	13, 54	itgcl 24387	. . . . . . 7 ⊢ (𝜑 → ∫𝐴if(0 ≤ 𝐶, 𝐶, 0) d𝑥 ∈ ℂ)
259	257, 258	addcld 10649	. . . . . 6 ⊢ (𝜑 → (∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 + ∫𝐴if(0 ≤ 𝐶, 𝐶, 0) d𝑥) ∈ ℂ)
260	256, 259	eqeltrd 2890	. . . . 5 ⊢ (𝜑 → ∫𝐴(if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)) d𝑥 ∈ ℂ)
261	35, 176	itgcl 24387	. . . . 5 ⊢ (𝜑 → ∫𝐴if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) d𝑥 ∈ ℂ)
262	17, 177, 21, 178, 169, 17, 21, 181, 183	itgaddnclem1 35115	. . . . . 6 ⊢ (𝜑 → ∫𝐴(if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)) d𝑥 = (∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥 + ∫𝐴if(0 ≤ -𝐶, -𝐶, 0) d𝑥))
263	17, 177	itgcl 24387	. . . . . . 7 ⊢ (𝜑 → ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥 ∈ ℂ)
264	21, 178	itgcl 24387	. . . . . . 7 ⊢ (𝜑 → ∫𝐴if(0 ≤ -𝐶, -𝐶, 0) d𝑥 ∈ ℂ)
265	263, 264	addcld 10649	. . . . . 6 ⊢ (𝜑 → (∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥 + ∫𝐴if(0 ≤ -𝐶, -𝐶, 0) d𝑥) ∈ ℂ)
266	262, 265	eqeltrd 2890	. . . . 5 ⊢ (𝜑 → ∫𝐴(if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)) d𝑥 ∈ ℂ)
267	255, 260, 261, 266	addsubeq4d 11037	. . . 4 ⊢ (𝜑 → ((∫𝐴if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) d𝑥 + ∫𝐴(if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)) d𝑥) = (∫𝐴if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) d𝑥 + ∫𝐴(if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)) d𝑥) ↔ (∫𝐴if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) d𝑥 − ∫𝐴if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) d𝑥) = (∫𝐴(if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)) d𝑥 − ∫𝐴(if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)) d𝑥)))
268	254, 267	mpbid 235	. . 3 ⊢ (𝜑 → (∫𝐴if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) d𝑥 − ∫𝐴if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) d𝑥) = (∫𝐴(if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)) d𝑥 − ∫𝐴(if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)) d𝑥))
269	256, 262	oveq12d 7153	. . 3 ⊢ (𝜑 → (∫𝐴(if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0)) d𝑥 − ∫𝐴(if(0 ≤ -𝐵, -𝐵, 0) + if(0 ≤ -𝐶, -𝐶, 0)) d𝑥) = ((∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 + ∫𝐴if(0 ≤ 𝐶, 𝐶, 0) d𝑥) − (∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥 + ∫𝐴if(0 ≤ -𝐶, -𝐶, 0) d𝑥)))
270	257, 258, 263, 264	addsub4d 11033	. . 3 ⊢ (𝜑 → ((∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 + ∫𝐴if(0 ≤ 𝐶, 𝐶, 0) d𝑥) − (∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥 + ∫𝐴if(0 ≤ -𝐶, -𝐶, 0) d𝑥)) = ((∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥) + (∫𝐴if(0 ≤ 𝐶, 𝐶, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐶, -𝐶, 0) d𝑥)))
271	268, 269, 270	3eqtrd 2837	. 2 ⊢ (𝜑 → (∫𝐴if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) d𝑥 − ∫𝐴if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) d𝑥) = ((∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥) + (∫𝐴if(0 ≤ 𝐶, 𝐶, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐶, -𝐶, 0) d𝑥)))
272	24, 45	itgreval 24400	. 2 ⊢ (𝜑 → ∫𝐴(𝐵 + 𝐶) d𝑥 = (∫𝐴if(0 ≤ (𝐵 + 𝐶), (𝐵 + 𝐶), 0) d𝑥 − ∫𝐴if(0 ≤ -(𝐵 + 𝐶), -(𝐵 + 𝐶), 0) d𝑥))
273	1, 42	itgreval 24400	. . 3 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 = (∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥))
274	4, 43	itgreval 24400	. . 3 ⊢ (𝜑 → ∫𝐴𝐶 d𝑥 = (∫𝐴if(0 ≤ 𝐶, 𝐶, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐶, -𝐶, 0) d𝑥))
275	273, 274	oveq12d 7153	. 2 ⊢ (𝜑 → (∫𝐴𝐵 d𝑥 + ∫𝐴𝐶 d𝑥) = ((∫𝐴if(0 ≤ 𝐵, 𝐵, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐵, -𝐵, 0) d𝑥) + (∫𝐴if(0 ≤ 𝐶, 𝐶, 0) d𝑥 − ∫𝐴if(0 ≤ -𝐶, -𝐶, 0) d𝑥)))
276	271, 272, 275	3eqtr4d 2843	1 ⊢ (𝜑 → ∫𝐴(𝐵 + 𝐶) d𝑥 = (∫𝐴𝐵 d𝑥 + ∫𝐴𝐶 d𝑥))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 ∨ wo 844 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ifcif 4425 class class class wbr 5030 ↦ cmpt 5110 (class class class)co 7135 ℂcc 10524 ℝcr 10525 0cc0 10526 + caddc 10529 < clt 10664 ≤ cle 10665 − cmin 10859 -cneg 10860 MblFncmbf 24218 𝐿¹cibl 24221 ∫citg 24222

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-inf2 9088 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604 ax-addf 10605

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-disj 4996 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-se 5479 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-isom 6333 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-of 7389 df-ofr 7390 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-2o 8086 df-oadd 8089 df-er 8272 df-map 8391 df-pm 8392 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-fi 8859 df-sup 8890 df-inf 8891 df-oi 8958 df-dju 9314 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-2 11688 df-3 11689 df-4 11690 df-n0 11886 df-z 11970 df-uz 12232 df-q 12337 df-rp 12378 df-xneg 12495 df-xadd 12496 df-xmul 12497 df-ioo 12730 df-ico 12732 df-icc 12733 df-fz 12886 df-fzo 13029 df-fl 13157 df-mod 13233 df-seq 13365 df-exp 13426 df-hash 13687 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 df-clim 14837 df-sum 15035 df-rest 16688 df-topgen 16709 df-psmet 20083 df-xmet 20084 df-met 20085 df-bl 20086 df-mopn 20087 df-top 21499 df-topon 21516 df-bases 21551 df-cmp 21992 df-ovol 24068 df-vol 24069 df-mbf 24223 df-itg1 24224 df-itg2 24225 df-ibl 24226 df-itg 24227 df-0p 24274

This theorem is referenced by: itgaddnc 35117

W3C validator