iblmulc2nc - Mathbox for Brendan Leahy

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

Theorem iblmulc2nc 38006

Description: Choice-free analogue of iblmulc2 25798. (Contributed by Brendan Leahy, 17-Nov-2017.)

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

**Assertion**
Ref	Expression
iblmulc2nc	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ 𝐿¹)

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

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

Step	Hyp	Ref	Expression
1		itgmulc2nc.m	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn)
2		ifan 4520	. . . . . 6 ⊢ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) = if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0)
3		itgmulc2nc.1	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐶 ∈ ℂ)
4	3	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℂ)
5		itgmulc2nc.3	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)
6		iblmbf 25734	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
7	5, 6	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
8		itgmulc2nc.2	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
9	7, 8	mbfmptcl 25603	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
10	4, 9	mulcld 11165	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 · 𝐵) ∈ ℂ)
11	10	adantlr 716	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (𝐶 · 𝐵) ∈ ℂ)
12		elfzelz 13478	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (0...3) → 𝑘 ∈ ℤ)
13	12	ad2antlr 728	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → 𝑘 ∈ ℤ)
14		ax-icn 11097	. . . . . . . . . . . . . . 15 ⊢ i ∈ ℂ
15		ine0 11585	. . . . . . . . . . . . . . 15 ⊢ i ≠ 0
16		expclz 14046	. . . . . . . . . . . . . . 15 ⊢ ((i ∈ ℂ ∧ i ≠ 0 ∧ 𝑘 ∈ ℤ) → (i↑𝑘) ∈ ℂ)
17	14, 15, 16	mp3an12 1454	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℤ → (i↑𝑘) ∈ ℂ)
18	13, 17	syl 17	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (i↑𝑘) ∈ ℂ)
19		expne0i 14056	. . . . . . . . . . . . . . 15 ⊢ ((i ∈ ℂ ∧ i ≠ 0 ∧ 𝑘 ∈ ℤ) → (i↑𝑘) ≠ 0)
20	14, 15, 19	mp3an12 1454	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℤ → (i↑𝑘) ≠ 0)
21	13, 20	syl 17	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (i↑𝑘) ≠ 0)
22	11, 18, 21	divcld 11931	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → ((𝐶 · 𝐵) / (i↑𝑘)) ∈ ℂ)
23	22	recld 15156	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ∈ ℝ)
24		0re 11146	. . . . . . . . . . 11 ⊢ 0 ∈ ℝ
25		ifcl 4512	. . . . . . . . . . 11 ⊢ (((ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ∈ ℝ)
26	23, 24, 25	sylancl 587	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ∈ ℝ)
27	26	rexrd 11195	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ∈ ℝ^*)
28		max1 13137	. . . . . . . . . 10 ⊢ ((0 ∈ ℝ ∧ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ∈ ℝ) → 0 ≤ if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))
29	24, 23, 28	sylancr 588	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))
30		elxrge0 13410	. . . . . . . . 9 ⊢ (if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ∈ (0[,]+∞) ↔ (if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ∈ ℝ^* ∧ 0 ≤ if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)))
31	27, 29, 30	sylanbrc 584	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ∈ (0[,]+∞))
32		0e0iccpnf 13412	. . . . . . . . 9 ⊢ 0 ∈ (0[,]+∞)
33	32	a1i 11	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,]+∞))
34	31, 33	ifclda 4502	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) ∈ (0[,]+∞))
35	34	adantr 480	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) ∈ (0[,]+∞))
36	2, 35	eqeltrid 2840	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) → if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ∈ (0[,]+∞))
37	36	fmpttd 7067	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)):ℝ⟶(0[,]+∞))
38	9	recld 15156	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘𝐵) ∈ ℝ)
39	38	recnd 11173	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘𝐵) ∈ ℂ)
40	39	abscld 15401	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(ℜ‘𝐵)) ∈ ℝ)
41	9	imcld 15157	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘𝐵) ∈ ℝ)
42	41	recnd 11173	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘𝐵) ∈ ℂ)
43	42	abscld 15401	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(ℑ‘𝐵)) ∈ ℝ)
44	40, 43	readdcld 11174	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))) ∈ ℝ)
45	39	absge0d 15409	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (abs‘(ℜ‘𝐵)))
46	42	absge0d 15409	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (abs‘(ℑ‘𝐵)))
47	40, 43, 45, 46	addge0d 11726	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))
48		elrege0 13407	. . . . . . . . . . . 12 ⊢ (((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))) ∈ (0[,)+∞) ↔ (((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))) ∈ ℝ ∧ 0 ≤ ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
49	44, 47, 48	sylanbrc 584	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))) ∈ (0[,)+∞))
50		0e0icopnf 13411	. . . . . . . . . . . 12 ⊢ 0 ∈ (0[,)+∞)
51	50	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,)+∞))
52	49, 51	ifclda 4502	. . . . . . . . . 10 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0) ∈ (0[,)+∞))
53	52	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0) ∈ (0[,)+∞))
54	53	fmpttd 7067	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)):ℝ⟶(0[,)+∞))
55		reex 11129	. . . . . . . . . . . . . 14 ⊢ ℝ ∈ V
56	55	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → ℝ ∈ V)
57		elrege0 13407	. . . . . . . . . . . . . . . 16 ⊢ ((abs‘(ℜ‘𝐵)) ∈ (0[,)+∞) ↔ ((abs‘(ℜ‘𝐵)) ∈ ℝ ∧ 0 ≤ (abs‘(ℜ‘𝐵))))
58	40, 45, 57	sylanbrc 584	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(ℜ‘𝐵)) ∈ (0[,)+∞))
59	58, 51	ifclda 4502	. . . . . . . . . . . . . 14 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) ∈ (0[,)+∞))
60	59	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) ∈ (0[,)+∞))
61		elrege0 13407	. . . . . . . . . . . . . . . 16 ⊢ ((abs‘(ℑ‘𝐵)) ∈ (0[,)+∞) ↔ ((abs‘(ℑ‘𝐵)) ∈ ℝ ∧ 0 ≤ (abs‘(ℑ‘𝐵))))
62	43, 46, 61	sylanbrc 584	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(ℑ‘𝐵)) ∈ (0[,)+∞))
63	62, 51	ifclda 4502	. . . . . . . . . . . . . 14 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0) ∈ (0[,)+∞))
64	63	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0) ∈ (0[,)+∞))
65		eqidd 2737	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)))
66		eqidd 2737	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)))
67	56, 60, 64, 65, 66	offval2 7651	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) ∘_f + (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))) = (𝑥 ∈ ℝ ↦ (if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) + if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))))
68		iftrue 4472	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) = (abs‘(ℜ‘𝐵)))
69		iftrue 4472	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0) = (abs‘(ℑ‘𝐵)))
70	68, 69	oveq12d 7385	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝐴 → (if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) + if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) = ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))
71		iftrue 4472	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0) = ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))
72	70, 71	eqtr4d 2774	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝐴 → (if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) + if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) = if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))
73		00id 11321	. . . . . . . . . . . . . . 15 ⊢ (0 + 0) = 0
74		iffalse 4475	. . . . . . . . . . . . . . . 16 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) = 0)
75		iffalse 4475	. . . . . . . . . . . . . . . 16 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0) = 0)
76	74, 75	oveq12d 7385	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝑥 ∈ 𝐴 → (if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) + if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) = (0 + 0))
77		iffalse 4475	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0) = 0)
78	73, 76, 77	3eqtr4a 2797	. . . . . . . . . . . . . 14 ⊢ (¬ 𝑥 ∈ 𝐴 → (if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) + if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) = if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))
79	72, 78	pm2.61i 182	. . . . . . . . . . . . 13 ⊢ (if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) + if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) = if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)
80	79	mpteq2i 5181	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℝ ↦ (if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) + if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))
81	67, 80	eqtr2di 2788	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) ∘_f + (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))))
82	81	fveq2d 6844	. . . . . . . . . 10 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))) = (∫₂‘((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) ∘_f + (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)))))
83		eqid 2736	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))
84	9	iblcn 25766	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿¹)))
85	5, 84	mpbid 232	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿¹))
86	85	simpld 494	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿¹)
87	8, 5, 83, 86, 38	iblabsnclem 38004	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) ∈ ℝ))
88	87	simpld 494	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) ∈ MblFn)
89	60	fmpttd 7067	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)):ℝ⟶(0[,)+∞))
90	87	simprd 495	. . . . . . . . . . 11 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) ∈ ℝ)
91	64	fmpttd 7067	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)):ℝ⟶(0[,)+∞))
92		eqid 2736	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))
93	85	simprd 495	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿¹)
94	8, 5, 92, 93, 41	iblabsnclem 38004	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))) ∈ ℝ))
95	94	simprd 495	. . . . . . . . . . 11 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))) ∈ ℝ)
96	88, 89, 90, 91, 95	itg2addnc 37995	. . . . . . . . . 10 ⊢ (𝜑 → (∫₂‘((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) ∘_f + (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)))) = ((∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) + (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)))))
97	82, 96	eqtrd 2771	. . . . . . . . 9 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))) = ((∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) + (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)))))
98	90, 95	readdcld 11174	. . . . . . . . 9 ⊢ (𝜑 → ((∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) + (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)))) ∈ ℝ)
99	97, 98	eqeltrd 2836	. . . . . . . 8 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))) ∈ ℝ)
100	3	abscld 15401	. . . . . . . . 9 ⊢ (𝜑 → (abs‘𝐶) ∈ ℝ)
101	3	absge0d 15409	. . . . . . . . 9 ⊢ (𝜑 → 0 ≤ (abs‘𝐶))
102		elrege0 13407	. . . . . . . . 9 ⊢ ((abs‘𝐶) ∈ (0[,)+∞) ↔ ((abs‘𝐶) ∈ ℝ ∧ 0 ≤ (abs‘𝐶)))
103	100, 101, 102	sylanbrc 584	. . . . . . . 8 ⊢ (𝜑 → (abs‘𝐶) ∈ (0[,)+∞))
104	54, 99, 103	itg2mulc 25714	. . . . . . 7 ⊢ (𝜑 → (∫₂‘((ℝ × {(abs‘𝐶)}) ∘_f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)))) = ((abs‘𝐶) · (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)))))
105	100	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (abs‘𝐶) ∈ ℝ)
106		fconstmpt 5693	. . . . . . . . . . 11 ⊢ (ℝ × {(abs‘𝐶)}) = (𝑥 ∈ ℝ ↦ (abs‘𝐶))
107	106	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ × {(abs‘𝐶)}) = (𝑥 ∈ ℝ ↦ (abs‘𝐶)))
108		eqidd 2737	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)))
109	56, 105, 53, 107, 108	offval2 7651	. . . . . . . . 9 ⊢ (𝜑 → ((ℝ × {(abs‘𝐶)}) ∘_f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))) = (𝑥 ∈ ℝ ↦ ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))))
110	71	oveq2d 7383	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝐴 → ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
111		iftrue 4472	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0) = ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
112	110, 111	eqtr4d 2774	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝐴 → ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
113	112	adantl 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
114	100	recnd 11173	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (abs‘𝐶) ∈ ℂ)
115	114	mul01d 11345	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((abs‘𝐶) · 0) = 0)
116	115	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · 0) = 0)
117	77	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0) = 0)
118	117	oveq2d 7383	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = ((abs‘𝐶) · 0))
119		iffalse 4475	. . . . . . . . . . . . 13 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0) = 0)
120	119	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0) = 0)
121	116, 118, 120	3eqtr4d 2781	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
122	113, 121	pm2.61dan 813	. . . . . . . . . 10 ⊢ (𝜑 → ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
123	122	mpteq2dv 5179	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)))
124	109, 123	eqtrd 2771	. . . . . . . 8 ⊢ (𝜑 → ((ℝ × {(abs‘𝐶)}) ∘_f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)))
125	124	fveq2d 6844	. . . . . . 7 ⊢ (𝜑 → (∫₂‘((ℝ × {(abs‘𝐶)}) ∘_f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)))) = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))))
126	97	oveq2d 7383	. . . . . . 7 ⊢ (𝜑 → ((abs‘𝐶) · (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)))) = ((abs‘𝐶) · ((∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) + (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))))))
127	104, 125, 126	3eqtr3d 2779	. . . . . 6 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))) = ((abs‘𝐶) · ((∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) + (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))))))
128	100, 98	remulcld 11175	. . . . . 6 ⊢ (𝜑 → ((abs‘𝐶) · ((∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) + (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))))) ∈ ℝ)
129	127, 128	eqeltrd 2836	. . . . 5 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))) ∈ ℝ)
130	129	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))) ∈ ℝ)
131	100	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐶) ∈ ℝ)
132	131, 44	remulcld 11175	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ∈ ℝ)
133	132	rexrd 11195	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ∈ ℝ^*)
134	101	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (abs‘𝐶))
135	131, 44, 134, 47	mulge0d 11727	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
136		elxrge0 13410	. . . . . . . . 9 ⊢ (((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ∈ (0[,]+∞) ↔ (((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ∈ ℝ^* ∧ 0 ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))))
137	133, 135, 136	sylanbrc 584	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ∈ (0[,]+∞))
138	32	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,]+∞))
139	137, 138	ifclda 4502	. . . . . . 7 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0) ∈ (0[,]+∞))
140	139	ad2antrr 727	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0) ∈ (0[,]+∞))
141	140	fmpttd 7067	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)):ℝ⟶(0[,]+∞))
142	9	abscld 15401	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ ℝ)
143	131, 142	remulcld 11175	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · (abs‘𝐵)) ∈ ℝ)
144	143	adantlr 716	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · (abs‘𝐵)) ∈ ℝ)
145	132	adantlr 716	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ∈ ℝ)
146	22	releabsd 15416	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ≤ (abs‘((𝐶 · 𝐵) / (i↑𝑘))))
147	11, 18, 21	absdivd 15420	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (abs‘((𝐶 · 𝐵) / (i↑𝑘))) = ((abs‘(𝐶 · 𝐵)) / (abs‘(i↑𝑘))))
148		elfznn0 13574	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ (0...3) → 𝑘 ∈ ℕ₀)
149		absexp 15266	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((i ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (abs‘(i↑𝑘)) = ((abs‘i)↑𝑘))
150	14, 148, 149	sylancr 588	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (0...3) → (abs‘(i↑𝑘)) = ((abs‘i)↑𝑘))
151		absi 15248	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (abs‘i) = 1
152	151	oveq1i 7377	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((abs‘i)↑𝑘) = (1↑𝑘)
153		1exp 14053	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑘 ∈ ℤ → (1↑𝑘) = 1)
154	12, 153	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ (0...3) → (1↑𝑘) = 1)
155	152, 154	eqtrid 2783	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (0...3) → ((abs‘i)↑𝑘) = 1)
156	150, 155	eqtrd 2771	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ (0...3) → (abs‘(i↑𝑘)) = 1)
157	156	oveq2d 7383	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (0...3) → ((abs‘(𝐶 · 𝐵)) / (abs‘(i↑𝑘))) = ((abs‘(𝐶 · 𝐵)) / 1))
158	157	ad2antlr 728	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → ((abs‘(𝐶 · 𝐵)) / (abs‘(i↑𝑘))) = ((abs‘(𝐶 · 𝐵)) / 1))
159	10	abscld 15401	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(𝐶 · 𝐵)) ∈ ℝ)
160	159	recnd 11173	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(𝐶 · 𝐵)) ∈ ℂ)
161	160	adantlr 716	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (abs‘(𝐶 · 𝐵)) ∈ ℂ)
162	161	div1d 11923	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → ((abs‘(𝐶 · 𝐵)) / 1) = (abs‘(𝐶 · 𝐵)))
163	147, 158, 162	3eqtrd 2775	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (abs‘((𝐶 · 𝐵) / (i↑𝑘))) = (abs‘(𝐶 · 𝐵)))
164	4, 9	absmuld 15419	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(𝐶 · 𝐵)) = ((abs‘𝐶) · (abs‘𝐵)))
165	164	adantlr 716	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (abs‘(𝐶 · 𝐵)) = ((abs‘𝐶) · (abs‘𝐵)))
166	163, 165	eqtrd 2771	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (abs‘((𝐶 · 𝐵) / (i↑𝑘))) = ((abs‘𝐶) · (abs‘𝐵)))
167	146, 166	breqtrd 5111	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ≤ ((abs‘𝐶) · (abs‘𝐵)))
168		mulcl 11122	. . . . . . . . . . . . . . . . . 18 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐵) ∈ ℂ) → (i · (ℑ‘𝐵)) ∈ ℂ)
169	14, 42, 168	sylancr 588	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (i · (ℑ‘𝐵)) ∈ ℂ)
170	39, 169	abstrid 15421	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘((ℜ‘𝐵) + (i · (ℑ‘𝐵)))) ≤ ((abs‘(ℜ‘𝐵)) + (abs‘(i · (ℑ‘𝐵)))))
171	9	replimd 15159	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = ((ℜ‘𝐵) + (i · (ℑ‘𝐵))))
172	171	fveq2d 6844	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) = (abs‘((ℜ‘𝐵) + (i · (ℑ‘𝐵)))))
173		absmul 15256	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐵) ∈ ℂ) → (abs‘(i · (ℑ‘𝐵))) = ((abs‘i) · (abs‘(ℑ‘𝐵))))
174	14, 42, 173	sylancr 588	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(i · (ℑ‘𝐵))) = ((abs‘i) · (abs‘(ℑ‘𝐵))))
175	151	oveq1i 7377	. . . . . . . . . . . . . . . . . . 19 ⊢ ((abs‘i) · (abs‘(ℑ‘𝐵))) = (1 · (abs‘(ℑ‘𝐵)))
176	174, 175	eqtrdi 2787	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(i · (ℑ‘𝐵))) = (1 · (abs‘(ℑ‘𝐵))))
177	43	recnd 11173	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(ℑ‘𝐵)) ∈ ℂ)
178	177	mullidd 11163	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (1 · (abs‘(ℑ‘𝐵))) = (abs‘(ℑ‘𝐵)))
179	176, 178	eqtr2d 2772	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(ℑ‘𝐵)) = (abs‘(i · (ℑ‘𝐵))))
180	179	oveq2d 7383	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))) = ((abs‘(ℜ‘𝐵)) + (abs‘(i · (ℑ‘𝐵)))))
181	170, 172, 180	3brtr4d 5117	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ≤ ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))
182	142, 44, 131, 134, 181	lemul2ad 12096	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · (abs‘𝐵)) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
183	182	adantlr 716	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · (abs‘𝐵)) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
184	23, 144, 145, 167, 183	letrd 11303	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
185	135	adantlr 716	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → 0 ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
186		breq1 5088	. . . . . . . . . . . . 13 ⊢ ((ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) = if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) → ((ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ↔ if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))))
187		breq1 5088	. . . . . . . . . . . . 13 ⊢ (0 = if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) → (0 ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ↔ if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))))
188	186, 187	ifboth 4506	. . . . . . . . . . . 12 ⊢ (((ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ∧ 0 ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))) → if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
189	184, 185, 188	syl2anc 585	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
190		iftrue 4472	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) = if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))
191	190	adantl 481	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) = if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))
192	111	adantl 481	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0) = ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
193	189, 191, 192	3brtr4d 5117	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) ≤ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
194	193	ex 412	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) ≤ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)))
195		0le0 12282	. . . . . . . . . . 11 ⊢ 0 ≤ 0
196	195	a1i 11	. . . . . . . . . 10 ⊢ (¬ 𝑥 ∈ 𝐴 → 0 ≤ 0)
197		iffalse 4475	. . . . . . . . . 10 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) = 0)
198	196, 197, 119	3brtr4d 5117	. . . . . . . . 9 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) ≤ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
199	194, 198	pm2.61d1 180	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) ≤ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
200	2, 199	eqbrtrid 5120	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ≤ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
201	200	ralrimivw 3133	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → ∀𝑥 ∈ ℝ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ≤ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
202	55	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → ℝ ∈ V)
203		eqidd 2737	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)))
204		eqidd 2737	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)))
205	202, 36, 140, 203, 204	ofrfval2 7652	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → ((𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)) ∘_r ≤ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)) ↔ ∀𝑥 ∈ ℝ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ≤ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)))
206	201, 205	mpbird 257	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)) ∘_r ≤ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)))
207		itg2le 25706	. . . . 5 ⊢ (((𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)):ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)):ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)) ∘_r ≤ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))) → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))) ≤ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))))
208	37, 141, 206, 207	syl3anc 1374	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))) ≤ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))))
209		itg2lecl 25705	. . . 4 ⊢ (((𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)):ℝ⟶(0[,]+∞) ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))) ∈ ℝ ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))) ≤ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)))) → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))) ∈ ℝ)
210	37, 130, 208, 209	syl3anc 1374	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))) ∈ ℝ)
211	210	ralrimiva 3129	. 2 ⊢ (𝜑 → ∀𝑘 ∈ (0...3)(∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))) ∈ ℝ)
212		eqidd 2737	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)))
213		eqidd 2737	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) = (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))))
214	212, 213, 10	isibl2 25733	. 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn ∧ ∀𝑘 ∈ (0...3)(∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))) ∈ ℝ)))
215	1, 211, 214	mpbir2and 714	1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ 𝐿¹)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 ∀wral 3051 Vcvv 3429 ifcif 4466 {csn 4567 class class class wbr 5085 ↦ cmpt 5166 × cxp 5629 ⟶wf 6494 ‘cfv 6498 (class class class)co 7367 ∘_f cof 7629 ∘_r cofr 7630 ℂcc 11036 ℝcr 11037 0cc0 11038 1c1 11039 ici 11040 + caddc 11041 · cmul 11043 +∞cpnf 11176 ℝ^*cxr 11178 ≤ cle 11180 / cdiv 11807 3c3 12237 ℕ₀cn0 12437 ℤcz 12524 [,)cico 13300 [,]cicc 13301 ...cfz 13461 ↑cexp 14023 ℜcre 15059 ℑcim 15060 abscabs 15196 MblFncmbf 25581 ∫₂citg2 25583 𝐿¹cibl 25584

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-inf2 9562 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 ax-addf 11117

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 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 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-disj 5053 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-isom 6507 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-of 7631 df-ofr 7632 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-2o 8406 df-er 8643 df-map 8775 df-pm 8776 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-fi 9324 df-sup 9355 df-inf 9356 df-oi 9425 df-dju 9825 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-z 12525 df-uz 12789 df-q 12899 df-rp 12943 df-xneg 13063 df-xadd 13064 df-xmul 13065 df-ioo 13302 df-ico 13304 df-icc 13305 df-fz 13462 df-fzo 13609 df-fl 13751 df-seq 13964 df-exp 14024 df-hash 14293 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-clim 15450 df-sum 15649 df-rest 17385 df-topgen 17406 df-psmet 21344 df-xmet 21345 df-met 21346 df-bl 21347 df-mopn 21348 df-top 22859 df-topon 22876 df-bases 22911 df-cmp 23352 df-ovol 25431 df-vol 25432 df-mbf 25586 df-itg1 25587 df-itg2 25588 df-ibl 25589 df-0p 25637

This theorem is referenced by: itgmulc2nclem1 38007 itgmulc2nclem2 38008 itgmulc2nc 38009 itgabsnc 38010 ftc1anclem6 38019

W3C validator