itgcnlem - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > itgcnlem		Structured version Visualization version GIF version

Theorem itgcnlem 25747

Description: Expand out the sum in dfitg 25726. (Contributed by Mario Carneiro, 1-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)

**Hypotheses**
Ref	Expression
itgcnlem.r	⊢ 𝑅 = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘𝐵)), (ℜ‘𝐵), 0)))
itgcnlem.s	⊢ 𝑆 = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(ℜ‘𝐵)), -(ℜ‘𝐵), 0)))
itgcnlem.t	⊢ 𝑇 = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℑ‘𝐵)), (ℑ‘𝐵), 0)))
itgcnlem.u	⊢ 𝑈 = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(ℑ‘𝐵)), -(ℑ‘𝐵), 0)))
itgcnlem.v	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
itgcnlem.i	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)

**Assertion**
Ref	Expression
itgcnlem	⊢ (𝜑 → ∫𝐴𝐵 d𝑥 = ((𝑅 − 𝑆) + (i · (𝑇 − 𝑈))))

Distinct variable groups: 𝑥,𝐴 𝜑,𝑥 𝑥,𝑉 Allowed substitution hints: 𝐵(𝑥) 𝑅(𝑥) 𝑆(𝑥) 𝑇(𝑥) 𝑈(𝑥)

Proof of Theorem itgcnlem Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2736	. . . 4 ⊢ (ℜ‘(𝐵 / (i↑𝑘))) = (ℜ‘(𝐵 / (i↑𝑘)))
2	1	dfitg 25726	. . 3 ⊢ ∫𝐴𝐵 d𝑥 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))))
3		nn0uz 12789	. . . . 5 ⊢ ℕ₀ = (ℤ_≥‘0)
4		df-3 12209	. . . . 5 ⊢ 3 = (2 + 1)
5		oveq2 7366	. . . . . . 7 ⊢ (𝑘 = 3 → (i↑𝑘) = (i↑3))
6		i3 14126	. . . . . . 7 ⊢ (i↑3) = -i
7	5, 6	eqtrdi 2787	. . . . . 6 ⊢ (𝑘 = 3 → (i↑𝑘) = -i)
8	6	itgvallem 25742	. . . . . 6 ⊢ (𝑘 = 3 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -i))), (ℜ‘(𝐵 / -i)), 0))))
9	7, 8	oveq12d 7376	. . . . 5 ⊢ (𝑘 = 3 → ((i↑𝑘) · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) = (-i · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -i))), (ℜ‘(𝐵 / -i)), 0)))))
10		ax-icn 11085	. . . . . . . 8 ⊢ i ∈ ℂ
11	10	a1i 11	. . . . . . 7 ⊢ (𝜑 → i ∈ ℂ)
12		expcl 14002	. . . . . . 7 ⊢ ((i ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (i↑𝑘) ∈ ℂ)
13	11, 12	sylan 580	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ₀) → (i↑𝑘) ∈ ℂ)
14		nn0z 12512	. . . . . . 7 ⊢ (𝑘 ∈ ℕ₀ → 𝑘 ∈ ℤ)
15		eqidd 2737	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))
16		eqidd 2737	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘(𝐵 / (i↑𝑘))) = (ℜ‘(𝐵 / (i↑𝑘))))
17		itgcnlem.i	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)
18		itgcnlem.v	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
19	15, 16, 17, 18	iblitg 25725	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) ∈ ℝ)
20	19	recnd 11160	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) ∈ ℂ)
21	14, 20	sylan2 593	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ₀) → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) ∈ ℂ)
22	13, 21	mulcld 11152	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ₀) → ((i↑𝑘) · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) ∈ ℂ)
23		df-2 12208	. . . . . 6 ⊢ 2 = (1 + 1)
24		oveq2 7366	. . . . . . . 8 ⊢ (𝑘 = 2 → (i↑𝑘) = (i↑2))
25		i2 14125	. . . . . . . 8 ⊢ (i↑2) = -1
26	24, 25	eqtrdi 2787	. . . . . . 7 ⊢ (𝑘 = 2 → (i↑𝑘) = -1)
27	25	itgvallem 25742	. . . . . . 7 ⊢ (𝑘 = 2 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -1))), (ℜ‘(𝐵 / -1)), 0))))
28	26, 27	oveq12d 7376	. . . . . 6 ⊢ (𝑘 = 2 → ((i↑𝑘) · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) = (-1 · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -1))), (ℜ‘(𝐵 / -1)), 0)))))
29		1e0p1 12649	. . . . . . 7 ⊢ 1 = (0 + 1)
30		oveq2 7366	. . . . . . . . 9 ⊢ (𝑘 = 1 → (i↑𝑘) = (i↑1))
31		exp1 13990	. . . . . . . . . 10 ⊢ (i ∈ ℂ → (i↑1) = i)
32	10, 31	ax-mp 5	. . . . . . . . 9 ⊢ (i↑1) = i
33	30, 32	eqtrdi 2787	. . . . . . . 8 ⊢ (𝑘 = 1 → (i↑𝑘) = i)
34	32	itgvallem 25742	. . . . . . . 8 ⊢ (𝑘 = 1 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / i))), (ℜ‘(𝐵 / i)), 0))))
35	33, 34	oveq12d 7376	. . . . . . 7 ⊢ (𝑘 = 1 → ((i↑𝑘) · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) = (i · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / i))), (ℜ‘(𝐵 / i)), 0)))))
36		0z 12499	. . . . . . . . . 10 ⊢ 0 ∈ ℤ
37		itgcnlem.r	. . . . . . . . . . . . . 14 ⊢ 𝑅 = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘𝐵)), (ℜ‘𝐵), 0)))
38		iblmbf 25724	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
39	17, 38	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
40	39, 18	mbfmptcl 25593	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
41	40	div1d 11909	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 / 1) = 𝐵)
42	41	fveq2d 6838	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘(𝐵 / 1)) = (ℜ‘𝐵))
43	42	ibllem 25721	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 1))), (ℜ‘(𝐵 / 1)), 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘𝐵)), (ℜ‘𝐵), 0))
44	43	mpteq2dv 5192	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 1))), (ℜ‘(𝐵 / 1)), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘𝐵)), (ℜ‘𝐵), 0)))
45	44	fveq2d 6838	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 1))), (ℜ‘(𝐵 / 1)), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘𝐵)), (ℜ‘𝐵), 0))))
46	37, 45	eqtr4id 2790	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑅 = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 1))), (ℜ‘(𝐵 / 1)), 0))))
47	46	oveq2d 7374	. . . . . . . . . . . 12 ⊢ (𝜑 → (1 · 𝑅) = (1 · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 1))), (ℜ‘(𝐵 / 1)), 0)))))
48		itgcnlem.s	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑆 = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(ℜ‘𝐵)), -(ℜ‘𝐵), 0)))
49		itgcnlem.t	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑇 = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℑ‘𝐵)), (ℑ‘𝐵), 0)))
50		itgcnlem.u	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑈 = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(ℑ‘𝐵)), -(ℑ‘𝐵), 0)))
51	37, 48, 49, 50, 18	iblcnlem 25746	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn ∧ (𝑅 ∈ ℝ ∧ 𝑆 ∈ ℝ) ∧ (𝑇 ∈ ℝ ∧ 𝑈 ∈ ℝ))))
52	17, 51	mpbid 232	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn ∧ (𝑅 ∈ ℝ ∧ 𝑆 ∈ ℝ) ∧ (𝑇 ∈ ℝ ∧ 𝑈 ∈ ℝ)))
53	52	simp2d 1143	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑅 ∈ ℝ ∧ 𝑆 ∈ ℝ))
54	53	simpld 494	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑅 ∈ ℝ)
55	54	recnd 11160	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑅 ∈ ℂ)
56	55	mullidd 11150	. . . . . . . . . . . 12 ⊢ (𝜑 → (1 · 𝑅) = 𝑅)
57	47, 56	eqtr3d 2773	. . . . . . . . . . 11 ⊢ (𝜑 → (1 · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 1))), (ℜ‘(𝐵 / 1)), 0)))) = 𝑅)
58	57, 55	eqeltrd 2836	. . . . . . . . . 10 ⊢ (𝜑 → (1 · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 1))), (ℜ‘(𝐵 / 1)), 0)))) ∈ ℂ)
59		oveq2 7366	. . . . . . . . . . . . 13 ⊢ (𝑘 = 0 → (i↑𝑘) = (i↑0))
60		exp0 13988	. . . . . . . . . . . . . 14 ⊢ (i ∈ ℂ → (i↑0) = 1)
61	10, 60	ax-mp 5	. . . . . . . . . . . . 13 ⊢ (i↑0) = 1
62	59, 61	eqtrdi 2787	. . . . . . . . . . . 12 ⊢ (𝑘 = 0 → (i↑𝑘) = 1)
63	61	itgvallem 25742	. . . . . . . . . . . 12 ⊢ (𝑘 = 0 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 1))), (ℜ‘(𝐵 / 1)), 0))))
64	62, 63	oveq12d 7376	. . . . . . . . . . 11 ⊢ (𝑘 = 0 → ((i↑𝑘) · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) = (1 · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 1))), (ℜ‘(𝐵 / 1)), 0)))))
65	64	fsum1 15670	. . . . . . . . . 10 ⊢ ((0 ∈ ℤ ∧ (1 · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 1))), (ℜ‘(𝐵 / 1)), 0)))) ∈ ℂ) → Σ𝑘 ∈ (0...0)((i↑𝑘) · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) = (1 · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 1))), (ℜ‘(𝐵 / 1)), 0)))))
66	36, 58, 65	sylancr 587	. . . . . . . . 9 ⊢ (𝜑 → Σ𝑘 ∈ (0...0)((i↑𝑘) · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) = (1 · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 1))), (ℜ‘(𝐵 / 1)), 0)))))
67	66, 57	eqtrd 2771	. . . . . . . 8 ⊢ (𝜑 → Σ𝑘 ∈ (0...0)((i↑𝑘) · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) = 𝑅)
68		0nn0 12416	. . . . . . . 8 ⊢ 0 ∈ ℕ₀
69	67, 68	jctil 519	. . . . . . 7 ⊢ (𝜑 → (0 ∈ ℕ₀ ∧ Σ𝑘 ∈ (0...0)((i↑𝑘) · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) = 𝑅))
70		imval 15030	. . . . . . . . . . . . . 14 ⊢ (𝐵 ∈ ℂ → (ℑ‘𝐵) = (ℜ‘(𝐵 / i)))
71	40, 70	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘𝐵) = (ℜ‘(𝐵 / i)))
72	71	ibllem 25721	. . . . . . . . . . . 12 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℑ‘𝐵)), (ℑ‘𝐵), 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / i))), (ℜ‘(𝐵 / i)), 0))
73	72	mpteq2dv 5192	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℑ‘𝐵)), (ℑ‘𝐵), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / i))), (ℜ‘(𝐵 / i)), 0)))
74	73	fveq2d 6838	. . . . . . . . . 10 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℑ‘𝐵)), (ℑ‘𝐵), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / i))), (ℜ‘(𝐵 / i)), 0))))
75	49, 74	eqtr2id 2784	. . . . . . . . 9 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / i))), (ℜ‘(𝐵 / i)), 0))) = 𝑇)
76	75	oveq2d 7374	. . . . . . . 8 ⊢ (𝜑 → (i · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / i))), (ℜ‘(𝐵 / i)), 0)))) = (i · 𝑇))
77	76	oveq2d 7374	. . . . . . 7 ⊢ (𝜑 → (𝑅 + (i · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / i))), (ℜ‘(𝐵 / i)), 0))))) = (𝑅 + (i · 𝑇)))
78	3, 29, 35, 22, 69, 77	fsump1i 15692	. . . . . 6 ⊢ (𝜑 → (1 ∈ ℕ₀ ∧ Σ𝑘 ∈ (0...1)((i↑𝑘) · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) = (𝑅 + (i · 𝑇))))
79	40	renegd 15132	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘-𝐵) = -(ℜ‘𝐵))
80		ax-1cn 11084	. . . . . . . . . . . . . . . . . . . 20 ⊢ 1 ∈ ℂ
81	80	negnegi 11451	. . . . . . . . . . . . . . . . . . 19 ⊢ --1 = 1
82	81	oveq2i 7369	. . . . . . . . . . . . . . . . . 18 ⊢ (-𝐵 / --1) = (-𝐵 / 1)
83	40	negcld 11479	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐵 ∈ ℂ)
84	83	div1d 11909	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐵 / 1) = -𝐵)
85	82, 84	eqtrid 2783	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐵 / --1) = -𝐵)
86	80	negcli 11449	. . . . . . . . . . . . . . . . . . 19 ⊢ -1 ∈ ℂ
87		neg1ne0 12132	. . . . . . . . . . . . . . . . . . 19 ⊢ -1 ≠ 0
88		div2neg 11864	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐵 ∈ ℂ ∧ -1 ∈ ℂ ∧ -1 ≠ 0) → (-𝐵 / --1) = (𝐵 / -1))
89	86, 87, 88	mp3an23 1455	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 ∈ ℂ → (-𝐵 / --1) = (𝐵 / -1))
90	40, 89	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐵 / --1) = (𝐵 / -1))
91	85, 90	eqtr3d 2773	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐵 = (𝐵 / -1))
92	91	fveq2d 6838	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘-𝐵) = (ℜ‘(𝐵 / -1)))
93	79, 92	eqtr3d 2773	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -(ℜ‘𝐵) = (ℜ‘(𝐵 / -1)))
94	93	ibllem 25721	. . . . . . . . . . . . 13 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(ℜ‘𝐵)), -(ℜ‘𝐵), 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -1))), (ℜ‘(𝐵 / -1)), 0))
95	94	mpteq2dv 5192	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(ℜ‘𝐵)), -(ℜ‘𝐵), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -1))), (ℜ‘(𝐵 / -1)), 0)))
96	95	fveq2d 6838	. . . . . . . . . . 11 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(ℜ‘𝐵)), -(ℜ‘𝐵), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -1))), (ℜ‘(𝐵 / -1)), 0))))
97	48, 96	eqtrid 2783	. . . . . . . . . 10 ⊢ (𝜑 → 𝑆 = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -1))), (ℜ‘(𝐵 / -1)), 0))))
98	97	oveq2d 7374	. . . . . . . . 9 ⊢ (𝜑 → (-1 · 𝑆) = (-1 · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -1))), (ℜ‘(𝐵 / -1)), 0)))))
99	53	simprd 495	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑆 ∈ ℝ)
100	99	recnd 11160	. . . . . . . . . 10 ⊢ (𝜑 → 𝑆 ∈ ℂ)
101	100	mulm1d 11589	. . . . . . . . 9 ⊢ (𝜑 → (-1 · 𝑆) = -𝑆)
102	98, 101	eqtr3d 2773	. . . . . . . 8 ⊢ (𝜑 → (-1 · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -1))), (ℜ‘(𝐵 / -1)), 0)))) = -𝑆)
103	102	oveq2d 7374	. . . . . . 7 ⊢ (𝜑 → ((𝑅 + (i · 𝑇)) + (-1 · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -1))), (ℜ‘(𝐵 / -1)), 0))))) = ((𝑅 + (i · 𝑇)) + -𝑆))
104	52	simp3d 1144	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑇 ∈ ℝ ∧ 𝑈 ∈ ℝ))
105	104	simpld 494	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑇 ∈ ℝ)
106	105	recnd 11160	. . . . . . . . . 10 ⊢ (𝜑 → 𝑇 ∈ ℂ)
107		mulcl 11110	. . . . . . . . . 10 ⊢ ((i ∈ ℂ ∧ 𝑇 ∈ ℂ) → (i · 𝑇) ∈ ℂ)
108	10, 106, 107	sylancr 587	. . . . . . . . 9 ⊢ (𝜑 → (i · 𝑇) ∈ ℂ)
109	55, 108	addcld 11151	. . . . . . . 8 ⊢ (𝜑 → (𝑅 + (i · 𝑇)) ∈ ℂ)
110	109, 100	negsubd 11498	. . . . . . 7 ⊢ (𝜑 → ((𝑅 + (i · 𝑇)) + -𝑆) = ((𝑅 + (i · 𝑇)) − 𝑆))
111	55, 108, 100	addsubd 11513	. . . . . . 7 ⊢ (𝜑 → ((𝑅 + (i · 𝑇)) − 𝑆) = ((𝑅 − 𝑆) + (i · 𝑇)))
112	103, 110, 111	3eqtrd 2775	. . . . . 6 ⊢ (𝜑 → ((𝑅 + (i · 𝑇)) + (-1 · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -1))), (ℜ‘(𝐵 / -1)), 0))))) = ((𝑅 − 𝑆) + (i · 𝑇)))
113	3, 23, 28, 22, 78, 112	fsump1i 15692	. . . . 5 ⊢ (𝜑 → (2 ∈ ℕ₀ ∧ Σ𝑘 ∈ (0...2)((i↑𝑘) · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) = ((𝑅 − 𝑆) + (i · 𝑇))))
114		imval 15030	. . . . . . . . . . . . . 14 ⊢ (-𝐵 ∈ ℂ → (ℑ‘-𝐵) = (ℜ‘(-𝐵 / i)))
115	83, 114	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘-𝐵) = (ℜ‘(-𝐵 / i)))
116	40	imnegd 15133	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘-𝐵) = -(ℑ‘𝐵))
117	10	negnegi 11451	. . . . . . . . . . . . . . . . 17 ⊢ --i = i
118	117	eqcomi 2745	. . . . . . . . . . . . . . . 16 ⊢ i = --i
119	118	oveq2i 7369	. . . . . . . . . . . . . . 15 ⊢ (-𝐵 / i) = (-𝐵 / --i)
120	10	negcli 11449	. . . . . . . . . . . . . . . . 17 ⊢ -i ∈ ℂ
121		ine0 11572	. . . . . . . . . . . . . . . . . 18 ⊢ i ≠ 0
122	10, 121	negne0i 11456	. . . . . . . . . . . . . . . . 17 ⊢ -i ≠ 0
123		div2neg 11864	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐵 ∈ ℂ ∧ -i ∈ ℂ ∧ -i ≠ 0) → (-𝐵 / --i) = (𝐵 / -i))
124	120, 122, 123	mp3an23 1455	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 ∈ ℂ → (-𝐵 / --i) = (𝐵 / -i))
125	40, 124	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐵 / --i) = (𝐵 / -i))
126	119, 125	eqtrid 2783	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (-𝐵 / i) = (𝐵 / -i))
127	126	fveq2d 6838	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘(-𝐵 / i)) = (ℜ‘(𝐵 / -i)))
128	115, 116, 127	3eqtr3d 2779	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -(ℑ‘𝐵) = (ℜ‘(𝐵 / -i)))
129	128	ibllem 25721	. . . . . . . . . . 11 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(ℑ‘𝐵)), -(ℑ‘𝐵), 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -i))), (ℜ‘(𝐵 / -i)), 0))
130	129	mpteq2dv 5192	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(ℑ‘𝐵)), -(ℑ‘𝐵), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -i))), (ℜ‘(𝐵 / -i)), 0)))
131	130	fveq2d 6838	. . . . . . . . 9 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(ℑ‘𝐵)), -(ℑ‘𝐵), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -i))), (ℜ‘(𝐵 / -i)), 0))))
132	50, 131	eqtrid 2783	. . . . . . . 8 ⊢ (𝜑 → 𝑈 = (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -i))), (ℜ‘(𝐵 / -i)), 0))))
133	132	oveq2d 7374	. . . . . . 7 ⊢ (𝜑 → (-i · 𝑈) = (-i · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -i))), (ℜ‘(𝐵 / -i)), 0)))))
134	104	simprd 495	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 ∈ ℝ)
135	134	recnd 11160	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ ℂ)
136		mulneg12 11575	. . . . . . . 8 ⊢ ((i ∈ ℂ ∧ 𝑈 ∈ ℂ) → (-i · 𝑈) = (i · -𝑈))
137	10, 135, 136	sylancr 587	. . . . . . 7 ⊢ (𝜑 → (-i · 𝑈) = (i · -𝑈))
138	133, 137	eqtr3d 2773	. . . . . 6 ⊢ (𝜑 → (-i · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -i))), (ℜ‘(𝐵 / -i)), 0)))) = (i · -𝑈))
139	138	oveq2d 7374	. . . . 5 ⊢ (𝜑 → (((𝑅 − 𝑆) + (i · 𝑇)) + (-i · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / -i))), (ℜ‘(𝐵 / -i)), 0))))) = (((𝑅 − 𝑆) + (i · 𝑇)) + (i · -𝑈)))
140	3, 4, 9, 22, 113, 139	fsump1i 15692	. . . 4 ⊢ (𝜑 → (3 ∈ ℕ₀ ∧ Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) = (((𝑅 − 𝑆) + (i · 𝑇)) + (i · -𝑈))))
141	140	simprd 495	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) = (((𝑅 − 𝑆) + (i · 𝑇)) + (i · -𝑈)))
142	2, 141	eqtrid 2783	. 2 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 = (((𝑅 − 𝑆) + (i · 𝑇)) + (i · -𝑈)))
143	55, 100	subcld 11492	. . 3 ⊢ (𝜑 → (𝑅 − 𝑆) ∈ ℂ)
144	135	negcld 11479	. . . 4 ⊢ (𝜑 → -𝑈 ∈ ℂ)
145		mulcl 11110	. . . 4 ⊢ ((i ∈ ℂ ∧ -𝑈 ∈ ℂ) → (i · -𝑈) ∈ ℂ)
146	10, 144, 145	sylancr 587	. . 3 ⊢ (𝜑 → (i · -𝑈) ∈ ℂ)
147	143, 108, 146	addassd 11154	. 2 ⊢ (𝜑 → (((𝑅 − 𝑆) + (i · 𝑇)) + (i · -𝑈)) = ((𝑅 − 𝑆) + ((i · 𝑇) + (i · -𝑈))))
148	11, 106, 144	adddid 11156	. . . 4 ⊢ (𝜑 → (i · (𝑇 + -𝑈)) = ((i · 𝑇) + (i · -𝑈)))
149	106, 135	negsubd 11498	. . . . 5 ⊢ (𝜑 → (𝑇 + -𝑈) = (𝑇 − 𝑈))
150	149	oveq2d 7374	. . . 4 ⊢ (𝜑 → (i · (𝑇 + -𝑈)) = (i · (𝑇 − 𝑈)))
151	148, 150	eqtr3d 2773	. . 3 ⊢ (𝜑 → ((i · 𝑇) + (i · -𝑈)) = (i · (𝑇 − 𝑈)))
152	151	oveq2d 7374	. 2 ⊢ (𝜑 → ((𝑅 − 𝑆) + ((i · 𝑇) + (i · -𝑈))) = ((𝑅 − 𝑆) + (i · (𝑇 − 𝑈))))
153	142, 147, 152	3eqtrd 2775	1 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 = ((𝑅 − 𝑆) + (i · (𝑇 − 𝑈))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 ifcif 4479 class class class wbr 5098 ↦ cmpt 5179 ‘cfv 6492 (class class class)co 7358 ℂcc 11024 ℝcr 11025 0cc0 11026 1c1 11027 ici 11028 + caddc 11029 · cmul 11031 ≤ cle 11167 − cmin 11364 -cneg 11365 / cdiv 11794 2c2 12200 3c3 12201 ℕ₀cn0 12401 ℤcz 12488 ...cfz 13423 ↑cexp 13984 ℜcre 15020 ℑcim 15021 Σcsu 15609 MblFncmbf 25571 ∫₂citg2 25573 𝐿¹cibl 25574 ∫citg 25575

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-inf2 9550 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-pm 8766 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-sup 9345 df-inf 9346 df-oi 9415 df-card 9851 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-4 12210 df-n0 12402 df-z 12489 df-uz 12752 df-rp 12906 df-fz 13424 df-fzo 13571 df-fl 13712 df-mod 13790 df-seq 13925 df-exp 13985 df-hash 14254 df-cj 15022 df-re 15023 df-im 15024 df-sqrt 15158 df-abs 15159 df-clim 15411 df-sum 15610 df-mbf 25576 df-ibl 25579 df-itg 25580

This theorem is referenced by: itgrevallem1 25752 itgcnval 25757

W3C validator