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 38746

Description: Choice-free analogue of iblmulc2 26166. (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 4539	. . . . . 6 ⊢ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) = if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0)
3		itgmulc2nc.1	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐶 ∈ ℂ)
4	3	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℂ)
5		itgmulc2nc.3	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)
6		iblmbf 26103	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
7	5, 6	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
8		itgmulc2nc.2	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
9	7, 8	mbfmptcl 25972	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
10	4, 9	mulcld 11342	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 · 𝐵) ∈ ℂ)
11	10	adantlr 728	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (𝐶 · 𝐵) ∈ ℂ)
12		elfzelz 13669	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (0...3) → 𝑘 ∈ ℤ)
13	12	ad2antlr 740	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → 𝑘 ∈ ℤ)
14		ax-icn 11272	. . . . . . . . . . . . . . 15 ⊢ i ∈ ℂ
15		ine0 11764	. . . . . . . . . . . . . . 15 ⊢ i ≠ 0
16		expclz 14240	. . . . . . . . . . . . . . 15 ⊢ ((i ∈ ℂ ∧ i ≠ 0 ∧ 𝑘 ∈ ℤ) → (i↑𝑘) ∈ ℂ)
17	14, 15, 16	mp3an12 1480	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℤ → (i↑𝑘) ∈ ℂ)
18	13, 17	syl 18	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (i↑𝑘) ∈ ℂ)
19		expne0i 14250	. . . . . . . . . . . . . . 15 ⊢ ((i ∈ ℂ ∧ i ≠ 0 ∧ 𝑘 ∈ ℤ) → (i↑𝑘) ≠ 0)
20	14, 15, 19	mp3an12 1480	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℤ → (i↑𝑘) ≠ 0)
21	13, 20	syl 18	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (i↑𝑘) ≠ 0)
22	11, 18, 21	divcld 12106	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → ((𝐶 · 𝐵) / (i↑𝑘)) ∈ ℂ)
23	22	recld 15376	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ∈ ℝ)
24		0re 11323	. . . . . . . . . . 11 ⊢ 0 ∈ ℝ
25		ifcl 4531	. . . . . . . . . . 11 ⊢ (((ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ∈ ℝ)
26	23, 24, 25	sylancl 598	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ∈ ℝ)
27	26	rexrd 11372	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ∈ ℝ^*)
28		max1 13328	. . . . . . . . . 10 ⊢ ((0 ∈ ℝ ∧ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ∈ ℝ) → 0 ≤ if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))
29	24, 23, 28	sylancr 599	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))
30		elxrge0 13601	. . . . . . . . 9 ⊢ (if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ∈ (0[,]+∞) ↔ (if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ∈ ℝ^* ∧ 0 ≤ if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)))
31	27, 29, 30	sylanbrc 595	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ∈ (0[,]+∞))
32		0e0iccpnf 13603	. . . . . . . . 9 ⊢ 0 ∈ (0[,]+∞)
33	32	a1i 11	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,]+∞))
34	31, 33	ifclda 4521	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) ∈ (0[,]+∞))
35	34	adantr 486	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) ∈ (0[,]+∞))
36	2, 35	eqeltrid 2868	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) → if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ∈ (0[,]+∞))
37	36	fmpttd 7126	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)):ℝ⟶(0[,]+∞))
38	9	recld 15376	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘𝐵) ∈ ℝ)
39	38	recnd 11350	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘𝐵) ∈ ℂ)
40	39	abscld 15621	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(ℜ‘𝐵)) ∈ ℝ)
41	9	imcld 15377	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘𝐵) ∈ ℝ)
42	41	recnd 11350	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘𝐵) ∈ ℂ)
43	42	abscld 15621	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(ℑ‘𝐵)) ∈ ℝ)
44	40, 43	readdcld 11351	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))) ∈ ℝ)
45	39	absge0d 15629	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (abs‘(ℜ‘𝐵)))
46	42	absge0d 15629	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (abs‘(ℑ‘𝐵)))
47	40, 43, 45, 46	addge0d 11905	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))
48		elrege0 13598	. . . . . . . . . . . 12 ⊢ (((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))) ∈ (0[,)+∞) ↔ (((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))) ∈ ℝ ∧ 0 ≤ ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
49	44, 47, 48	sylanbrc 595	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))) ∈ (0[,)+∞))
50		0e0icopnf 13602	. . . . . . . . . . . 12 ⊢ 0 ∈ (0[,)+∞)
51	50	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,)+∞))
52	49, 51	ifclda 4521	. . . . . . . . . 10 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0) ∈ (0[,)+∞))
53	52	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0) ∈ (0[,)+∞))
54	53	fmpttd 7126	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)):ℝ⟶(0[,)+∞))
55		reex 11304	. . . . . . . . . . . . . 14 ⊢ ℝ ∈ V
56	55	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → ℝ ∈ V)
57		elrege0 13598	. . . . . . . . . . . . . . . 16 ⊢ ((abs‘(ℜ‘𝐵)) ∈ (0[,)+∞) ↔ ((abs‘(ℜ‘𝐵)) ∈ ℝ ∧ 0 ≤ (abs‘(ℜ‘𝐵))))
58	40, 45, 57	sylanbrc 595	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(ℜ‘𝐵)) ∈ (0[,)+∞))
59	58, 51	ifclda 4521	. . . . . . . . . . . . . 14 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) ∈ (0[,)+∞))
60	59	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) ∈ (0[,)+∞))
61		elrege0 13598	. . . . . . . . . . . . . . . 16 ⊢ ((abs‘(ℑ‘𝐵)) ∈ (0[,)+∞) ↔ ((abs‘(ℑ‘𝐵)) ∈ ℝ ∧ 0 ≤ (abs‘(ℑ‘𝐵))))
62	43, 46, 61	sylanbrc 595	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(ℑ‘𝐵)) ∈ (0[,)+∞))
63	62, 51	ifclda 4521	. . . . . . . . . . . . . 14 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0) ∈ (0[,)+∞))
64	63	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0) ∈ (0[,)+∞))
65		eqidd 2764	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)))
66		eqidd 2764	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)))
67	56, 60, 64, 65, 66	offval2 7723	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) ∘_f + (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))) = (𝑥 ∈ ℝ ↦ (if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) + if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))))
68		iftrue 4491	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) = (abs‘(ℜ‘𝐵)))
69		iftrue 4491	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0) = (abs‘(ℑ‘𝐵)))
70	68, 69	oveq12d 7448	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝐴 → (if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) + if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) = ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))
71		iftrue 4491	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0) = ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))
72	70, 71	eqtr4d 2801	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝐴 → (if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) + if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) = if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))
73		00id 11498	. . . . . . . . . . . . . . 15 ⊢ (0 + 0) = 0
74		iffalse 4494	. . . . . . . . . . . . . . . 16 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) = 0)
75		iffalse 4494	. . . . . . . . . . . . . . . 16 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0) = 0)
76	74, 75	oveq12d 7448	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝑥 ∈ 𝐴 → (if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) + if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) = (0 + 0))
77		iffalse 4494	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0) = 0)
78	73, 76, 77	3eqtr4a 2824	. . . . . . . . . . . . . 14 ⊢ (¬ 𝑥 ∈ 𝐴 → (if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) + if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) = if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))
79	72, 78	pm2.61i 184	. . . . . . . . . . . . 13 ⊢ (if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) + if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) = if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)
80	79	mpteq2i 5204	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℝ ↦ (if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0) + if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))
81	67, 80	eqtr2di 2815	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) ∘_f + (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))))
82	81	fveq2d 6900	. . . . . . . . . 10 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))) = (∫₂‘((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) ∘_f + (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)))))
83		eqid 2763	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))
84	9	iblcn 26134	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿¹)))
85	5, 84	mpbid 235	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿¹))
86	85	simpld 500	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿¹)
87	8, 5, 83, 86, 38	iblabsnclem 38744	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) ∈ ℝ))
88	87	simpld 500	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) ∈ MblFn)
89	60	fmpttd 7126	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)):ℝ⟶(0[,)+∞))
90	87	simprd 501	. . . . . . . . . . 11 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) ∈ ℝ)
91	64	fmpttd 7126	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)):ℝ⟶(0[,)+∞))
92		eqid 2763	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))
93	85	simprd 501	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿¹)
94	8, 5, 92, 93, 41	iblabsnclem 38744	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))) ∈ ℝ))
95	94	simprd 501	. . . . . . . . . . 11 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))) ∈ ℝ)
96	88, 89, 90, 91, 95	itg2addnc 38735	. . . . . . . . . 10 ⊢ (𝜑 → (∫₂‘((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0)) ∘_f + (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)))) = ((∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) + (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)))))
97	82, 96	eqtrd 2798	. . . . . . . . 9 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))) = ((∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) + (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)))))
98	90, 95	readdcld 11351	. . . . . . . . 9 ⊢ (𝜑 → ((∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) + (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0)))) ∈ ℝ)
99	97, 98	eqeltrd 2864	. . . . . . . 8 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))) ∈ ℝ)
100	3	abscld 15621	. . . . . . . . 9 ⊢ (𝜑 → (abs‘𝐶) ∈ ℝ)
101	3	absge0d 15629	. . . . . . . . 9 ⊢ (𝜑 → 0 ≤ (abs‘𝐶))
102		elrege0 13598	. . . . . . . . 9 ⊢ ((abs‘𝐶) ∈ (0[,)+∞) ↔ ((abs‘𝐶) ∈ ℝ ∧ 0 ≤ (abs‘𝐶)))
103	100, 101, 102	sylanbrc 595	. . . . . . . 8 ⊢ (𝜑 → (abs‘𝐶) ∈ (0[,)+∞))
104	54, 99, 103	itg2mulc 26083	. . . . . . 7 ⊢ (𝜑 → (∫₂‘((ℝ × {(abs‘𝐶)}) ∘_f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)))) = ((abs‘𝐶) · (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)))))
105	100	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (abs‘𝐶) ∈ ℝ)
106		fconstmpt 5717	. . . . . . . . . . 11 ⊢ (ℝ × {(abs‘𝐶)}) = (𝑥 ∈ ℝ ↦ (abs‘𝐶))
107	106	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ × {(abs‘𝐶)}) = (𝑥 ∈ ℝ ↦ (abs‘𝐶)))
108		eqidd 2764	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)))
109	56, 105, 53, 107, 108	offval2 7723	. . . . . . . . 9 ⊢ (𝜑 → ((ℝ × {(abs‘𝐶)}) ∘_f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))) = (𝑥 ∈ ℝ ↦ ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))))
110	71	oveq2d 7446	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝐴 → ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
111		iftrue 4491	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0) = ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
112	110, 111	eqtr4d 2801	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝐴 → ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
113	112	adantl 487	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
114	100	recnd 11350	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (abs‘𝐶) ∈ ℂ)
115	114	mul01d 11522	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((abs‘𝐶) · 0) = 0)
116	115	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · 0) = 0)
117	77	adantl 487	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0) = 0)
118	117	oveq2d 7446	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = ((abs‘𝐶) · 0))
119		iffalse 4494	. . . . . . . . . . . . 13 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0) = 0)
120	119	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0) = 0)
121	116, 118, 120	3eqtr4d 2808	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
122	113, 121	pm2.61dan 825	. . . . . . . . . 10 ⊢ (𝜑 → ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)) = if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
123	122	mpteq2dv 5202	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ ((abs‘𝐶) · if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)))
124	109, 123	eqtrd 2798	. . . . . . . 8 ⊢ (𝜑 → ((ℝ × {(abs‘𝐶)}) ∘_f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)))
125	124	fveq2d 6900	. . . . . . 7 ⊢ (𝜑 → (∫₂‘((ℝ × {(abs‘𝐶)}) ∘_f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)))) = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))))
126	97	oveq2d 7446	. . . . . . 7 ⊢ (𝜑 → ((abs‘𝐶) · (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))), 0)))) = ((abs‘𝐶) · ((∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) + (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))))))
127	104, 125, 126	3eqtr3d 2806	. . . . . 6 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))) = ((abs‘𝐶) · ((∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) + (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))))))
128	100, 98	remulcld 11352	. . . . . 6 ⊢ (𝜑 → ((abs‘𝐶) · ((∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℜ‘𝐵)), 0))) + (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(ℑ‘𝐵)), 0))))) ∈ ℝ)
129	127, 128	eqeltrd 2864	. . . . 5 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))) ∈ ℝ)
130	129	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))) ∈ ℝ)
131	100	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐶) ∈ ℝ)
132	131, 44	remulcld 11352	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ∈ ℝ)
133	132	rexrd 11372	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ∈ ℝ^*)
134	101	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (abs‘𝐶))
135	131, 44, 134, 47	mulge0d 11906	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
136		elxrge0 13601	. . . . . . . . 9 ⊢ (((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ∈ (0[,]+∞) ↔ (((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ∈ ℝ^* ∧ 0 ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))))
137	133, 135, 136	sylanbrc 595	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ∈ (0[,]+∞))
138	32	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,]+∞))
139	137, 138	ifclda 4521	. . . . . . 7 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0) ∈ (0[,]+∞))
140	139	ad2antrr 739	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0) ∈ (0[,]+∞))
141	140	fmpttd 7126	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)):ℝ⟶(0[,]+∞))
142	9	abscld 15621	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ ℝ)
143	131, 142	remulcld 11352	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · (abs‘𝐵)) ∈ ℝ)
144	143	adantlr 728	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · (abs‘𝐵)) ∈ ℝ)
145	132	adantlr 728	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ∈ ℝ)
146	22	releabsd 15636	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ≤ (abs‘((𝐶 · 𝐵) / (i↑𝑘))))
147	11, 18, 21	absdivd 15640	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (abs‘((𝐶 · 𝐵) / (i↑𝑘))) = ((abs‘(𝐶 · 𝐵)) / (abs‘(i↑𝑘))))
148		elfznn0 13767	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ (0...3) → 𝑘 ∈ ℕ₀)
149		absexp 15486	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((i ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (abs‘(i↑𝑘)) = ((abs‘i)↑𝑘))
150	14, 148, 149	sylancr 599	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (0...3) → (abs‘(i↑𝑘)) = ((abs‘i)↑𝑘))
151		absi 15468	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (abs‘i) = 1
152	151	oveq1i 7440	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((abs‘i)↑𝑘) = (1↑𝑘)
153		1exp 14247	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑘 ∈ ℤ → (1↑𝑘) = 1)
154	12, 153	syl 18	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ (0...3) → (1↑𝑘) = 1)
155	152, 154	eqtrid 2810	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (0...3) → ((abs‘i)↑𝑘) = 1)
156	150, 155	eqtrd 2798	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ (0...3) → (abs‘(i↑𝑘)) = 1)
157	156	oveq2d 7446	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (0...3) → ((abs‘(𝐶 · 𝐵)) / (abs‘(i↑𝑘))) = ((abs‘(𝐶 · 𝐵)) / 1))
158	157	ad2antlr 740	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → ((abs‘(𝐶 · 𝐵)) / (abs‘(i↑𝑘))) = ((abs‘(𝐶 · 𝐵)) / 1))
159	10	abscld 15621	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(𝐶 · 𝐵)) ∈ ℝ)
160	159	recnd 11350	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(𝐶 · 𝐵)) ∈ ℂ)
161	160	adantlr 728	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (abs‘(𝐶 · 𝐵)) ∈ ℂ)
162	161	div1d 12098	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → ((abs‘(𝐶 · 𝐵)) / 1) = (abs‘(𝐶 · 𝐵)))
163	147, 158, 162	3eqtrd 2802	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (abs‘((𝐶 · 𝐵) / (i↑𝑘))) = (abs‘(𝐶 · 𝐵)))
164	4, 9	absmuld 15639	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(𝐶 · 𝐵)) = ((abs‘𝐶) · (abs‘𝐵)))
165	164	adantlr 728	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (abs‘(𝐶 · 𝐵)) = ((abs‘𝐶) · (abs‘𝐵)))
166	163, 165	eqtrd 2798	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (abs‘((𝐶 · 𝐵) / (i↑𝑘))) = ((abs‘𝐶) · (abs‘𝐵)))
167	146, 166	breqtrd 5134	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ≤ ((abs‘𝐶) · (abs‘𝐵)))
168		mulcl 11297	. . . . . . . . . . . . . . . . . 18 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐵) ∈ ℂ) → (i · (ℑ‘𝐵)) ∈ ℂ)
169	14, 42, 168	sylancr 599	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (i · (ℑ‘𝐵)) ∈ ℂ)
170	39, 169	abstrid 15641	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘((ℜ‘𝐵) + (i · (ℑ‘𝐵)))) ≤ ((abs‘(ℜ‘𝐵)) + (abs‘(i · (ℑ‘𝐵)))))
171	9	replimd 15379	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = ((ℜ‘𝐵) + (i · (ℑ‘𝐵))))
172	171	fveq2d 6900	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) = (abs‘((ℜ‘𝐵) + (i · (ℑ‘𝐵)))))
173		absmul 15476	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐵) ∈ ℂ) → (abs‘(i · (ℑ‘𝐵))) = ((abs‘i) · (abs‘(ℑ‘𝐵))))
174	14, 42, 173	sylancr 599	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(i · (ℑ‘𝐵))) = ((abs‘i) · (abs‘(ℑ‘𝐵))))
175	151	oveq1i 7440	. . . . . . . . . . . . . . . . . . 19 ⊢ ((abs‘i) · (abs‘(ℑ‘𝐵))) = (1 · (abs‘(ℑ‘𝐵)))
176	174, 175	eqtrdi 2814	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(i · (ℑ‘𝐵))) = (1 · (abs‘(ℑ‘𝐵))))
177	43	recnd 11350	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(ℑ‘𝐵)) ∈ ℂ)
178	177	mullidd 11340	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (1 · (abs‘(ℑ‘𝐵))) = (abs‘(ℑ‘𝐵)))
179	176, 178	eqtr2d 2799	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(ℑ‘𝐵)) = (abs‘(i · (ℑ‘𝐵))))
180	179	oveq2d 7446	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))) = ((abs‘(ℜ‘𝐵)) + (abs‘(i · (ℑ‘𝐵)))))
181	170, 172, 180	3brtr4d 5140	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ≤ ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))
182	142, 44, 131, 134, 181	lemul2ad 12270	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · (abs‘𝐵)) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
183	182	adantlr 728	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → ((abs‘𝐶) · (abs‘𝐵)) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
184	23, 144, 145, 167, 183	letrd 11480	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
185	135	adantlr 728	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → 0 ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
186		breq1 5109	. . . . . . . . . . . . 13 ⊢ ((ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) = if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) → ((ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ↔ if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))))
187		breq1 5109	. . . . . . . . . . . . 13 ⊢ (0 = if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) → (0 ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ↔ if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))))
188	186, 187	ifboth 4525	. . . . . . . . . . . 12 ⊢ (((ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))) ∧ 0 ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵))))) → if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
189	184, 185, 188	syl2anc 596	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ≤ ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
190		iftrue 4491	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) = if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))
191	190	adantl 487	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) = if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))
192	111	adantl 487	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0) = ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))))
193	189, 191, 192	3brtr4d 5140	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...3)) ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) ≤ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
194	193	ex 418	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) ≤ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)))
195		0le0 12457	. . . . . . . . . . 11 ⊢ 0 ≤ 0
196	195	a1i 11	. . . . . . . . . 10 ⊢ (¬ 𝑥 ∈ 𝐴 → 0 ≤ 0)
197		iffalse 4494	. . . . . . . . . 10 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) = 0)
198	196, 197, 119	3brtr4d 5140	. . . . . . . . 9 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) ≤ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
199	194, 198	pm2.61d1 182	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → if(𝑥 ∈ 𝐴, if(0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0), 0) ≤ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
200	2, 199	eqbrtrid 5143	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ≤ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
201	200	ralrimivw 3162	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → ∀𝑥 ∈ ℝ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0) ≤ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))
202	55	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → ℝ ∈ V)
203		eqidd 2764	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)))
204		eqidd 2764	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)))
205	202, 36, 140, 203, 204	ofrfval2 7724	. . . . . 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 260	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)) ∘_r ≤ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0)))
207		itg2le 26075	. . . . 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 1398	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))) ≤ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, ((abs‘𝐶) · ((abs‘(ℜ‘𝐵)) + (abs‘(ℑ‘𝐵)))), 0))))
209		itg2lecl 26074	. . . 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 1398	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))) ∈ ℝ)
211	210	ralrimiva 3158	. 2 ⊢ (𝜑 → ∀𝑘 ∈ (0...3)(∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))) ∈ ℝ)
212		eqidd 2764	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0)))
213		eqidd 2764	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))) = (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))))
214	212, 213, 10	isibl2 26102	. 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn ∧ ∀𝑘 ∈ (0...3)(∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐶 · 𝐵) / (i↑𝑘)))), (ℜ‘((𝐶 · 𝐵) / (i↑𝑘))), 0))) ∈ ℝ)))
215	1, 211, 214	mpbir2and 726	1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ 𝐿¹)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2146 ≠ wne 2959 ∀wral 3080 Vcvv 3454 ifcif 4485 {csn 4588 class class class wbr 5106 ↦ cmpt 5189 × cxp 5653 ⟶wf 6543 ‘cfv 6547 (class class class)co 7430 ∘_f cof 7701 ∘_r cofr 7702 ℂcc 11211 ℝcr 11212 0cc0 11213 1c1 11214 ici 11215 + caddc 11216 · cmul 11218 +∞cpnf 11353 ℝ^*cxr 11355 ≤ cle 11357 / cdiv 11986 3c3 12411 ℕ₀cn0 12619 ℤcz 12706 [,)cico 13491 [,]cicc 13492 ...cfz 13652 ↑cexp 14217 ℜcre 15279 ℑcim 15280 abscabs 15416 MblFncmbf 25950 ∫₂citg2 25952 𝐿¹cibl 25953

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7761 ax-inf2 9655 ax-cnex 11269 ax-resscn 11270 ax-1cn 11271 ax-icn 11272 ax-addcl 11273 ax-addrcl 11274 ax-mulcl 11275 ax-mulrcl 11276 ax-mulcom 11277 ax-addass 11278 ax-mulass 11279 ax-distr 11280 ax-i2m1 11281 ax-1ne0 11282 ax-1rid 11283 ax-rnegex 11284 ax-rrecex 11285 ax-cnre 11286 ax-pre-lttri 11287 ax-pre-lttrn 11288 ax-pre-ltadd 11289 ax-pre-mulgt0 11290 ax-pre-sup 11291 ax-addf 11292

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-disj 5074 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6311 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6501 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-isom 6556 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-of 7703 df-ofr 7704 df-om 7888 df-1st 8011 df-2nd 8012 df-frecs 8313 df-wrecs 8344 df-recs 8393 df-rdg 8432 df-1o 8490 df-2o 8491 df-er 8731 df-map 8863 df-pm 8864 df-en 8988 df-dom 8989 df-sdom 8990 df-fin 8991 df-fi 9416 df-sup 9447 df-inf 9448 df-oi 9517 df-dju 9995 df-card 10033 df-pnf 11358 df-mnf 11359 df-xr 11360 df-ltxr 11361 df-le 11362 df-sub 11556 df-neg 11557 df-div 11987 df-nn 12349 df-2 12418 df-3 12419 df-n0 12620 df-z 12707 df-uz 12979 df-q 13089 df-rp 13134 df-xneg 13254 df-xadd 13255 df-xmul 13256 df-ioo 13493 df-ico 13495 df-icc 13496 df-fz 13653 df-fzo 13802 df-fl 13945 df-seq 14158 df-exp 14218 df-hash 14488 df-cj 15281 df-re 15282 df-im 15283 df-sqrt 15417 df-abs 15418 df-clim 15670 df-sum 15869 df-rest 17608 df-topgen 17629 df-psmet 21685 df-xmet 21686 df-met 21687 df-bl 21688 df-mopn 21689 df-top 23227 df-topon 23244 df-bases 23279 df-cmp 23720 df-ovol 25800 df-vol 25801 df-mbf 25955 df-itg1 25956 df-itg2 25957 df-ibl 25958 df-0p 26006

This theorem is used by: itgmulc2nclem1 38747 itgmulc2nclem2 38748 itgmulc2nc 38749 itgabsnc 38750 ftc1anclem6 38759

W3C validator