Metamath Proof Explorer


Theorem iblitg

Description: If a function is integrable, then the S.2 integrals of the function's decompositions all exist. (Contributed by Mario Carneiro, 7-Jul-2014) (Revised by Mario Carneiro, 23-Aug-2014)

Ref Expression
Hypotheses iblitg.1 ⊢ φ → G = x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ T T 0
iblitg.2 ⊢ φ ∧ x ∈ A → T = ℜ ⁡ B i K
iblitg.3 ⊢ φ → x ∈ A ⟼ B ∈ 𝐿 1
iblitg.4 ⊢ φ ∧ x ∈ A → B ∈ V
Assertion iblitg ⊢ φ ∧ K ∈ ℤ → ∫ 2 ⁡ G ∈ ℝ

Proof

Step Hyp Ref Expression
1 iblitg.1 ⊢ φ → G = x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ T T 0
2 iblitg.2 ⊢ φ ∧ x ∈ A → T = ℜ ⁡ B i K
3 iblitg.3 ⊢ φ → x ∈ A ⟼ B ∈ 𝐿 1
4 iblitg.4 ⊢ φ ∧ x ∈ A → B ∈ V
5 1 adantr ⊢ φ ∧ K ∈ ℤ → G = x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ T T 0
6 2 adantlr ⊢ φ ∧ K ∈ ℤ ∧ x ∈ A → T = ℜ ⁡ B i K
7 iexpcyc ⊢ K ∈ ℤ → i K mod 4 = i K
8 7 oveq2d ⊢ K ∈ ℤ → B i K mod 4 = B i K
9 8 fveq2d ⊢ K ∈ ℤ → ℜ ⁡ B i K mod 4 = ℜ ⁡ B i K
10 9 ad2antlr ⊢ φ ∧ K ∈ ℤ ∧ x ∈ A → ℜ ⁡ B i K mod 4 = ℜ ⁡ B i K
11 6 10 eqtr4d ⊢ φ ∧ K ∈ ℤ ∧ x ∈ A → T = ℜ ⁡ B i K mod 4
12 11 ibllem ⊢ φ ∧ K ∈ ℤ → if x ∈ A ∧ 0 ≤ T T 0 = if x ∈ A ∧ 0 ≤ ℜ ⁡ B i K mod 4 ℜ ⁡ B i K mod 4 0
13 12 mpteq2dv ⊢ φ ∧ K ∈ ℤ → x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ T T 0 = x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i K mod 4 ℜ ⁡ B i K mod 4 0
14 5 13 eqtrd ⊢ φ ∧ K ∈ ℤ → G = x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i K mod 4 ℜ ⁡ B i K mod 4 0
15 14 fveq2d ⊢ φ ∧ K ∈ ℤ → ∫ 2 ⁡ G = ∫ 2 ⁡ x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i K mod 4 ℜ ⁡ B i K mod 4 0
16 oveq2 ⊢ k = K mod 4 → i k = i K mod 4
17 16 oveq2d ⊢ k = K mod 4 → B i k = B i K mod 4
18 17 fveq2d ⊢ k = K mod 4 → ℜ ⁡ B i k = ℜ ⁡ B i K mod 4
19 18 breq2d ⊢ k = K mod 4 → 0 ≤ ℜ ⁡ B i k ↔ 0 ≤ ℜ ⁡ B i K mod 4
20 19 anbi2d ⊢ k = K mod 4 → x ∈ A ∧ 0 ≤ ℜ ⁡ B i k ↔ x ∈ A ∧ 0 ≤ ℜ ⁡ B i K mod 4
21 20 18 ifbieq1d ⊢ k = K mod 4 → if x ∈ A ∧ 0 ≤ ℜ ⁡ B i k ℜ ⁡ B i k 0 = if x ∈ A ∧ 0 ≤ ℜ ⁡ B i K mod 4 ℜ ⁡ B i K mod 4 0
22 21 mpteq2dv ⊢ k = K mod 4 → x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i k ℜ ⁡ B i k 0 = x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i K mod 4 ℜ ⁡ B i K mod 4 0
23 22 fveq2d ⊢ k = K mod 4 → ∫ 2 ⁡ x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i k ℜ ⁡ B i k 0 = ∫ 2 ⁡ x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i K mod 4 ℜ ⁡ B i K mod 4 0
24 23 eleq1d ⊢ k = K mod 4 → ∫ 2 ⁡ x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i k ℜ ⁡ B i k 0 ∈ ℝ ↔ ∫ 2 ⁡ x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i K mod 4 ℜ ⁡ B i K mod 4 0 ∈ ℝ
25 eqidd ⊢ φ → x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i k ℜ ⁡ B i k 0 = x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i k ℜ ⁡ B i k 0
26 eqidd ⊢ φ ∧ x ∈ A → ℜ ⁡ B i k = ℜ ⁡ B i k
27 25 26 4 isibl2 ⊢ φ → x ∈ A ⟼ B ∈ 𝐿 1 ↔ x ∈ A ⟼ B ∈ MblFn ∧ ∀ k ∈ 0 … 3 ∫ 2 ⁡ x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i k ℜ ⁡ B i k 0 ∈ ℝ
28 3 27 mpbid ⊢ φ → x ∈ A ⟼ B ∈ MblFn ∧ ∀ k ∈ 0 … 3 ∫ 2 ⁡ x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i k ℜ ⁡ B i k 0 ∈ ℝ
29 28 simprd ⊢ φ → ∀ k ∈ 0 … 3 ∫ 2 ⁡ x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i k ℜ ⁡ B i k 0 ∈ ℝ
30 29 adantr ⊢ φ ∧ K ∈ ℤ → ∀ k ∈ 0 … 3 ∫ 2 ⁡ x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i k ℜ ⁡ B i k 0 ∈ ℝ
31 4nn ⊢ 4 ∈ ℕ
32 zmodfz ⊢ K ∈ ℤ ∧ 4 ∈ ℕ → K mod 4 ∈ 0 … 4 − 1
33 31 32 mpan2 ⊢ K ∈ ℤ → K mod 4 ∈ 0 … 4 − 1
34 4m1e3 ⊢ 4 − 1 = 3
35 34 oveq2i ⊢ 0 … 4 − 1 = 0 … 3
36 33 35 eleqtrdi ⊢ K ∈ ℤ → K mod 4 ∈ 0 … 3
37 36 adantl ⊢ φ ∧ K ∈ ℤ → K mod 4 ∈ 0 … 3
38 24 30 37 rspcdva ⊢ φ ∧ K ∈ ℤ → ∫ 2 ⁡ x ∈ ℝ ⟼ if x ∈ A ∧ 0 ≤ ℜ ⁡ B i K mod 4 ℜ ⁡ B i K mod 4 0 ∈ ℝ
39 15 38 eqeltrd ⊢ φ ∧ K ∈ ℤ → ∫ 2 ⁡ G ∈ ℝ