Metamath Proof Explorer


Theorem dvfsumrlimf

Description: Lemma for dvfsumrlim . (Contributed by Mario Carneiro, 18-May-2016)

Ref Expression
Hypotheses dvfsum.s 𝑆 = ( 𝑇 (,) +∞ )
dvfsum.z 𝑍 = ( ℤ𝑀 )
dvfsum.m ( 𝜑𝑀 ∈ ℤ )
dvfsum.d ( 𝜑𝐷 ∈ ℝ )
dvfsum.md ( 𝜑𝑀 ≤ ( 𝐷 + 1 ) )
dvfsum.t ( 𝜑𝑇 ∈ ℝ )
dvfsum.a ( ( 𝜑𝑥𝑆 ) → 𝐴 ∈ ℝ )
dvfsum.b1 ( ( 𝜑𝑥𝑆 ) → 𝐵𝑉 )
dvfsum.b2 ( ( 𝜑𝑥𝑍 ) → 𝐵 ∈ ℝ )
dvfsum.b3 ( 𝜑 → ( ℝ D ( 𝑥𝑆𝐴 ) ) = ( 𝑥𝑆𝐵 ) )
dvfsum.c ( 𝑥 = 𝑘𝐵 = 𝐶 )
dvfsumrlimf.g 𝐺 = ( 𝑥𝑆 ↦ ( Σ 𝑘 ∈ ( 𝑀 ... ( ⌊ ‘ 𝑥 ) ) 𝐶𝐴 ) )
Assertion dvfsumrlimf ( 𝜑𝐺 : 𝑆 ⟶ ℝ )

Proof

Step Hyp Ref Expression
1 dvfsum.s 𝑆 = ( 𝑇 (,) +∞ )
2 dvfsum.z 𝑍 = ( ℤ𝑀 )
3 dvfsum.m ( 𝜑𝑀 ∈ ℤ )
4 dvfsum.d ( 𝜑𝐷 ∈ ℝ )
5 dvfsum.md ( 𝜑𝑀 ≤ ( 𝐷 + 1 ) )
6 dvfsum.t ( 𝜑𝑇 ∈ ℝ )
7 dvfsum.a ( ( 𝜑𝑥𝑆 ) → 𝐴 ∈ ℝ )
8 dvfsum.b1 ( ( 𝜑𝑥𝑆 ) → 𝐵𝑉 )
9 dvfsum.b2 ( ( 𝜑𝑥𝑍 ) → 𝐵 ∈ ℝ )
10 dvfsum.b3 ( 𝜑 → ( ℝ D ( 𝑥𝑆𝐴 ) ) = ( 𝑥𝑆𝐵 ) )
11 dvfsum.c ( 𝑥 = 𝑘𝐵 = 𝐶 )
12 dvfsumrlimf.g 𝐺 = ( 𝑥𝑆 ↦ ( Σ 𝑘 ∈ ( 𝑀 ... ( ⌊ ‘ 𝑥 ) ) 𝐶𝐴 ) )
13 fzfid ( ( 𝜑𝑥𝑆 ) → ( 𝑀 ... ( ⌊ ‘ 𝑥 ) ) ∈ Fin )
14 9 ralrimiva ( 𝜑 → ∀ 𝑥𝑍 𝐵 ∈ ℝ )
15 14 adantr ( ( 𝜑𝑥𝑆 ) → ∀ 𝑥𝑍 𝐵 ∈ ℝ )
16 elfzuz ( 𝑘 ∈ ( 𝑀 ... ( ⌊ ‘ 𝑥 ) ) → 𝑘 ∈ ( ℤ𝑀 ) )
17 16 2 eleqtrrdi ( 𝑘 ∈ ( 𝑀 ... ( ⌊ ‘ 𝑥 ) ) → 𝑘𝑍 )
18 11 eleq1d ( 𝑥 = 𝑘 → ( 𝐵 ∈ ℝ ↔ 𝐶 ∈ ℝ ) )
19 18 rspccva ( ( ∀ 𝑥𝑍 𝐵 ∈ ℝ ∧ 𝑘𝑍 ) → 𝐶 ∈ ℝ )
20 15 17 19 syl2an ( ( ( 𝜑𝑥𝑆 ) ∧ 𝑘 ∈ ( 𝑀 ... ( ⌊ ‘ 𝑥 ) ) ) → 𝐶 ∈ ℝ )
21 13 20 fsumrecl ( ( 𝜑𝑥𝑆 ) → Σ 𝑘 ∈ ( 𝑀 ... ( ⌊ ‘ 𝑥 ) ) 𝐶 ∈ ℝ )
22 21 7 resubcld ( ( 𝜑𝑥𝑆 ) → ( Σ 𝑘 ∈ ( 𝑀 ... ( ⌊ ‘ 𝑥 ) ) 𝐶𝐴 ) ∈ ℝ )
23 22 12 fmptd ( 𝜑𝐺 : 𝑆 ⟶ ℝ )