Metamath Proof Explorer


Theorem etransclem11

Description: A change of bound variable, often used in proofs for etransc . (Contributed by Glauco Siliprandi, 5-Apr-2020)

Ref Expression
Assertion etransclem11 ⊢ n ∈ ℕ 0 ⟼ c ∈ 0 … n 0 … M | ∑ j = 0 M c ⁡ j = n = m ∈ ℕ 0 ⟼ d ∈ 0 … m 0 … M | ∑ k = 0 M d ⁡ k = m

Proof

Step Hyp Ref Expression
1 oveq2 ⊢ n = m → 0 … n = 0 … m
2 1 oveq1d ⊢ n = m → 0 … n 0 … M = 0 … m 0 … M
3 2 rabeqdv ⊢ n = m → c ∈ 0 … n 0 … M | ∑ j = 0 M c ⁡ j = n = c ∈ 0 … m 0 … M | ∑ j = 0 M c ⁡ j = n
4 fveq2 ⊢ j = k → c ⁡ j = c ⁡ k
5 4 cbvsumv ⊢ ∑ j = 0 M c ⁡ j = ∑ k = 0 M c ⁡ k
6 fveq1 ⊢ c = d → c ⁡ k = d ⁡ k
7 6 sumeq2sdv ⊢ c = d → ∑ k = 0 M c ⁡ k = ∑ k = 0 M d ⁡ k
8 5 7 eqtrid ⊢ c = d → ∑ j = 0 M c ⁡ j = ∑ k = 0 M d ⁡ k
9 8 eqeq1d ⊢ c = d → ∑ j = 0 M c ⁡ j = n ↔ ∑ k = 0 M d ⁡ k = n
10 9 cbvrabv ⊢ c ∈ 0 … m 0 … M | ∑ j = 0 M c ⁡ j = n = d ∈ 0 … m 0 … M | ∑ k = 0 M d ⁡ k = n
11 eqeq2 ⊢ n = m → ∑ k = 0 M d ⁡ k = n ↔ ∑ k = 0 M d ⁡ k = m
12 11 rabbidv ⊢ n = m → d ∈ 0 … m 0 … M | ∑ k = 0 M d ⁡ k = n = d ∈ 0 … m 0 … M | ∑ k = 0 M d ⁡ k = m
13 10 12 eqtrid ⊢ n = m → c ∈ 0 … m 0 … M | ∑ j = 0 M c ⁡ j = n = d ∈ 0 … m 0 … M | ∑ k = 0 M d ⁡ k = m
14 3 13 eqtrd ⊢ n = m → c ∈ 0 … n 0 … M | ∑ j = 0 M c ⁡ j = n = d ∈ 0 … m 0 … M | ∑ k = 0 M d ⁡ k = m
15 14 cbvmptv ⊢ n ∈ ℕ 0 ⟼ c ∈ 0 … n 0 … M | ∑ j = 0 M c ⁡ j = n = m ∈ ℕ 0 ⟼ d ∈ 0 … m 0 … M | ∑ k = 0 M d ⁡ k = m