Metamath Proof Explorer


Theorem eulerpartlemsf

Description: Lemma for eulerpart . (Contributed by Thierry Arnoux, 8-Aug-2018)

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

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 simpl ⊢ g = f ∧ k ∈ ℕ → g = f
4 3 fveq1d ⊢ g = f ∧ k ∈ ℕ → g ⁡ k = f ⁡ k
5 4 oveq1d ⊢ g = f ∧ k ∈ ℕ → g ⁡ k ⁢ k = f ⁡ k ⁢ k
6 5 sumeq2dv ⊢ g = f → ∑ k ∈ ℕ g ⁡ k ⁢ k = ∑ k ∈ ℕ f ⁡ k ⁢ k
7 6 eleq1d ⊢ g = f → ∑ k ∈ ℕ g ⁡ k ⁢ k ∈ ℕ 0 ↔ ∑ k ∈ ℕ f ⁡ k ⁢ k ∈ ℕ 0
8 1 2 eulerpartlemsv2 ⊢ g ∈ ℕ 0 ℕ ∩ R → S ⁡ g = ∑ k ∈ g -1 ℕ g ⁡ k ⁢ k
9 1 2 eulerpartlemsv1 ⊢ g ∈ ℕ 0 ℕ ∩ R → S ⁡ g = ∑ k ∈ ℕ g ⁡ k ⁢ k
10 8 9 eqtr3d ⊢ g ∈ ℕ 0 ℕ ∩ R → ∑ k ∈ g -1 ℕ g ⁡ k ⁢ k = ∑ k ∈ ℕ g ⁡ k ⁢ k
11 1 2 eulerpartlemelr ⊢ g ∈ ℕ 0 ℕ ∩ R → g : ℕ ⟶ ℕ 0 ∧ g -1 ℕ ∈ Fin
12 11 simprd ⊢ g ∈ ℕ 0 ℕ ∩ R → g -1 ℕ ∈ Fin
13 11 simpld ⊢ g ∈ ℕ 0 ℕ ∩ R → g : ℕ ⟶ ℕ 0
14 13 adantr ⊢ g ∈ ℕ 0 ℕ ∩ R ∧ k ∈ g -1 ℕ → g : ℕ ⟶ ℕ 0
15 cnvimass ⊢ g -1 ℕ ⊆ dom ⁡ g
16 15 13 fssdm ⊢ g ∈ ℕ 0 ℕ ∩ R → g -1 ℕ ⊆ ℕ
17 16 sselda ⊢ g ∈ ℕ 0 ℕ ∩ R ∧ k ∈ g -1 ℕ → k ∈ ℕ
18 14 17 ffvelcdmd ⊢ g ∈ ℕ 0 ℕ ∩ R ∧ k ∈ g -1 ℕ → g ⁡ k ∈ ℕ 0
19 17 nnnn0d ⊢ g ∈ ℕ 0 ℕ ∩ R ∧ k ∈ g -1 ℕ → k ∈ ℕ 0
20 18 19 nn0mulcld ⊢ g ∈ ℕ 0 ℕ ∩ R ∧ k ∈ g -1 ℕ → g ⁡ k ⁢ k ∈ ℕ 0
21 12 20 fsumnn0cl ⊢ g ∈ ℕ 0 ℕ ∩ R → ∑ k ∈ g -1 ℕ g ⁡ k ⁢ k ∈ ℕ 0
22 10 21 eqeltrrd ⊢ g ∈ ℕ 0 ℕ ∩ R → ∑ k ∈ ℕ g ⁡ k ⁢ k ∈ ℕ 0
23 7 22 vtoclga ⊢ f ∈ ℕ 0 ℕ ∩ R → ∑ k ∈ ℕ f ⁡ k ⁢ k ∈ ℕ 0
24 2 23 fmpti ⊢ S : ℕ 0 ℕ ∩ R ⟶ ℕ 0