Metamath Proof Explorer


Theorem dchrisum0flblem2

Description: Lemma for dchrisum0flb . Induction over relatively prime factors, with the prime power case handled in dchrisum0flblem1 . (Contributed by Mario Carneiro, 5-May-2016) Replace reference to OLD theorem. (Revised by Wolf Lammen, 8-Sep-2020)

Ref Expression
Hypotheses rpvmasum.z ⊢ Z = ℤ/Nℤ
rpvmasum.l ⊢ L = ℤRHom ⁡ Z
rpvmasum.a ⊢ φ → N ∈ ℕ
rpvmasum2.g ⊢ G = DChr ⁡ N
rpvmasum2.d ⊢ D = Base G
rpvmasum2.1 ⊢ 1 ˙ = 0 G
dchrisum0f.f ⊢ F = b ∈ ℕ ⟼ ∑ v ∈ q ∈ ℕ | q ∥ b X ⁡ L ⁡ v
dchrisum0f.x ⊢ φ → X ∈ D
dchrisum0flb.r ⊢ φ → X : Base Z ⟶ ℝ
dchrisum0flb.1 ⊢ φ → A ∈ ℤ ≥ 2
dchrisum0flb.2 ⊢ φ → P ∈ ℙ
dchrisum0flb.3 ⊢ φ → P ∥ A
dchrisum0flb.4 ⊢ φ → ∀ y ∈ 1 ..^ A if y ∈ ℕ 1 0 ≤ F ⁡ y
Assertion dchrisum0flblem2 ⊢ φ → if A ∈ ℕ 1 0 ≤ F ⁡ A

Proof

Step Hyp Ref Expression
1 rpvmasum.z ⊢ Z = ℤ/Nℤ
2 rpvmasum.l ⊢ L = ℤRHom ⁡ Z
3 rpvmasum.a ⊢ φ → N ∈ ℕ
4 rpvmasum2.g ⊢ G = DChr ⁡ N
5 rpvmasum2.d ⊢ D = Base G
6 rpvmasum2.1 ⊢ 1 ˙ = 0 G
7 dchrisum0f.f ⊢ F = b ∈ ℕ ⟼ ∑ v ∈ q ∈ ℕ | q ∥ b X ⁡ L ⁡ v
8 dchrisum0f.x ⊢ φ → X ∈ D
9 dchrisum0flb.r ⊢ φ → X : Base Z ⟶ ℝ
10 dchrisum0flb.1 ⊢ φ → A ∈ ℤ ≥ 2
11 dchrisum0flb.2 ⊢ φ → P ∈ ℙ
12 dchrisum0flb.3 ⊢ φ → P ∥ A
13 dchrisum0flb.4 ⊢ φ → ∀ y ∈ 1 ..^ A if y ∈ ℕ 1 0 ≤ F ⁡ y
14 breq1 ⊢ 1 = if A ∈ ℕ 1 0 → 1 ≤ F ⁡ P P pCnt A ⁢ F ⁡ A P P pCnt A ↔ if A ∈ ℕ 1 0 ≤ F ⁡ P P pCnt A ⁢ F ⁡ A P P pCnt A
15 breq1 ⊢ 0 = if A ∈ ℕ 1 0 → 0 ≤ F ⁡ P P pCnt A ⁢ F ⁡ A P P pCnt A ↔ if A ∈ ℕ 1 0 ≤ F ⁡ P P pCnt A ⁢ F ⁡ A P P pCnt A
16 1t1e1 ⊢ 1 ⋅ 1 = 1
17 11 adantr ⊢ φ ∧ A ∈ ℕ → P ∈ ℙ
18 nnq ⊢ A ∈ ℕ → A ∈ ℚ
19 18 adantl ⊢ φ ∧ A ∈ ℕ → A ∈ ℚ
20 nnne0 ⊢ A ∈ ℕ → A ≠ 0
21 20 adantl ⊢ φ ∧ A ∈ ℕ → A ≠ 0
22 2z ⊢ 2 ∈ ℤ
23 22 a1i ⊢ φ ∧ A ∈ ℕ → 2 ∈ ℤ
24 pcexp ⊢ P ∈ ℙ ∧ A ∈ ℚ ∧ A ≠ 0 ∧ 2 ∈ ℤ → P pCnt A 2 = 2 ⁢ P pCnt A
25 17 19 21 23 24 syl121anc ⊢ φ ∧ A ∈ ℕ → P pCnt A 2 = 2 ⁢ P pCnt A
26 eluz2nn ⊢ A ∈ ℤ ≥ 2 → A ∈ ℕ
27 10 26 syl ⊢ φ → A ∈ ℕ
28 27 nncnd ⊢ φ → A ∈ ℂ
29 28 adantr ⊢ φ ∧ A ∈ ℕ → A ∈ ℂ
30 29 sqsqrtd ⊢ φ ∧ A ∈ ℕ → A 2 = A
31 30 oveq2d ⊢ φ ∧ A ∈ ℕ → P pCnt A 2 = P pCnt A
32 2cnd ⊢ φ ∧ A ∈ ℕ → 2 ∈ ℂ
33 simpr ⊢ φ ∧ A ∈ ℕ → A ∈ ℕ
34 17 33 pccld ⊢ φ ∧ A ∈ ℕ → P pCnt A ∈ ℕ 0
35 34 nn0cnd ⊢ φ ∧ A ∈ ℕ → P pCnt A ∈ ℂ
36 32 35 mulcomd ⊢ φ ∧ A ∈ ℕ → 2 ⁢ P pCnt A = P pCnt A ⋅ 2
37 25 31 36 3eqtr3rd ⊢ φ ∧ A ∈ ℕ → P pCnt A ⋅ 2 = P pCnt A
38 37 oveq2d ⊢ φ ∧ A ∈ ℕ → P P pCnt A ⋅ 2 = P P pCnt A
39 prmnn ⊢ P ∈ ℙ → P ∈ ℕ
40 17 39 syl ⊢ φ ∧ A ∈ ℕ → P ∈ ℕ
41 40 nncnd ⊢ φ ∧ A ∈ ℕ → P ∈ ℂ
42 2nn0 ⊢ 2 ∈ ℕ 0
43 42 a1i ⊢ φ ∧ A ∈ ℕ → 2 ∈ ℕ 0
44 41 43 34 expmuld ⊢ φ ∧ A ∈ ℕ → P P pCnt A ⋅ 2 = P P pCnt A 2
45 38 44 eqtr3d ⊢ φ ∧ A ∈ ℕ → P P pCnt A = P P pCnt A 2
46 45 fveq2d ⊢ φ ∧ A ∈ ℕ → P P pCnt A = P P pCnt A 2
47 40 34 nnexpcld ⊢ φ ∧ A ∈ ℕ → P P pCnt A ∈ ℕ
48 47 nnrpd ⊢ φ ∧ A ∈ ℕ → P P pCnt A ∈ ℝ +
49 48 rprege0d ⊢ φ ∧ A ∈ ℕ → P P pCnt A ∈ ℝ ∧ 0 ≤ P P pCnt A
50 sqrtsq ⊢ P P pCnt A ∈ ℝ ∧ 0 ≤ P P pCnt A → P P pCnt A 2 = P P pCnt A
51 49 50 syl ⊢ φ ∧ A ∈ ℕ → P P pCnt A 2 = P P pCnt A
52 46 51 eqtrd ⊢ φ ∧ A ∈ ℕ → P P pCnt A = P P pCnt A
53 52 47 eqeltrd ⊢ φ ∧ A ∈ ℕ → P P pCnt A ∈ ℕ
54 53 iftrued ⊢ φ ∧ A ∈ ℕ → if P P pCnt A ∈ ℕ 1 0 = 1
55 11 27 pccld ⊢ φ → P pCnt A ∈ ℕ 0
56 1 2 3 4 5 6 7 8 9 11 55 dchrisum0flblem1 ⊢ φ → if P P pCnt A ∈ ℕ 1 0 ≤ F ⁡ P P pCnt A
57 56 adantr ⊢ φ ∧ A ∈ ℕ → if P P pCnt A ∈ ℕ 1 0 ≤ F ⁡ P P pCnt A
58 54 57 eqbrtrrd ⊢ φ ∧ A ∈ ℕ → 1 ≤ F ⁡ P P pCnt A
59 pcdvds ⊢ P ∈ ℙ ∧ A ∈ ℕ → P P pCnt A ∥ A
60 11 27 59 syl2anc ⊢ φ → P P pCnt A ∥ A
61 11 39 syl ⊢ φ → P ∈ ℕ
62 61 55 nnexpcld ⊢ φ → P P pCnt A ∈ ℕ
63 nndivdvds ⊢ A ∈ ℕ ∧ P P pCnt A ∈ ℕ → P P pCnt A ∥ A ↔ A P P pCnt A ∈ ℕ
64 27 62 63 syl2anc ⊢ φ → P P pCnt A ∥ A ↔ A P P pCnt A ∈ ℕ
65 60 64 mpbid ⊢ φ → A P P pCnt A ∈ ℕ
66 65 nnzd ⊢ φ → A P P pCnt A ∈ ℤ
67 66 adantr ⊢ φ ∧ A ∈ ℕ → A P P pCnt A ∈ ℤ
68 27 adantr ⊢ φ ∧ A ∈ ℕ → A ∈ ℕ
69 68 nnrpd ⊢ φ ∧ A ∈ ℕ → A ∈ ℝ +
70 69 rprege0d ⊢ φ ∧ A ∈ ℕ → A ∈ ℝ ∧ 0 ≤ A
71 62 adantr ⊢ φ ∧ A ∈ ℕ → P P pCnt A ∈ ℕ
72 71 nnrpd ⊢ φ ∧ A ∈ ℕ → P P pCnt A ∈ ℝ +
73 sqrtdiv ⊢ A ∈ ℝ ∧ 0 ≤ A ∧ P P pCnt A ∈ ℝ + → A P P pCnt A = A P P pCnt A
74 70 72 73 syl2anc ⊢ φ ∧ A ∈ ℕ → A P P pCnt A = A P P pCnt A
75 nnz ⊢ A ∈ ℕ → A ∈ ℤ
76 znq ⊢ A ∈ ℤ ∧ P P pCnt A ∈ ℕ → A P P pCnt A ∈ ℚ
77 75 53 76 syl2an2 ⊢ φ ∧ A ∈ ℕ → A P P pCnt A ∈ ℚ
78 74 77 eqeltrd ⊢ φ ∧ A ∈ ℕ → A P P pCnt A ∈ ℚ
79 zsqrtelqelz ⊢ A P P pCnt A ∈ ℤ ∧ A P P pCnt A ∈ ℚ → A P P pCnt A ∈ ℤ
80 67 78 79 syl2anc ⊢ φ ∧ A ∈ ℕ → A P P pCnt A ∈ ℤ
81 65 adantr ⊢ φ ∧ A ∈ ℕ → A P P pCnt A ∈ ℕ
82 81 nnrpd ⊢ φ ∧ A ∈ ℕ → A P P pCnt A ∈ ℝ +
83 82 sqrtgt0d ⊢ φ ∧ A ∈ ℕ → 0 < A P P pCnt A
84 elnnz ⊢ A P P pCnt A ∈ ℕ ↔ A P P pCnt A ∈ ℤ ∧ 0 < A P P pCnt A
85 80 83 84 sylanbrc ⊢ φ ∧ A ∈ ℕ → A P P pCnt A ∈ ℕ
86 85 iftrued ⊢ φ ∧ A ∈ ℕ → if A P P pCnt A ∈ ℕ 1 0 = 1
87 fveq2 ⊢ y = A P P pCnt A → y = A P P pCnt A
88 87 eleq1d ⊢ y = A P P pCnt A → y ∈ ℕ ↔ A P P pCnt A ∈ ℕ
89 88 ifbid ⊢ y = A P P pCnt A → if y ∈ ℕ 1 0 = if A P P pCnt A ∈ ℕ 1 0
90 fveq2 ⊢ y = A P P pCnt A → F ⁡ y = F ⁡ A P P pCnt A
91 89 90 breq12d ⊢ y = A P P pCnt A → if y ∈ ℕ 1 0 ≤ F ⁡ y ↔ if A P P pCnt A ∈ ℕ 1 0 ≤ F ⁡ A P P pCnt A
92 nnuz ⊢ ℕ = ℤ ≥ 1
93 65 92 eleqtrdi ⊢ φ → A P P pCnt A ∈ ℤ ≥ 1
94 27 nnzd ⊢ φ → A ∈ ℤ
95 61 nnred ⊢ φ → P ∈ ℝ
96 pcelnn ⊢ P ∈ ℙ ∧ A ∈ ℕ → P pCnt A ∈ ℕ ↔ P ∥ A
97 11 27 96 syl2anc ⊢ φ → P pCnt A ∈ ℕ ↔ P ∥ A
98 12 97 mpbird ⊢ φ → P pCnt A ∈ ℕ
99 prmuz2 ⊢ P ∈ ℙ → P ∈ ℤ ≥ 2
100 eluz2gt1 ⊢ P ∈ ℤ ≥ 2 → 1 < P
101 11 99 100 3syl ⊢ φ → 1 < P
102 expgt1 ⊢ P ∈ ℝ ∧ P pCnt A ∈ ℕ ∧ 1 < P → 1 < P P pCnt A
103 95 98 101 102 syl3anc ⊢ φ → 1 < P P pCnt A
104 1red ⊢ φ → 1 ∈ ℝ
105 0lt1 ⊢ 0 < 1
106 105 a1i ⊢ φ → 0 < 1
107 62 nnred ⊢ φ → P P pCnt A ∈ ℝ
108 62 nngt0d ⊢ φ → 0 < P P pCnt A
109 27 nnred ⊢ φ → A ∈ ℝ
110 27 nngt0d ⊢ φ → 0 < A
111 ltdiv2 ⊢ 1 ∈ ℝ ∧ 0 < 1 ∧ P P pCnt A ∈ ℝ ∧ 0 < P P pCnt A ∧ A ∈ ℝ ∧ 0 < A → 1 < P P pCnt A ↔ A P P pCnt A < A 1
112 104 106 107 108 109 110 111 syl222anc ⊢ φ → 1 < P P pCnt A ↔ A P P pCnt A < A 1
113 103 112 mpbid ⊢ φ → A P P pCnt A < A 1
114 28 div1d ⊢ φ → A 1 = A
115 113 114 breqtrd ⊢ φ → A P P pCnt A < A
116 elfzo2 ⊢ A P P pCnt A ∈ 1 ..^ A ↔ A P P pCnt A ∈ ℤ ≥ 1 ∧ A ∈ ℤ ∧ A P P pCnt A < A
117 93 94 115 116 syl3anbrc ⊢ φ → A P P pCnt A ∈ 1 ..^ A
118 91 13 117 rspcdva ⊢ φ → if A P P pCnt A ∈ ℕ 1 0 ≤ F ⁡ A P P pCnt A
119 118 adantr ⊢ φ ∧ A ∈ ℕ → if A P P pCnt A ∈ ℕ 1 0 ≤ F ⁡ A P P pCnt A
120 86 119 eqbrtrrd ⊢ φ ∧ A ∈ ℕ → 1 ≤ F ⁡ A P P pCnt A
121 1re ⊢ 1 ∈ ℝ
122 0le1 ⊢ 0 ≤ 1
123 121 122 pm3.2i ⊢ 1 ∈ ℝ ∧ 0 ≤ 1
124 123 a1i ⊢ φ ∧ A ∈ ℕ → 1 ∈ ℝ ∧ 0 ≤ 1
125 1 2 3 4 5 6 7 8 9 dchrisum0ff ⊢ φ → F : ℕ ⟶ ℝ
126 125 62 ffvelcdmd ⊢ φ → F ⁡ P P pCnt A ∈ ℝ
127 126 adantr ⊢ φ ∧ A ∈ ℕ → F ⁡ P P pCnt A ∈ ℝ
128 125 65 ffvelcdmd ⊢ φ → F ⁡ A P P pCnt A ∈ ℝ
129 128 adantr ⊢ φ ∧ A ∈ ℕ → F ⁡ A P P pCnt A ∈ ℝ
130 lemul12a ⊢ 1 ∈ ℝ ∧ 0 ≤ 1 ∧ F ⁡ P P pCnt A ∈ ℝ ∧ 1 ∈ ℝ ∧ 0 ≤ 1 ∧ F ⁡ A P P pCnt A ∈ ℝ → 1 ≤ F ⁡ P P pCnt A ∧ 1 ≤ F ⁡ A P P pCnt A → 1 ⋅ 1 ≤ F ⁡ P P pCnt A ⁢ F ⁡ A P P pCnt A
131 124 127 124 129 130 syl22anc ⊢ φ ∧ A ∈ ℕ → 1 ≤ F ⁡ P P pCnt A ∧ 1 ≤ F ⁡ A P P pCnt A → 1 ⋅ 1 ≤ F ⁡ P P pCnt A ⁢ F ⁡ A P P pCnt A
132 58 120 131 mp2and ⊢ φ ∧ A ∈ ℕ → 1 ⋅ 1 ≤ F ⁡ P P pCnt A ⁢ F ⁡ A P P pCnt A
133 16 132 eqbrtrrid ⊢ φ ∧ A ∈ ℕ → 1 ≤ F ⁡ P P pCnt A ⁢ F ⁡ A P P pCnt A
134 0red ⊢ φ → 0 ∈ ℝ
135 0re ⊢ 0 ∈ ℝ
136 121 135 ifcli ⊢ if P P pCnt A ∈ ℕ 1 0 ∈ ℝ
137 136 a1i ⊢ φ → if P P pCnt A ∈ ℕ 1 0 ∈ ℝ
138 breq2 ⊢ 1 = if P P pCnt A ∈ ℕ 1 0 → 0 ≤ 1 ↔ 0 ≤ if P P pCnt A ∈ ℕ 1 0
139 breq2 ⊢ 0 = if P P pCnt A ∈ ℕ 1 0 → 0 ≤ 0 ↔ 0 ≤ if P P pCnt A ∈ ℕ 1 0
140 0le0 ⊢ 0 ≤ 0
141 138 139 122 140 keephyp ⊢ 0 ≤ if P P pCnt A ∈ ℕ 1 0
142 141 a1i ⊢ φ → 0 ≤ if P P pCnt A ∈ ℕ 1 0
143 134 137 126 142 56 letrd ⊢ φ → 0 ≤ F ⁡ P P pCnt A
144 121 135 ifcli ⊢ if A P P pCnt A ∈ ℕ 1 0 ∈ ℝ
145 144 a1i ⊢ φ → if A P P pCnt A ∈ ℕ 1 0 ∈ ℝ
146 breq2 ⊢ 1 = if A P P pCnt A ∈ ℕ 1 0 → 0 ≤ 1 ↔ 0 ≤ if A P P pCnt A ∈ ℕ 1 0
147 breq2 ⊢ 0 = if A P P pCnt A ∈ ℕ 1 0 → 0 ≤ 0 ↔ 0 ≤ if A P P pCnt A ∈ ℕ 1 0
148 146 147 122 140 keephyp ⊢ 0 ≤ if A P P pCnt A ∈ ℕ 1 0
149 148 a1i ⊢ φ → 0 ≤ if A P P pCnt A ∈ ℕ 1 0
150 134 145 128 149 118 letrd ⊢ φ → 0 ≤ F ⁡ A P P pCnt A
151 126 128 143 150 mulge0d ⊢ φ → 0 ≤ F ⁡ P P pCnt A ⁢ F ⁡ A P P pCnt A
152 151 adantr ⊢ φ ∧ ¬ A ∈ ℕ → 0 ≤ F ⁡ P P pCnt A ⁢ F ⁡ A P P pCnt A
153 14 15 133 152 ifbothda ⊢ φ → if A ∈ ℕ 1 0 ≤ F ⁡ P P pCnt A ⁢ F ⁡ A P P pCnt A
154 62 nncnd ⊢ φ → P P pCnt A ∈ ℂ
155 62 nnne0d ⊢ φ → P P pCnt A ≠ 0
156 28 154 155 divcan2d ⊢ φ → P P pCnt A ⁢ A P P pCnt A = A
157 156 fveq2d ⊢ φ → F ⁡ P P pCnt A ⁢ A P P pCnt A = F ⁡ A
158 pcndvds2 ⊢ P ∈ ℙ ∧ A ∈ ℕ → ¬ P ∥ A P P pCnt A
159 11 27 158 syl2anc ⊢ φ → ¬ P ∥ A P P pCnt A
160 coprm ⊢ P ∈ ℙ ∧ A P P pCnt A ∈ ℤ → ¬ P ∥ A P P pCnt A ↔ P gcd A P P pCnt A = 1
161 11 66 160 syl2anc ⊢ φ → ¬ P ∥ A P P pCnt A ↔ P gcd A P P pCnt A = 1
162 159 161 mpbid ⊢ φ → P gcd A P P pCnt A = 1
163 prmz ⊢ P ∈ ℙ → P ∈ ℤ
164 11 163 syl ⊢ φ → P ∈ ℤ
165 rpexp1i ⊢ P ∈ ℤ ∧ A P P pCnt A ∈ ℤ ∧ P pCnt A ∈ ℕ 0 → P gcd A P P pCnt A = 1 → P P pCnt A gcd A P P pCnt A = 1
166 164 66 55 165 syl3anc ⊢ φ → P gcd A P P pCnt A = 1 → P P pCnt A gcd A P P pCnt A = 1
167 162 166 mpd ⊢ φ → P P pCnt A gcd A P P pCnt A = 1
168 1 2 3 4 5 6 7 8 62 65 167 dchrisum0fmul ⊢ φ → F ⁡ P P pCnt A ⁢ A P P pCnt A = F ⁡ P P pCnt A ⁢ F ⁡ A P P pCnt A
169 157 168 eqtr3d ⊢ φ → F ⁡ A = F ⁡ P P pCnt A ⁢ F ⁡ A P P pCnt A
170 153 169 breqtrrd ⊢ φ → if A ∈ ℕ 1 0 ≤ F ⁡ A