Metamath Proof Explorer


Theorem fsumcvg3

Description: A finite sum is convergent. (Contributed by Mario Carneiro, 24-Apr-2014)

Ref Expression
Hypotheses fsumcvg3.1 ⊢ Z = ℤ ≥ M
fsumcvg3.2 ⊢ φ → M ∈ ℤ
fsumcvg3.3 ⊢ φ → A ∈ Fin
fsumcvg3.4 ⊢ φ → A ⊆ Z
fsumcvg3.5 ⊢ φ ∧ k ∈ Z → F ⁡ k = if k ∈ A B 0
fsumcvg3.6 ⊢ φ ∧ k ∈ A → B ∈ ℂ
Assertion fsumcvg3 ⊢ φ → seq M + F ∈ dom ⁡ ⇝

Proof

Step Hyp Ref Expression
1 fsumcvg3.1 ⊢ Z = ℤ ≥ M
2 fsumcvg3.2 ⊢ φ → M ∈ ℤ
3 fsumcvg3.3 ⊢ φ → A ∈ Fin
4 fsumcvg3.4 ⊢ φ → A ⊆ Z
5 fsumcvg3.5 ⊢ φ ∧ k ∈ Z → F ⁡ k = if k ∈ A B 0
6 fsumcvg3.6 ⊢ φ ∧ k ∈ A → B ∈ ℂ
7 sseq1 ⊢ A = ∅ → A ⊆ M … n ↔ ∅ ⊆ M … n
8 7 rexbidv ⊢ A = ∅ → ∃ n ∈ ℤ ≥ M A ⊆ M … n ↔ ∃ n ∈ ℤ ≥ M ∅ ⊆ M … n
9 4 adantr ⊢ φ ∧ A ≠ ∅ → A ⊆ Z
10 9 1 sseqtrdi ⊢ φ ∧ A ≠ ∅ → A ⊆ ℤ ≥ M
11 ltso ⊢ < Or ℝ
12 3 adantr ⊢ φ ∧ A ≠ ∅ → A ∈ Fin
13 simpr ⊢ φ ∧ A ≠ ∅ → A ≠ ∅
14 uzssz ⊢ ℤ ≥ M ⊆ ℤ
15 zssre ⊢ ℤ ⊆ ℝ
16 14 15 sstri ⊢ ℤ ≥ M ⊆ ℝ
17 1 16 eqsstri ⊢ Z ⊆ ℝ
18 9 17 sstrdi ⊢ φ ∧ A ≠ ∅ → A ⊆ ℝ
19 12 13 18 3jca ⊢ φ ∧ A ≠ ∅ → A ∈ Fin ∧ A ≠ ∅ ∧ A ⊆ ℝ
20 fisupcl ⊢ < Or ℝ ∧ A ∈ Fin ∧ A ≠ ∅ ∧ A ⊆ ℝ → sup A ℝ < ∈ A
21 11 19 20 sylancr ⊢ φ ∧ A ≠ ∅ → sup A ℝ < ∈ A
22 10 21 sseldd ⊢ φ ∧ A ≠ ∅ → sup A ℝ < ∈ ℤ ≥ M
23 fimaxre2 ⊢ A ⊆ ℝ ∧ A ∈ Fin → ∃ k ∈ ℝ ∀ n ∈ A n ≤ k
24 18 12 23 syl2anc ⊢ φ ∧ A ≠ ∅ → ∃ k ∈ ℝ ∀ n ∈ A n ≤ k
25 18 13 24 3jca ⊢ φ ∧ A ≠ ∅ → A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ k ∈ ℝ ∀ n ∈ A n ≤ k
26 suprub ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ k ∈ ℝ ∀ n ∈ A n ≤ k ∧ k ∈ A → k ≤ sup A ℝ <
27 25 26 sylan ⊢ φ ∧ A ≠ ∅ ∧ k ∈ A → k ≤ sup A ℝ <
28 10 sselda ⊢ φ ∧ A ≠ ∅ ∧ k ∈ A → k ∈ ℤ ≥ M
29 14 22 sselid ⊢ φ ∧ A ≠ ∅ → sup A ℝ < ∈ ℤ
30 29 adantr ⊢ φ ∧ A ≠ ∅ ∧ k ∈ A → sup A ℝ < ∈ ℤ
31 elfz5 ⊢ k ∈ ℤ ≥ M ∧ sup A ℝ < ∈ ℤ → k ∈ M … sup A ℝ < ↔ k ≤ sup A ℝ <
32 28 30 31 syl2anc ⊢ φ ∧ A ≠ ∅ ∧ k ∈ A → k ∈ M … sup A ℝ < ↔ k ≤ sup A ℝ <
33 27 32 mpbird ⊢ φ ∧ A ≠ ∅ ∧ k ∈ A → k ∈ M … sup A ℝ <
34 33 ex ⊢ φ ∧ A ≠ ∅ → k ∈ A → k ∈ M … sup A ℝ <
35 34 ssrdv ⊢ φ ∧ A ≠ ∅ → A ⊆ M … sup A ℝ <
36 oveq2 ⊢ n = sup A ℝ < → M … n = M … sup A ℝ <
37 36 sseq2d ⊢ n = sup A ℝ < → A ⊆ M … n ↔ A ⊆ M … sup A ℝ <
38 37 rspcev ⊢ sup A ℝ < ∈ ℤ ≥ M ∧ A ⊆ M … sup A ℝ < → ∃ n ∈ ℤ ≥ M A ⊆ M … n
39 22 35 38 syl2anc ⊢ φ ∧ A ≠ ∅ → ∃ n ∈ ℤ ≥ M A ⊆ M … n
40 uzid ⊢ M ∈ ℤ → M ∈ ℤ ≥ M
41 2 40 syl ⊢ φ → M ∈ ℤ ≥ M
42 0ss ⊢ ∅ ⊆ M … M
43 oveq2 ⊢ n = M → M … n = M … M
44 43 sseq2d ⊢ n = M → ∅ ⊆ M … n ↔ ∅ ⊆ M … M
45 44 rspcev ⊢ M ∈ ℤ ≥ M ∧ ∅ ⊆ M … M → ∃ n ∈ ℤ ≥ M ∅ ⊆ M … n
46 41 42 45 sylancl ⊢ φ → ∃ n ∈ ℤ ≥ M ∅ ⊆ M … n
47 8 39 46 pm2.61ne ⊢ φ → ∃ n ∈ ℤ ≥ M A ⊆ M … n
48 1 eleq2i ⊢ k ∈ Z ↔ k ∈ ℤ ≥ M
49 48 5 sylan2br ⊢ φ ∧ k ∈ ℤ ≥ M → F ⁡ k = if k ∈ A B 0
50 49 adantlr ⊢ φ ∧ n ∈ ℤ ≥ M ∧ A ⊆ M … n ∧ k ∈ ℤ ≥ M → F ⁡ k = if k ∈ A B 0
51 simprl ⊢ φ ∧ n ∈ ℤ ≥ M ∧ A ⊆ M … n → n ∈ ℤ ≥ M
52 6 adantlr ⊢ φ ∧ n ∈ ℤ ≥ M ∧ A ⊆ M … n ∧ k ∈ A → B ∈ ℂ
53 simprr ⊢ φ ∧ n ∈ ℤ ≥ M ∧ A ⊆ M … n → A ⊆ M … n
54 50 51 52 53 fsumcvg2 ⊢ φ ∧ n ∈ ℤ ≥ M ∧ A ⊆ M … n → seq M + F ⇝ seq M + F ⁡ n
55 climrel ⊢ Rel ⁡ ⇝
56 55 releldmi ⊢ seq M + F ⇝ seq M + F ⁡ n → seq M + F ∈ dom ⁡ ⇝
57 54 56 syl ⊢ φ ∧ n ∈ ℤ ≥ M ∧ A ⊆ M … n → seq M + F ∈ dom ⁡ ⇝
58 47 57 rexlimddv ⊢ φ → seq M + F ∈ dom ⁡ ⇝