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

Theorem iblss 24008
Description: A subset of an integrable function is integrable. (Contributed by Mario Carneiro, 12-Aug-2014.)
Hypotheses
Ref Expression
iblss.1 (𝜑𝐴𝐵)
iblss.2 (𝜑𝐴 ∈ dom vol)
iblss.3 ((𝜑𝑥𝐵) → 𝐶𝑉)
iblss.4 (𝜑 → (𝑥𝐵𝐶) ∈ 𝐿1)
Assertion
Ref Expression
iblss (𝜑 → (𝑥𝐴𝐶) ∈ 𝐿1)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜑,𝑥   𝑥,𝑉
Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem iblss
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 iblss.1 . . . 4 (𝜑𝐴𝐵)
21resmptd 5702 . . 3 (𝜑 → ((𝑥𝐵𝐶) ↾ 𝐴) = (𝑥𝐴𝐶))
3 iblss.4 . . . . 5 (𝜑 → (𝑥𝐵𝐶) ∈ 𝐿1)
4 iblmbf 23971 . . . . 5 ((𝑥𝐵𝐶) ∈ 𝐿1 → (𝑥𝐵𝐶) ∈ MblFn)
53, 4syl 17 . . . 4 (𝜑 → (𝑥𝐵𝐶) ∈ MblFn)
6 iblss.2 . . . 4 (𝜑𝐴 ∈ dom vol)
7 mbfres 23848 . . . 4 (((𝑥𝐵𝐶) ∈ MblFn ∧ 𝐴 ∈ dom vol) → ((𝑥𝐵𝐶) ↾ 𝐴) ∈ MblFn)
85, 6, 7syl2anc 579 . . 3 (𝜑 → ((𝑥𝐵𝐶) ↾ 𝐴) ∈ MblFn)
92, 8eqeltrrd 2860 . 2 (𝜑 → (𝑥𝐴𝐶) ∈ MblFn)
10 ifan 4358 . . . . . 6 if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0) = if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0)
11 simpll 757 . . . . . . . . 9 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) → 𝜑)
121sselda 3821 . . . . . . . . 9 ((𝜑𝑥𝐴) → 𝑥𝐵)
1311, 12sylan 575 . . . . . . . 8 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐴) → 𝑥𝐵)
14 iblss.3 . . . . . . . . . . . . . . 15 ((𝜑𝑥𝐵) → 𝐶𝑉)
155, 14mbfmptcl 23840 . . . . . . . . . . . . . 14 ((𝜑𝑥𝐵) → 𝐶 ∈ ℂ)
1611, 15sylan 575 . . . . . . . . . . . . 13 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐵) → 𝐶 ∈ ℂ)
17 elfzelz 12659 . . . . . . . . . . . . . . 15 (𝑘 ∈ (0...3) → 𝑘 ∈ ℤ)
1817ad3antlr 721 . . . . . . . . . . . . . 14 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐵) → 𝑘 ∈ ℤ)
19 ax-icn 10331 . . . . . . . . . . . . . . 15 i ∈ ℂ
20 ine0 10810 . . . . . . . . . . . . . . 15 i ≠ 0
21 expclz 13203 . . . . . . . . . . . . . . 15 ((i ∈ ℂ ∧ i ≠ 0 ∧ 𝑘 ∈ ℤ) → (i↑𝑘) ∈ ℂ)
2219, 20, 21mp3an12 1524 . . . . . . . . . . . . . 14 (𝑘 ∈ ℤ → (i↑𝑘) ∈ ℂ)
2318, 22syl 17 . . . . . . . . . . . . 13 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐵) → (i↑𝑘) ∈ ℂ)
24 expne0i 13210 . . . . . . . . . . . . . . 15 ((i ∈ ℂ ∧ i ≠ 0 ∧ 𝑘 ∈ ℤ) → (i↑𝑘) ≠ 0)
2519, 20, 24mp3an12 1524 . . . . . . . . . . . . . 14 (𝑘 ∈ ℤ → (i↑𝑘) ≠ 0)
2618, 25syl 17 . . . . . . . . . . . . 13 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐵) → (i↑𝑘) ≠ 0)
2716, 23, 26divcld 11151 . . . . . . . . . . . 12 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐵) → (𝐶 / (i↑𝑘)) ∈ ℂ)
2827recld 14341 . . . . . . . . . . 11 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐵) → (ℜ‘(𝐶 / (i↑𝑘))) ∈ ℝ)
29 0re 10378 . . . . . . . . . . 11 0 ∈ ℝ
30 ifcl 4351 . . . . . . . . . . 11 (((ℜ‘(𝐶 / (i↑𝑘))) ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ∈ ℝ)
3128, 29, 30sylancl 580 . . . . . . . . . 10 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐵) → if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ∈ ℝ)
3231rexrd 10426 . . . . . . . . 9 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐵) → if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ∈ ℝ*)
33 max1 12328 . . . . . . . . . 10 ((0 ∈ ℝ ∧ (ℜ‘(𝐶 / (i↑𝑘))) ∈ ℝ) → 0 ≤ if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0))
3429, 28, 33sylancr 581 . . . . . . . . 9 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐵) → 0 ≤ if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0))
35 elxrge0 12595 . . . . . . . . 9 (if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ∈ (0[,]+∞) ↔ (if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ∈ ℝ* ∧ 0 ≤ if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0)))
3632, 34, 35sylanbrc 578 . . . . . . . 8 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐵) → if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ∈ (0[,]+∞))
3713, 36syldan 585 . . . . . . 7 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐴) → if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ∈ (0[,]+∞))
38 0e0iccpnf 12597 . . . . . . . 8 0 ∈ (0[,]+∞)
3938a1i 11 . . . . . . 7 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ ¬ 𝑥𝐴) → 0 ∈ (0[,]+∞))
4037, 39ifclda 4341 . . . . . 6 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) → if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) ∈ (0[,]+∞))
4110, 40syl5eqel 2863 . . . . 5 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) → if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ∈ (0[,]+∞))
4241fmpttd 6649 . . . 4 ((𝜑𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)):ℝ⟶(0[,]+∞))
43 eqidd 2779 . . . . . 6 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)))
44 eqidd 2779 . . . . . 6 ((𝜑𝑥𝐵) → (ℜ‘(𝐶 / (i↑𝑘))) = (ℜ‘(𝐶 / (i↑𝑘))))
4543, 44, 3, 14iblitg 23972 . . . . 5 ((𝜑𝑘 ∈ ℤ) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ)
4617, 45sylan2 586 . . . 4 ((𝜑𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ)
47 ifan 4358 . . . . . . 7 if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0) = if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0)
4838a1i 11 . . . . . . . 8 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ ¬ 𝑥𝐵) → 0 ∈ (0[,]+∞))
4936, 48ifclda 4341 . . . . . . 7 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) → if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) ∈ (0[,]+∞))
5047, 49syl5eqel 2863 . . . . . 6 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) → if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ∈ (0[,]+∞))
5150fmpttd 6649 . . . . 5 ((𝜑𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)):ℝ⟶(0[,]+∞))
5231leidd 10941 . . . . . . . . . . 11 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐵) → if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ≤ if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0))
53 breq1 4889 . . . . . . . . . . . 12 (if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0) = if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) → (if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ≤ if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ↔ if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) ≤ if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0)))
54 breq1 4889 . . . . . . . . . . . 12 (0 = if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) → (0 ≤ if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ↔ if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) ≤ if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0)))
5553, 54ifboth 4345 . . . . . . . . . . 11 ((if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ≤ if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ∧ 0 ≤ if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0)) → if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) ≤ if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0))
5652, 34, 55syl2anc 579 . . . . . . . . . 10 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐵) → if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) ≤ if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0))
57 iftrue 4313 . . . . . . . . . . 11 (𝑥𝐵 → if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) = if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0))
5857adantl 475 . . . . . . . . . 10 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐵) → if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) = if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0))
5956, 58breqtrrd 4914 . . . . . . . . 9 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ 𝑥𝐵) → if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) ≤ if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0))
60 0le0 11483 . . . . . . . . . . 11 0 ≤ 0
6160a1i 11 . . . . . . . . . 10 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ ¬ 𝑥𝐵) → 0 ≤ 0)
6213stoic1a 1816 . . . . . . . . . . 11 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ ¬ 𝑥𝐵) → ¬ 𝑥𝐴)
63 iffalse 4316 . . . . . . . . . . 11 𝑥𝐴 → if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) = 0)
6462, 63syl 17 . . . . . . . . . 10 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ ¬ 𝑥𝐵) → if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) = 0)
65 iffalse 4316 . . . . . . . . . . 11 𝑥𝐵 → if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) = 0)
6665adantl 475 . . . . . . . . . 10 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ ¬ 𝑥𝐵) → if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) = 0)
6761, 64, 663brtr4d 4918 . . . . . . . . 9 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) ∧ ¬ 𝑥𝐵) → if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) ≤ if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0))
6859, 67pm2.61dan 803 . . . . . . . 8 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) → if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) ≤ if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0))
6968, 10, 473brtr4g 4920 . . . . . . 7 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥 ∈ ℝ) → if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ≤ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))
7069ralrimiva 3148 . . . . . 6 ((𝜑𝑘 ∈ (0...3)) → ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ≤ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))
71 reex 10363 . . . . . . . 8 ℝ ∈ V
7271a1i 11 . . . . . . 7 ((𝜑𝑘 ∈ (0...3)) → ℝ ∈ V)
73 eqidd 2779 . . . . . . 7 ((𝜑𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)))
74 eqidd 2779 . . . . . . 7 ((𝜑𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)))
7572, 41, 50, 73, 74ofrfval2 7192 . . . . . 6 ((𝜑𝑘 ∈ (0...3)) → ((𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)) ∘𝑟 ≤ (𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)) ↔ ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ≤ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)))
7670, 75mpbird 249 . . . . 5 ((𝜑𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)) ∘𝑟 ≤ (𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)))
77 itg2le 23943 . . . . 5 (((𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)):ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)):ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)) ∘𝑟 ≤ (𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ≤ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))))
7842, 51, 76, 77syl3anc 1439 . . . 4 ((𝜑𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ≤ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))))
79 itg2lecl 23942 . . . 4 (((𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)):ℝ⟶(0[,]+∞) ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ≤ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)))) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ)
8042, 46, 78, 79syl3anc 1439 . . 3 ((𝜑𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ)
8180ralrimiva 3148 . 2 (𝜑 → ∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ)
82 eqidd 2779 . . 3 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)))
83 eqidd 2779 . . 3 ((𝜑𝑥𝐴) → (ℜ‘(𝐶 / (i↑𝑘))) = (ℜ‘(𝐶 / (i↑𝑘))))
8412, 15syldan 585 . . 3 ((𝜑𝑥𝐴) → 𝐶 ∈ ℂ)
8582, 83, 84isibl2 23970 . 2 (𝜑 → ((𝑥𝐴𝐶) ∈ 𝐿1 ↔ ((𝑥𝐴𝐶) ∈ MblFn ∧ ∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ)))
869, 81, 85mpbir2and 703 1 (𝜑 → (𝑥𝐴𝐶) ∈ 𝐿1)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 386   = wceq 1601  wcel 2107  wne 2969  wral 3090  Vcvv 3398  wss 3792  ifcif 4307   class class class wbr 4886  cmpt 4965  dom cdm 5355  cres 5357  wf 6131  cfv 6135  (class class class)co 6922  𝑟 cofr 7173  cc 10270  cr 10271  0cc0 10272  ici 10274  +∞cpnf 10408  *cxr 10410  cle 10412   / cdiv 11032  3c3 11431  cz 11728  [,]cicc 12490  ...cfz 12643  cexp 13178  cre 14244  volcvol 23667  MblFncmbf 23818  2citg2 23820  𝐿1cibl 23821
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-8 2109  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754  ax-rep 5006  ax-sep 5017  ax-nul 5025  ax-pow 5077  ax-pr 5138  ax-un 7226  ax-inf2 8835  ax-cnex 10328  ax-resscn 10329  ax-1cn 10330  ax-icn 10331  ax-addcl 10332  ax-addrcl 10333  ax-mulcl 10334  ax-mulrcl 10335  ax-mulcom 10336  ax-addass 10337  ax-mulass 10338  ax-distr 10339  ax-i2m1 10340  ax-1ne0 10341  ax-1rid 10342  ax-rnegex 10343  ax-rrecex 10344  ax-cnre 10345  ax-pre-lttri 10346  ax-pre-lttrn 10347  ax-pre-ltadd 10348  ax-pre-mulgt0 10349  ax-pre-sup 10350
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3or 1072  df-3an 1073  df-tru 1605  df-fal 1615  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2551  df-eu 2587  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ne 2970  df-nel 3076  df-ral 3095  df-rex 3096  df-reu 3097  df-rmo 3098  df-rab 3099  df-v 3400  df-sbc 3653  df-csb 3752  df-dif 3795  df-un 3797  df-in 3799  df-ss 3806  df-pss 3808  df-nul 4142  df-if 4308  df-pw 4381  df-sn 4399  df-pr 4401  df-tp 4403  df-op 4405  df-uni 4672  df-int 4711  df-iun 4755  df-br 4887  df-opab 4949  df-mpt 4966  df-tr 4988  df-id 5261  df-eprel 5266  df-po 5274  df-so 5275  df-fr 5314  df-se 5315  df-we 5316  df-xp 5361  df-rel 5362  df-cnv 5363  df-co 5364  df-dm 5365  df-rn 5366  df-res 5367  df-ima 5368  df-pred 5933  df-ord 5979  df-on 5980  df-lim 5981  df-suc 5982  df-iota 6099  df-fun 6137  df-fn 6138  df-f 6139  df-f1 6140  df-fo 6141  df-f1o 6142  df-fv 6143  df-isom 6144  df-riota 6883  df-ov 6925  df-oprab 6926  df-mpt2 6927  df-of 7174  df-ofr 7175  df-om 7344  df-1st 7445  df-2nd 7446  df-wrecs 7689  df-recs 7751  df-rdg 7789  df-1o 7843  df-2o 7844  df-oadd 7847  df-er 8026  df-map 8142  df-pm 8143  df-en 8242  df-dom 8243  df-sdom 8244  df-fin 8245  df-sup 8636  df-inf 8637  df-oi 8704  df-card 9098  df-cda 9325  df-pnf 10413  df-mnf 10414  df-xr 10415  df-ltxr 10416  df-le 10417  df-sub 10608  df-neg 10609  df-div 11033  df-nn 11375  df-2 11438  df-3 11439  df-4 11440  df-n0 11643  df-z 11729  df-uz 11993  df-q 12096  df-rp 12138  df-xadd 12258  df-ioo 12491  df-ico 12493  df-icc 12494  df-fz 12644  df-fzo 12785  df-fl 12912  df-mod 12988  df-seq 13120  df-exp 13179  df-hash 13436  df-cj 14246  df-re 14247  df-im 14248  df-sqrt 14382  df-abs 14383  df-clim 14627  df-sum 14825  df-xmet 20135  df-met 20136  df-ovol 23668  df-vol 23669  df-mbf 23823  df-itg1 23824  df-itg2 23825  df-ibl 23826
This theorem is referenced by:  itgss3  24018  itgless  24020  bddmulibl  24042  itgcn  24046  ditgcl  24059  ditgswap  24060  ditgsplitlem  24061  ftc1lem1  24235  ftc1lem2  24236  ftc1a  24237  ftc1lem4  24239  ftc2  24244  ftc2ditglem  24245  itgsubstlem  24248  fdvposlt  31279  fdvposle  31281  circlemeth  31320  ftc1cnnclem  34110  ftc1anc  34120  ftc2nc  34121  areacirc  34132  itgpowd  38762  lhe4.4ex1a  39488  itgsin0pilem1  41097  iblioosinexp  41100  itgsinexplem1  41101  itgsinexp  41102  itgcoscmulx  41116  itgsincmulx  41121  iblcncfioo  41125  dirkeritg  41250  fourierdlem87  41341  fourierdlem95  41349  fourierdlem103  41357  fourierdlem104  41358  fourierdlem107  41361  fourierdlem111  41365  fourierdlem112  41366  sqwvfoura  41376  sqwvfourb  41377  etransclem18  41400
  Copyright terms: Public domain W3C validator