Metamath Proof Explorer


Theorem eulerpartlemsv2

Description: Lemma for eulerpart . Value of the sum of a finite partition A (Contributed by Thierry Arnoux, 19-Aug-2018)

Ref Expression
Hypotheses eulerpartlems.r ⊢ R = f | f -1 ℕ ∈ Fin
eulerpartlems.s ⊢ S = f ∈ ℕ 0 ℕ ∩ R ⟼ ∑ k ∈ ℕ f ⁡ k ⁢ k
Assertion eulerpartlemsv2 ⊢ A ∈ ℕ 0 ℕ ∩ R → S ⁡ A = ∑ k ∈ A -1 ℕ A ⁡ k ⁢ k

Proof

Step Hyp Ref Expression
1 eulerpartlems.r ⊢ R = f | f -1 ℕ ∈ Fin
2 eulerpartlems.s ⊢ S = f ∈ ℕ 0 ℕ ∩ R ⟼ ∑ k ∈ ℕ f ⁡ k ⁢ k
3 1 2 eulerpartlemsv1 ⊢ A ∈ ℕ 0 ℕ ∩ R → S ⁡ A = ∑ k ∈ ℕ A ⁡ k ⁢ k
4 cnvimass ⊢ A -1 ℕ ⊆ dom ⁡ A
5 1 2 eulerpartlemelr ⊢ A ∈ ℕ 0 ℕ ∩ R → A : ℕ ⟶ ℕ 0 ∧ A -1 ℕ ∈ Fin
6 5 simpld ⊢ A ∈ ℕ 0 ℕ ∩ R → A : ℕ ⟶ ℕ 0
7 4 6 fssdm ⊢ A ∈ ℕ 0 ℕ ∩ R → A -1 ℕ ⊆ ℕ
8 6 adantr ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ A -1 ℕ → A : ℕ ⟶ ℕ 0
9 7 sselda ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ A -1 ℕ → k ∈ ℕ
10 8 9 ffvelcdmd ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ A -1 ℕ → A ⁡ k ∈ ℕ 0
11 9 nnnn0d ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ A -1 ℕ → k ∈ ℕ 0
12 10 11 nn0mulcld ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ A -1 ℕ → A ⁡ k ⁢ k ∈ ℕ 0
13 12 nn0cnd ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ A -1 ℕ → A ⁡ k ⁢ k ∈ ℂ
14 simpr ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ ℕ ∖ A -1 ℕ → k ∈ ℕ ∖ A -1 ℕ
15 14 eldifad ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ ℕ ∖ A -1 ℕ → k ∈ ℕ
16 14 eldifbd ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ ℕ ∖ A -1 ℕ → ¬ k ∈ A -1 ℕ
17 6 adantr ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ ℕ ∖ A -1 ℕ → A : ℕ ⟶ ℕ 0
18 ffn ⊢ A : ℕ ⟶ ℕ 0 → A Fn ℕ
19 elpreima ⊢ A Fn ℕ → k ∈ A -1 ℕ ↔ k ∈ ℕ ∧ A ⁡ k ∈ ℕ
20 17 18 19 3syl ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ ℕ ∖ A -1 ℕ → k ∈ A -1 ℕ ↔ k ∈ ℕ ∧ A ⁡ k ∈ ℕ
21 16 20 mtbid ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ ℕ ∖ A -1 ℕ → ¬ k ∈ ℕ ∧ A ⁡ k ∈ ℕ
22 imnan ⊢ k ∈ ℕ → ¬ A ⁡ k ∈ ℕ ↔ ¬ k ∈ ℕ ∧ A ⁡ k ∈ ℕ
23 21 22 sylibr ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ ℕ ∖ A -1 ℕ → k ∈ ℕ → ¬ A ⁡ k ∈ ℕ
24 15 23 mpd ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ ℕ ∖ A -1 ℕ → ¬ A ⁡ k ∈ ℕ
25 17 15 ffvelcdmd ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ ℕ ∖ A -1 ℕ → A ⁡ k ∈ ℕ 0
26 elnn0 ⊢ A ⁡ k ∈ ℕ 0 ↔ A ⁡ k ∈ ℕ ∨ A ⁡ k = 0
27 25 26 sylib ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ ℕ ∖ A -1 ℕ → A ⁡ k ∈ ℕ ∨ A ⁡ k = 0
28 orel1 ⊢ ¬ A ⁡ k ∈ ℕ → A ⁡ k ∈ ℕ ∨ A ⁡ k = 0 → A ⁡ k = 0
29 24 27 28 sylc ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ ℕ ∖ A -1 ℕ → A ⁡ k = 0
30 29 oveq1d ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ ℕ ∖ A -1 ℕ → A ⁡ k ⁢ k = 0 ⋅ k
31 15 nncnd ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ ℕ ∖ A -1 ℕ → k ∈ ℂ
32 31 mul02d ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ ℕ ∖ A -1 ℕ → 0 ⋅ k = 0
33 30 32 eqtrd ⊢ A ∈ ℕ 0 ℕ ∩ R ∧ k ∈ ℕ ∖ A -1 ℕ → A ⁡ k ⁢ k = 0
34 nnuz ⊢ ℕ = ℤ ≥ 1
35 34 eqimssi ⊢ ℕ ⊆ ℤ ≥ 1
36 35 a1i ⊢ A ∈ ℕ 0 ℕ ∩ R → ℕ ⊆ ℤ ≥ 1
37 7 13 33 36 sumss ⊢ A ∈ ℕ 0 ℕ ∩ R → ∑ k ∈ A -1 ℕ A ⁡ k ⁢ k = ∑ k ∈ ℕ A ⁡ k ⁢ k
38 3 37 eqtr4d ⊢ A ∈ ℕ 0 ℕ ∩ R → S ⁡ A = ∑ k ∈ A -1 ℕ A ⁡ k ⁢ k