Metamath Proof Explorer


Theorem eulerpartlemgf

Description: Lemma for eulerpart : Images under G have finite support. (Contributed by Thierry Arnoux, 29-Aug-2018)

Ref Expression
Hypotheses eulerpart.p ⊢ P = f ∈ ℕ 0 ℕ | f -1 ℕ ∈ Fin ∧ ∑ k ∈ ℕ f ⁡ k ⁢ k = N
eulerpart.o ⊢ O = g ∈ P | ∀ n ∈ g -1 ℕ ¬ 2 ∥ n
eulerpart.d ⊢ D = g ∈ P | ∀ n ∈ ℕ g ⁡ n ≤ 1
eulerpart.j ⊢ J = z ∈ ℕ | ¬ 2 ∥ z
eulerpart.f ⊢ F = x ∈ J , y ∈ ℕ 0 ⟼ 2 y ⁢ x
eulerpart.h ⊢ H = r ∈ 𝒫 ℕ 0 ∩ Fin J | r supp ∅ ∈ Fin
eulerpart.m ⊢ M = r ∈ H ⟼ x y | x ∈ J ∧ y ∈ r ⁡ x
eulerpart.r ⊢ R = f | f -1 ℕ ∈ Fin
eulerpart.t ⊢ T = f ∈ ℕ 0 ℕ | f -1 ℕ ⊆ J
eulerpart.g ⊢ G = o ∈ T ∩ R ⟼ 𝟙 ℕ ⁡ F M ⁡ bits ∘ o ↾ J
Assertion eulerpartlemgf ⊢ A ∈ T ∩ R → G ⁡ A -1 ℕ ∈ Fin

Proof

Step Hyp Ref Expression
1 eulerpart.p ⊢ P = f ∈ ℕ 0 ℕ | f -1 ℕ ∈ Fin ∧ ∑ k ∈ ℕ f ⁡ k ⁢ k = N
2 eulerpart.o ⊢ O = g ∈ P | ∀ n ∈ g -1 ℕ ¬ 2 ∥ n
3 eulerpart.d ⊢ D = g ∈ P | ∀ n ∈ ℕ g ⁡ n ≤ 1
4 eulerpart.j ⊢ J = z ∈ ℕ | ¬ 2 ∥ z
5 eulerpart.f ⊢ F = x ∈ J , y ∈ ℕ 0 ⟼ 2 y ⁢ x
6 eulerpart.h ⊢ H = r ∈ 𝒫 ℕ 0 ∩ Fin J | r supp ∅ ∈ Fin
7 eulerpart.m ⊢ M = r ∈ H ⟼ x y | x ∈ J ∧ y ∈ r ⁡ x
8 eulerpart.r ⊢ R = f | f -1 ℕ ∈ Fin
9 eulerpart.t ⊢ T = f ∈ ℕ 0 ℕ | f -1 ℕ ⊆ J
10 eulerpart.g ⊢ G = o ∈ T ∩ R ⟼ 𝟙 ℕ ⁡ F M ⁡ bits ∘ o ↾ J
11 1 2 3 4 5 6 7 8 9 10 eulerpartlemgv ⊢ A ∈ T ∩ R → G ⁡ A = 𝟙 ℕ ⁡ F M ⁡ bits ∘ A ↾ J
12 11 cnveqd ⊢ A ∈ T ∩ R → G ⁡ A -1 = 𝟙 ℕ ⁡ F M ⁡ bits ∘ A ↾ J -1
13 12 imaeq1d ⊢ A ∈ T ∩ R → G ⁡ A -1 1 = 𝟙 ℕ ⁡ F M ⁡ bits ∘ A ↾ J -1 1
14 nnex ⊢ ℕ ∈ V
15 imassrn ⊢ F M ⁡ bits ∘ A ↾ J ⊆ ran ⁡ F
16 4 5 oddpwdc ⊢ F : J × ℕ 0 ⟶ 1-1 onto ℕ
17 f1of ⊢ F : J × ℕ 0 ⟶ 1-1 onto ℕ → F : J × ℕ 0 ⟶ ℕ
18 frn ⊢ F : J × ℕ 0 ⟶ ℕ → ran ⁡ F ⊆ ℕ
19 16 17 18 mp2b ⊢ ran ⁡ F ⊆ ℕ
20 15 19 sstri ⊢ F M ⁡ bits ∘ A ↾ J ⊆ ℕ
21 indpi1 ⊢ ℕ ∈ V ∧ F M ⁡ bits ∘ A ↾ J ⊆ ℕ → 𝟙 ℕ ⁡ F M ⁡ bits ∘ A ↾ J -1 1 = F M ⁡ bits ∘ A ↾ J
22 14 20 21 mp2an ⊢ 𝟙 ℕ ⁡ F M ⁡ bits ∘ A ↾ J -1 1 = F M ⁡ bits ∘ A ↾ J
23 13 22 eqtrdi ⊢ A ∈ T ∩ R → G ⁡ A -1 1 = F M ⁡ bits ∘ A ↾ J
24 ffun ⊢ F : J × ℕ 0 ⟶ ℕ → Fun ⁡ F
25 16 17 24 mp2b ⊢ Fun ⁡ F
26 inss2 ⊢ 𝒫 J × ℕ 0 ∩ Fin ⊆ Fin
27 1 2 3 4 5 6 7 8 9 10 eulerpartlemmf ⊢ A ∈ T ∩ R → bits ∘ A ↾ J ∈ H
28 1 2 3 4 5 6 7 eulerpartlem1 ⊢ M : H ⟶ 1-1 onto 𝒫 J × ℕ 0 ∩ Fin
29 f1of ⊢ M : H ⟶ 1-1 onto 𝒫 J × ℕ 0 ∩ Fin → M : H ⟶ 𝒫 J × ℕ 0 ∩ Fin
30 28 29 ax-mp ⊢ M : H ⟶ 𝒫 J × ℕ 0 ∩ Fin
31 30 ffvelcdmi ⊢ bits ∘ A ↾ J ∈ H → M ⁡ bits ∘ A ↾ J ∈ 𝒫 J × ℕ 0 ∩ Fin
32 27 31 syl ⊢ A ∈ T ∩ R → M ⁡ bits ∘ A ↾ J ∈ 𝒫 J × ℕ 0 ∩ Fin
33 26 32 sselid ⊢ A ∈ T ∩ R → M ⁡ bits ∘ A ↾ J ∈ Fin
34 imafi ⊢ Fun ⁡ F ∧ M ⁡ bits ∘ A ↾ J ∈ Fin → F M ⁡ bits ∘ A ↾ J ∈ Fin
35 25 33 34 sylancr ⊢ A ∈ T ∩ R → F M ⁡ bits ∘ A ↾ J ∈ Fin
36 23 35 eqeltrd ⊢ A ∈ T ∩ R → G ⁡ A -1 1 ∈ Fin
37 1 2 3 4 5 6 7 8 9 10 eulerpartgbij ⊢ G : T ∩ R ⟶ 1-1 onto 0 1 ℕ ∩ R
38 f1of ⊢ G : T ∩ R ⟶ 1-1 onto 0 1 ℕ ∩ R → G : T ∩ R ⟶ 0 1 ℕ ∩ R
39 37 38 ax-mp ⊢ G : T ∩ R ⟶ 0 1 ℕ ∩ R
40 39 ffvelcdmi ⊢ A ∈ T ∩ R → G ⁡ A ∈ 0 1 ℕ ∩ R
41 elin ⊢ G ⁡ A ∈ 0 1 ℕ ∩ R ↔ G ⁡ A ∈ 0 1 ℕ ∧ G ⁡ A ∈ R
42 41 simplbi ⊢ G ⁡ A ∈ 0 1 ℕ ∩ R → G ⁡ A ∈ 0 1 ℕ
43 elmapi ⊢ G ⁡ A ∈ 0 1 ℕ → G ⁡ A : ℕ ⟶ 0 1
44 40 42 43 3syl ⊢ A ∈ T ∩ R → G ⁡ A : ℕ ⟶ 0 1
45 44 ffund ⊢ A ∈ T ∩ R → Fun ⁡ G ⁡ A
46 ssv ⊢ ℕ 0 ⊆ V
47 dfn2 ⊢ ℕ = ℕ 0 ∖ 0
48 ssdif ⊢ ℕ 0 ⊆ V → ℕ 0 ∖ 0 ⊆ V ∖ 0
49 47 48 eqsstrid ⊢ ℕ 0 ⊆ V → ℕ ⊆ V ∖ 0
50 46 49 ax-mp ⊢ ℕ ⊆ V ∖ 0
51 sspreima ⊢ Fun ⁡ G ⁡ A ∧ ℕ ⊆ V ∖ 0 → G ⁡ A -1 ℕ ⊆ G ⁡ A -1 V ∖ 0
52 45 50 51 sylancl ⊢ A ∈ T ∩ R → G ⁡ A -1 ℕ ⊆ G ⁡ A -1 V ∖ 0
53 fvex ⊢ G ⁡ A ∈ V
54 0nn0 ⊢ 0 ∈ ℕ 0
55 suppimacnv ⊢ G ⁡ A ∈ V ∧ 0 ∈ ℕ 0 → G ⁡ A supp 0 = G ⁡ A -1 V ∖ 0
56 53 54 55 mp2an ⊢ G ⁡ A supp 0 = G ⁡ A -1 V ∖ 0
57 0ne1 ⊢ 0 ≠ 1
58 difprsn1 ⊢ 0 ≠ 1 → 0 1 ∖ 0 = 1
59 57 58 ax-mp ⊢ 0 1 ∖ 0 = 1
60 59 eqcomi ⊢ 1 = 0 1 ∖ 0
61 60 ffs2 ⊢ ℕ ∈ V ∧ 0 ∈ ℕ 0 ∧ G ⁡ A : ℕ ⟶ 0 1 → G ⁡ A supp 0 = G ⁡ A -1 1
62 14 54 61 mp3an12 ⊢ G ⁡ A : ℕ ⟶ 0 1 → G ⁡ A supp 0 = G ⁡ A -1 1
63 44 62 syl ⊢ A ∈ T ∩ R → G ⁡ A supp 0 = G ⁡ A -1 1
64 56 63 eqtr3id ⊢ A ∈ T ∩ R → G ⁡ A -1 V ∖ 0 = G ⁡ A -1 1
65 52 64 sseqtrd ⊢ A ∈ T ∩ R → G ⁡ A -1 ℕ ⊆ G ⁡ A -1 1
66 ssfi ⊢ G ⁡ A -1 1 ∈ Fin ∧ G ⁡ A -1 ℕ ⊆ G ⁡ A -1 1 → G ⁡ A -1 ℕ ∈ Fin
67 36 65 66 syl2anc ⊢ A ∈ T ∩ R → G ⁡ A -1 ℕ ∈ Fin