Metamath Proof Explorer


Theorem rpnnen2lem6

Description: Lemma for rpnnen2 . (Contributed by Mario Carneiro, 13-May-2013) (Revised by Mario Carneiro, 30-Apr-2014)

Ref Expression
Hypothesis rpnnen2.1 ⊢ F = x ∈ 𝒫 ℕ ⟼ n ∈ ℕ ⟼ if n ∈ x 1 3 n 0
Assertion rpnnen2lem6 ⊢ A ⊆ ℕ ∧ M ∈ ℕ → ∑ k ∈ ℤ ≥ M F ⁡ A ⁡ k ∈ ℝ

Proof

Step Hyp Ref Expression
1 rpnnen2.1 ⊢ F = x ∈ 𝒫 ℕ ⟼ n ∈ ℕ ⟼ if n ∈ x 1 3 n 0
2 eqid ⊢ ℤ ≥ M = ℤ ≥ M
3 nnz ⊢ M ∈ ℕ → M ∈ ℤ
4 3 adantl ⊢ A ⊆ ℕ ∧ M ∈ ℕ → M ∈ ℤ
5 eqidd ⊢ A ⊆ ℕ ∧ M ∈ ℕ ∧ k ∈ ℤ ≥ M → F ⁡ A ⁡ k = F ⁡ A ⁡ k
6 1 rpnnen2lem2 ⊢ A ⊆ ℕ → F ⁡ A : ℕ ⟶ ℝ
7 6 ad2antrr ⊢ A ⊆ ℕ ∧ M ∈ ℕ ∧ k ∈ ℤ ≥ M → F ⁡ A : ℕ ⟶ ℝ
8 eluznn ⊢ M ∈ ℕ ∧ k ∈ ℤ ≥ M → k ∈ ℕ
9 8 adantll ⊢ A ⊆ ℕ ∧ M ∈ ℕ ∧ k ∈ ℤ ≥ M → k ∈ ℕ
10 7 9 ffvelcdmd ⊢ A ⊆ ℕ ∧ M ∈ ℕ ∧ k ∈ ℤ ≥ M → F ⁡ A ⁡ k ∈ ℝ
11 1 rpnnen2lem5 ⊢ A ⊆ ℕ ∧ M ∈ ℕ → seq M + F ⁡ A ∈ dom ⁡ ⇝
12 2 4 5 10 11 isumrecl ⊢ A ⊆ ℕ ∧ M ∈ ℕ → ∑ k ∈ ℤ ≥ M F ⁡ A ⁡ k ∈ ℝ