Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iblsplit Structured version   Visualization version   GIF version

Theorem iblsplit 42601
Description: The union of two integrable functions is integrable. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
Hypotheses
Ref Expression
iblsplit.1 (𝜑 → (vol*‘(𝐴𝐵)) = 0)
iblsplit.2 (𝜑𝑈 = (𝐴𝐵))
iblsplit.3 ((𝜑𝑥𝑈) → 𝐶 ∈ ℂ)
iblsplit.4 (𝜑 → (𝑥𝐴𝐶) ∈ 𝐿1)
iblsplit.5 (𝜑 → (𝑥𝐵𝐶) ∈ 𝐿1)
Assertion
Ref Expression
iblsplit (𝜑 → (𝑥𝑈𝐶) ∈ 𝐿1)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑈   𝜑,𝑥
Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem iblsplit
Dummy variables 𝑘 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 iblsplit.3 . . . 4 ((𝜑𝑥𝑈) → 𝐶 ∈ ℂ)
21fmpttd 6860 . . 3 (𝜑 → (𝑥𝑈𝐶):𝑈⟶ℂ)
3 ssun1 4102 . . . . . 6 𝐴 ⊆ (𝐴𝐵)
4 iblsplit.2 . . . . . 6 (𝜑𝑈 = (𝐴𝐵))
53, 4sseqtrrid 3971 . . . . 5 (𝜑𝐴𝑈)
65resmptd 5879 . . . 4 (𝜑 → ((𝑥𝑈𝐶) ↾ 𝐴) = (𝑥𝐴𝐶))
7 iblsplit.4 . . . . . 6 (𝜑 → (𝑥𝐴𝐶) ∈ 𝐿1)
8 eqidd 2802 . . . . . . 7 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑦)))), (ℜ‘(𝐶 / (i↑𝑦))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑦)))), (ℜ‘(𝐶 / (i↑𝑦))), 0)))
9 eqidd 2802 . . . . . . 7 ((𝜑𝑥𝐴) → (ℜ‘(𝐶 / (i↑𝑦))) = (ℜ‘(𝐶 / (i↑𝑦))))
105sseld 3917 . . . . . . . . 9 (𝜑 → (𝑥𝐴𝑥𝑈))
1110imdistani 572 . . . . . . . 8 ((𝜑𝑥𝐴) → (𝜑𝑥𝑈))
1211, 1syl 17 . . . . . . 7 ((𝜑𝑥𝐴) → 𝐶 ∈ ℂ)
138, 9, 12isibl2 24374 . . . . . 6 (𝜑 → ((𝑥𝐴𝐶) ∈ 𝐿1 ↔ ((𝑥𝐴𝐶) ∈ MblFn ∧ ∀𝑦 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑦)))), (ℜ‘(𝐶 / (i↑𝑦))), 0))) ∈ ℝ)))
147, 13mpbid 235 . . . . 5 (𝜑 → ((𝑥𝐴𝐶) ∈ MblFn ∧ ∀𝑦 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑦)))), (ℜ‘(𝐶 / (i↑𝑦))), 0))) ∈ ℝ))
1514simpld 498 . . . 4 (𝜑 → (𝑥𝐴𝐶) ∈ MblFn)
166, 15eqeltrd 2893 . . 3 (𝜑 → ((𝑥𝑈𝐶) ↾ 𝐴) ∈ MblFn)
17 ssun2 4103 . . . . . 6 𝐵 ⊆ (𝐴𝐵)
1817, 4sseqtrrid 3971 . . . . 5 (𝜑𝐵𝑈)
1918resmptd 5879 . . . 4 (𝜑 → ((𝑥𝑈𝐶) ↾ 𝐵) = (𝑥𝐵𝐶))
20 iblsplit.5 . . . . . 6 (𝜑 → (𝑥𝐵𝐶) ∈ 𝐿1)
21 eqidd 2802 . . . . . . 7 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑦)))), (ℜ‘(𝐶 / (i↑𝑦))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑦)))), (ℜ‘(𝐶 / (i↑𝑦))), 0)))
22 eqidd 2802 . . . . . . 7 ((𝜑𝑥𝐵) → (ℜ‘(𝐶 / (i↑𝑦))) = (ℜ‘(𝐶 / (i↑𝑦))))
2318sseld 3917 . . . . . . . . 9 (𝜑 → (𝑥𝐵𝑥𝑈))
2423imdistani 572 . . . . . . . 8 ((𝜑𝑥𝐵) → (𝜑𝑥𝑈))
2524, 1syl 17 . . . . . . 7 ((𝜑𝑥𝐵) → 𝐶 ∈ ℂ)
2621, 22, 25isibl2 24374 . . . . . 6 (𝜑 → ((𝑥𝐵𝐶) ∈ 𝐿1 ↔ ((𝑥𝐵𝐶) ∈ MblFn ∧ ∀𝑦 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑦)))), (ℜ‘(𝐶 / (i↑𝑦))), 0))) ∈ ℝ)))
2720, 26mpbid 235 . . . . 5 (𝜑 → ((𝑥𝐵𝐶) ∈ MblFn ∧ ∀𝑦 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑦)))), (ℜ‘(𝐶 / (i↑𝑦))), 0))) ∈ ℝ))
2827simpld 498 . . . 4 (𝜑 → (𝑥𝐵𝐶) ∈ MblFn)
2919, 28eqeltrd 2893 . . 3 (𝜑 → ((𝑥𝑈𝐶) ↾ 𝐵) ∈ MblFn)
304eqcomd 2807 . . 3 (𝜑 → (𝐴𝐵) = 𝑈)
312, 16, 29, 30mbfres2cn 42593 . 2 (𝜑 → (𝑥𝑈𝐶) ∈ MblFn)
3215, 12mbfdm2 24245 . . . . . 6 (𝜑𝐴 ∈ dom vol)
3332adantr 484 . . . . 5 ((𝜑𝑘 ∈ (0...3)) → 𝐴 ∈ dom vol)
3428, 25mbfdm2 24245 . . . . . 6 (𝜑𝐵 ∈ dom vol)
3534adantr 484 . . . . 5 ((𝜑𝑘 ∈ (0...3)) → 𝐵 ∈ dom vol)
36 iblsplit.1 . . . . . 6 (𝜑 → (vol*‘(𝐴𝐵)) = 0)
3736adantr 484 . . . . 5 ((𝜑𝑘 ∈ (0...3)) → (vol*‘(𝐴𝐵)) = 0)
384adantr 484 . . . . 5 ((𝜑𝑘 ∈ (0...3)) → 𝑈 = (𝐴𝐵))
391adantlr 714 . . . . . . . . . . 11 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥𝑈) → 𝐶 ∈ ℂ)
40 ax-icn 10589 . . . . . . . . . . . . . 14 i ∈ ℂ
4140a1i 11 . . . . . . . . . . . . 13 (𝑘 ∈ (0...3) → i ∈ ℂ)
42 elfznn0 12999 . . . . . . . . . . . . 13 (𝑘 ∈ (0...3) → 𝑘 ∈ ℕ0)
4341, 42expcld 13510 . . . . . . . . . . . 12 (𝑘 ∈ (0...3) → (i↑𝑘) ∈ ℂ)
4443ad2antlr 726 . . . . . . . . . . 11 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥𝑈) → (i↑𝑘) ∈ ℂ)
4540a1i 11 . . . . . . . . . . . 12 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥𝑈) → i ∈ ℂ)
46 ine0 11068 . . . . . . . . . . . . 13 i ≠ 0
4746a1i 11 . . . . . . . . . . . 12 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥𝑈) → i ≠ 0)
48 elfzelz 12906 . . . . . . . . . . . . 13 (𝑘 ∈ (0...3) → 𝑘 ∈ ℤ)
4948ad2antlr 726 . . . . . . . . . . . 12 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥𝑈) → 𝑘 ∈ ℤ)
5045, 47, 49expne0d 13516 . . . . . . . . . . 11 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥𝑈) → (i↑𝑘) ≠ 0)
5139, 44, 50divcld 11409 . . . . . . . . . 10 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥𝑈) → (𝐶 / (i↑𝑘)) ∈ ℂ)
5251recld 14549 . . . . . . . . 9 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥𝑈) → (ℜ‘(𝐶 / (i↑𝑘))) ∈ ℝ)
5352rexrd 10684 . . . . . . . 8 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥𝑈) → (ℜ‘(𝐶 / (i↑𝑘))) ∈ ℝ*)
5453adantr 484 . . . . . . 7 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥𝑈) ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))) → (ℜ‘(𝐶 / (i↑𝑘))) ∈ ℝ*)
55 simpr 488 . . . . . . 7 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥𝑈) ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))) → 0 ≤ (ℜ‘(𝐶 / (i↑𝑘))))
56 pnfge 12517 . . . . . . . 8 ((ℜ‘(𝐶 / (i↑𝑘))) ∈ ℝ* → (ℜ‘(𝐶 / (i↑𝑘))) ≤ +∞)
5754, 56syl 17 . . . . . . 7 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥𝑈) ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))) → (ℜ‘(𝐶 / (i↑𝑘))) ≤ +∞)
58 0xr 10681 . . . . . . . 8 0 ∈ ℝ*
59 pnfxr 10688 . . . . . . . 8 +∞ ∈ ℝ*
60 elicc1 12774 . . . . . . . 8 ((0 ∈ ℝ* ∧ +∞ ∈ ℝ*) → ((ℜ‘(𝐶 / (i↑𝑘))) ∈ (0[,]+∞) ↔ ((ℜ‘(𝐶 / (i↑𝑘))) ∈ ℝ* ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘))) ∧ (ℜ‘(𝐶 / (i↑𝑘))) ≤ +∞)))
6158, 59, 60mp2an 691 . . . . . . 7 ((ℜ‘(𝐶 / (i↑𝑘))) ∈ (0[,]+∞) ↔ ((ℜ‘(𝐶 / (i↑𝑘))) ∈ ℝ* ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘))) ∧ (ℜ‘(𝐶 / (i↑𝑘))) ≤ +∞))
6254, 55, 57, 61syl3anbrc 1340 . . . . . 6 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥𝑈) ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))) → (ℜ‘(𝐶 / (i↑𝑘))) ∈ (0[,]+∞))
63 0e0iccpnf 12841 . . . . . . 7 0 ∈ (0[,]+∞)
6463a1i 11 . . . . . 6 ((((𝜑𝑘 ∈ (0...3)) ∧ 𝑥𝑈) ∧ ¬ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))) → 0 ∈ (0[,]+∞))
6562, 64ifclda 4462 . . . . 5 (((𝜑𝑘 ∈ (0...3)) ∧ 𝑥𝑈) → if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0) ∈ (0[,]+∞))
66 eqid 2801 . . . . 5 (𝑥 ∈ ℝ ↦ if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0))
67 eqid 2801 . . . . 5 (𝑥 ∈ ℝ ↦ if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0))
68 ifan 4479 . . . . . 6 if((𝑥𝑈 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0) = if(𝑥𝑈, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0)
6968mpteq2i 5125 . . . . 5 (𝑥 ∈ ℝ ↦ if((𝑥𝑈 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥𝑈, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0))
70 ifan 4479 . . . . . . . . . 10 if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0) = if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0)
7170eqcomi 2810 . . . . . . . . 9 if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) = if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)
7271mpteq2i 5125 . . . . . . . 8 (𝑥 ∈ ℝ ↦ if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))
7372a1i 11 . . . . . . 7 ((𝜑𝑘 ∈ (0...3)) → (𝑥 ∈ ℝ ↦ if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)))
7473fveq2d 6653 . . . . . 6 ((𝜑𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))))
75 eqidd 2802 . . . . . . . . . 10 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)))
76 eqidd 2802 . . . . . . . . . 10 ((𝜑𝑥𝐴) → (ℜ‘(𝐶 / (i↑𝑘))) = (ℜ‘(𝐶 / (i↑𝑘))))
7775, 76, 12isibl2 24374 . . . . . . . . 9 (𝜑 → ((𝑥𝐴𝐶) ∈ 𝐿1 ↔ ((𝑥𝐴𝐶) ∈ MblFn ∧ ∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ)))
787, 77mpbid 235 . . . . . . . 8 (𝜑 → ((𝑥𝐴𝐶) ∈ MblFn ∧ ∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ))
7978simprd 499 . . . . . . 7 (𝜑 → ∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ)
8079r19.21bi 3176 . . . . . 6 ((𝜑𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ)
8174, 80eqeltrd 2893 . . . . 5 ((𝜑𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0))) ∈ ℝ)
82 ifan 4479 . . . . . . . . 9 if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0) = if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0)
8382eqcomi 2810 . . . . . . . 8 if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0) = if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)
8483mpteq2i 5125 . . . . . . 7 (𝑥 ∈ ℝ ↦ if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))
8584fveq2i 6652 . . . . . 6 (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)))
86 eqidd 2802 . . . . . . . . . 10 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)))
87 eqidd 2802 . . . . . . . . . 10 ((𝜑𝑥𝐵) → (ℜ‘(𝐶 / (i↑𝑘))) = (ℜ‘(𝐶 / (i↑𝑘))))
8886, 87, 25isibl2 24374 . . . . . . . . 9 (𝜑 → ((𝑥𝐵𝐶) ∈ 𝐿1 ↔ ((𝑥𝐵𝐶) ∈ MblFn ∧ ∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ)))
8920, 88mpbid 235 . . . . . . . 8 (𝜑 → ((𝑥𝐵𝐶) ∈ MblFn ∧ ∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ))
9089simprd 499 . . . . . . 7 (𝜑 → ∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ)
9190r19.21bi 3176 . . . . . 6 ((𝜑𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐵 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ)
9285, 91eqeltrid 2897 . . . . 5 ((𝜑𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0))) ∈ ℝ)
9333, 35, 37, 38, 65, 66, 67, 69, 81, 92itg2split 24357 . . . 4 ((𝜑𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝑈 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) = ((∫2‘(𝑥 ∈ ℝ ↦ if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0))) + (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0)))))
9481, 92readdcld 10663 . . . 4 ((𝜑𝑘 ∈ (0...3)) → ((∫2‘(𝑥 ∈ ℝ ↦ if(𝑥𝐴, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0))) + (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥𝐵, if(0 ≤ (ℜ‘(𝐶 / (i↑𝑘))), (ℜ‘(𝐶 / (i↑𝑘))), 0), 0)))) ∈ ℝ)
9593, 94eqeltrd 2893 . . 3 ((𝜑𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝑈 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ)
9695ralrimiva 3152 . 2 (𝜑 → ∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝑈 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ)
97 eqidd 2802 . . 3 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝑈 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝑈 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0)))
98 eqidd 2802 . . 3 ((𝜑𝑥𝑈) → (ℜ‘(𝐶 / (i↑𝑘))) = (ℜ‘(𝐶 / (i↑𝑘))))
9997, 98, 1isibl2 24374 . 2 (𝜑 → ((𝑥𝑈𝐶) ∈ 𝐿1 ↔ ((𝑥𝑈𝐶) ∈ MblFn ∧ ∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝑈 ∧ 0 ≤ (ℜ‘(𝐶 / (i↑𝑘)))), (ℜ‘(𝐶 / (i↑𝑘))), 0))) ∈ ℝ)))
10031, 96, 99mpbir2and 712 1 (𝜑 → (𝑥𝑈𝐶) ∈ 𝐿1)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 399  w3a 1084   = wceq 1538  wcel 2112  wne 2990  wral 3109  cun 3882  cin 3883  ifcif 4428   class class class wbr 5033  cmpt 5113  dom cdm 5523  cres 5525  cfv 6328  (class class class)co 7139  cc 10528  cr 10529  0cc0 10530  ici 10532   + caddc 10533  +∞cpnf 10665  *cxr 10667  cle 10669   / cdiv 11290  3c3 11685  cz 11973  [,]cicc 12733  ...cfz 12889  cexp 13429  cre 14452  vol*covol 24070  volcvol 24071  MblFncmbf 24222  2citg2 24224  𝐿1cibl 24225
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-rep 5157  ax-sep 5170  ax-nul 5177  ax-pow 5234  ax-pr 5298  ax-un 7445  ax-inf2 9092  ax-cnex 10586  ax-resscn 10587  ax-1cn 10588  ax-icn 10589  ax-addcl 10590  ax-addrcl 10591  ax-mulcl 10592  ax-mulrcl 10593  ax-mulcom 10594  ax-addass 10595  ax-mulass 10596  ax-distr 10597  ax-i2m1 10598  ax-1ne0 10599  ax-1rid 10600  ax-rnegex 10601  ax-rrecex 10602  ax-cnre 10603  ax-pre-lttri 10604  ax-pre-lttrn 10605  ax-pre-ltadd 10606  ax-pre-mulgt0 10607  ax-pre-sup 10608  ax-addf 10609
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ne 2991  df-nel 3095  df-ral 3114  df-rex 3115  df-reu 3116  df-rmo 3117  df-rab 3118  df-v 3446  df-sbc 3724  df-csb 3832  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-pss 3903  df-nul 4247  df-if 4429  df-pw 4502  df-sn 4529  df-pr 4531  df-tp 4533  df-op 4535  df-uni 4804  df-int 4842  df-iun 4886  df-disj 4999  df-br 5034  df-opab 5096  df-mpt 5114  df-tr 5140  df-id 5428  df-eprel 5433  df-po 5442  df-so 5443  df-fr 5482  df-se 5483  df-we 5484  df-xp 5529  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-rn 5534  df-res 5535  df-ima 5536  df-pred 6120  df-ord 6166  df-on 6167  df-lim 6168  df-suc 6169  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fo 6334  df-f1o 6335  df-fv 6336  df-isom 6337  df-riota 7097  df-ov 7142  df-oprab 7143  df-mpo 7144  df-of 7393  df-ofr 7394  df-om 7565  df-1st 7675  df-2nd 7676  df-wrecs 7934  df-recs 7995  df-rdg 8033  df-1o 8089  df-2o 8090  df-oadd 8093  df-er 8276  df-map 8395  df-pm 8396  df-en 8497  df-dom 8498  df-sdom 8499  df-fin 8500  df-fi 8863  df-sup 8894  df-inf 8895  df-oi 8962  df-dju 9318  df-card 9356  df-pnf 10670  df-mnf 10671  df-xr 10672  df-ltxr 10673  df-le 10674  df-sub 10865  df-neg 10866  df-div 11291  df-nn 11630  df-2 11692  df-3 11693  df-n0 11890  df-z 11974  df-uz 12236  df-q 12341  df-rp 12382  df-xneg 12499  df-xadd 12500  df-xmul 12501  df-ioo 12734  df-ico 12736  df-icc 12737  df-fz 12890  df-fzo 13033  df-fl 13161  df-seq 13369  df-exp 13430  df-hash 13691  df-cj 14454  df-re 14455  df-im 14456  df-sqrt 14590  df-abs 14591  df-clim 14841  df-sum 15039  df-rest 16692  df-topgen 16713  df-psmet 20087  df-xmet 20088  df-met 20089  df-bl 20090  df-mopn 20091  df-top 21503  df-topon 21520  df-bases 21555  df-cmp 21996  df-ovol 24072  df-vol 24073  df-mbf 24227  df-itg1 24228  df-itg2 24229  df-ibl 24230
This theorem is referenced by:  iblsplitf  42605
  Copyright terms: Public domain W3C validator