Metamath Proof Explorer


Theorem sqff1o

Description: There is a bijection from the squarefree divisors of a number N to the powerset of the prime divisors of N . Among other things, this implies that a number has 2 ^ k squarefree divisors where k is the number of prime divisors, and a squarefree number has 2 ^ k divisors (because all divisors of a squarefree number are squarefree). The inverse function to F takes the product of all the primes in some subset of prime divisors of N . (Contributed by Mario Carneiro, 1-Jul-2015)

Ref Expression
Hypotheses sqff1o.1 ⊢ S = x ∈ ℕ | μ ⁡ x ≠ 0 ∧ x ∥ N
sqff1o.2 ⊢ F = n ∈ S ⟼ p ∈ ℙ | p ∥ n
sqff1o.3 ⊢ G = n ∈ ℕ ⟼ p ∈ ℙ ⟼ p pCnt n
Assertion sqff1o ⊢ N ∈ ℕ → F : S ⟶ 1-1 onto 𝒫 p ∈ ℙ | p ∥ N

Proof

Step Hyp Ref Expression
1 sqff1o.1 ⊢ S = x ∈ ℕ | μ ⁡ x ≠ 0 ∧ x ∥ N
2 sqff1o.2 ⊢ F = n ∈ S ⟼ p ∈ ℙ | p ∥ n
3 sqff1o.3 ⊢ G = n ∈ ℕ ⟼ p ∈ ℙ ⟼ p pCnt n
4 fveq2 ⊢ x = n → μ ⁡ x = μ ⁡ n
5 4 neeq1d ⊢ x = n → μ ⁡ x ≠ 0 ↔ μ ⁡ n ≠ 0
6 breq1 ⊢ x = n → x ∥ N ↔ n ∥ N
7 5 6 anbi12d ⊢ x = n → μ ⁡ x ≠ 0 ∧ x ∥ N ↔ μ ⁡ n ≠ 0 ∧ n ∥ N
8 7 1 elrab2 ⊢ n ∈ S ↔ n ∈ ℕ ∧ μ ⁡ n ≠ 0 ∧ n ∥ N
9 8 simprbi ⊢ n ∈ S → μ ⁡ n ≠ 0 ∧ n ∥ N
10 9 simprd ⊢ n ∈ S → n ∥ N
11 10 ad2antlr ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → n ∥ N
12 prmz ⊢ p ∈ ℙ → p ∈ ℤ
13 12 adantl ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → p ∈ ℤ
14 simplr ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → n ∈ S
15 14 8 sylib ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → n ∈ ℕ ∧ μ ⁡ n ≠ 0 ∧ n ∥ N
16 15 simpld ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → n ∈ ℕ
17 16 nnzd ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → n ∈ ℤ
18 nnz ⊢ N ∈ ℕ → N ∈ ℤ
19 18 ad2antrr ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → N ∈ ℤ
20 dvdstr ⊢ p ∈ ℤ ∧ n ∈ ℤ ∧ N ∈ ℤ → p ∥ n ∧ n ∥ N → p ∥ N
21 13 17 19 20 syl3anc ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → p ∥ n ∧ n ∥ N → p ∥ N
22 11 21 mpan2d ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → p ∥ n → p ∥ N
23 22 ss2rabdv ⊢ N ∈ ℕ ∧ n ∈ S → p ∈ ℙ | p ∥ n ⊆ p ∈ ℙ | p ∥ N
24 prmex ⊢ ℙ ∈ V
25 24 rabex ⊢ p ∈ ℙ | p ∥ n ∈ V
26 25 elpw ⊢ p ∈ ℙ | p ∥ n ∈ 𝒫 p ∈ ℙ | p ∥ N ↔ p ∈ ℙ | p ∥ n ⊆ p ∈ ℙ | p ∥ N
27 23 26 sylibr ⊢ N ∈ ℕ ∧ n ∈ S → p ∈ ℙ | p ∥ n ∈ 𝒫 p ∈ ℙ | p ∥ N
28 cnveq ⊢ y = k ∈ ℙ ⟼ if k ∈ z 1 0 → y -1 = k ∈ ℙ ⟼ if k ∈ z 1 0 -1
29 28 imaeq1d ⊢ y = k ∈ ℙ ⟼ if k ∈ z 1 0 → y -1 ℕ = k ∈ ℙ ⟼ if k ∈ z 1 0 -1 ℕ
30 29 eleq1d ⊢ y = k ∈ ℙ ⟼ if k ∈ z 1 0 → y -1 ℕ ∈ Fin ↔ k ∈ ℙ ⟼ if k ∈ z 1 0 -1 ℕ ∈ Fin
31 1nn0 ⊢ 1 ∈ ℕ 0
32 0nn0 ⊢ 0 ∈ ℕ 0
33 31 32 ifcli ⊢ if k ∈ z 1 0 ∈ ℕ 0
34 33 rgenw ⊢ ∀ k ∈ ℙ if k ∈ z 1 0 ∈ ℕ 0
35 eqid ⊢ k ∈ ℙ ⟼ if k ∈ z 1 0 = k ∈ ℙ ⟼ if k ∈ z 1 0
36 35 fmpt ⊢ ∀ k ∈ ℙ if k ∈ z 1 0 ∈ ℕ 0 ↔ k ∈ ℙ ⟼ if k ∈ z 1 0 : ℙ ⟶ ℕ 0
37 34 36 mpbi ⊢ k ∈ ℙ ⟼ if k ∈ z 1 0 : ℙ ⟶ ℕ 0
38 37 a1i ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → k ∈ ℙ ⟼ if k ∈ z 1 0 : ℙ ⟶ ℕ 0
39 nn0ex ⊢ ℕ 0 ∈ V
40 39 24 elmap ⊢ k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ ℕ 0 ℙ ↔ k ∈ ℙ ⟼ if k ∈ z 1 0 : ℙ ⟶ ℕ 0
41 38 40 sylibr ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ ℕ 0 ℙ
42 fzfi ⊢ 1 … N ∈ Fin
43 ffn ⊢ k ∈ ℙ ⟼ if k ∈ z 1 0 : ℙ ⟶ ℕ 0 → k ∈ ℙ ⟼ if k ∈ z 1 0 Fn ℙ
44 elpreima ⊢ k ∈ ℙ ⟼ if k ∈ z 1 0 Fn ℙ → x ∈ k ∈ ℙ ⟼ if k ∈ z 1 0 -1 ℕ ↔ x ∈ ℙ ∧ k ∈ ℙ ⟼ if k ∈ z 1 0 ⁡ x ∈ ℕ
45 37 43 44 mp2b ⊢ x ∈ k ∈ ℙ ⟼ if k ∈ z 1 0 -1 ℕ ↔ x ∈ ℙ ∧ k ∈ ℙ ⟼ if k ∈ z 1 0 ⁡ x ∈ ℕ
46 elequ1 ⊢ k = x → k ∈ z ↔ x ∈ z
47 46 ifbid ⊢ k = x → if k ∈ z 1 0 = if x ∈ z 1 0
48 31 32 ifcli ⊢ if x ∈ z 1 0 ∈ ℕ 0
49 48 elexi ⊢ if x ∈ z 1 0 ∈ V
50 47 35 49 fvmpt ⊢ x ∈ ℙ → k ∈ ℙ ⟼ if k ∈ z 1 0 ⁡ x = if x ∈ z 1 0
51 50 eleq1d ⊢ x ∈ ℙ → k ∈ ℙ ⟼ if k ∈ z 1 0 ⁡ x ∈ ℕ ↔ if x ∈ z 1 0 ∈ ℕ
52 51 biimpa ⊢ x ∈ ℙ ∧ k ∈ ℙ ⟼ if k ∈ z 1 0 ⁡ x ∈ ℕ → if x ∈ z 1 0 ∈ ℕ
53 45 52 sylbi ⊢ x ∈ k ∈ ℙ ⟼ if k ∈ z 1 0 -1 ℕ → if x ∈ z 1 0 ∈ ℕ
54 0nnn ⊢ ¬ 0 ∈ ℕ
55 iffalse ⊢ ¬ x ∈ z → if x ∈ z 1 0 = 0
56 55 eleq1d ⊢ ¬ x ∈ z → if x ∈ z 1 0 ∈ ℕ ↔ 0 ∈ ℕ
57 54 56 mtbiri ⊢ ¬ x ∈ z → ¬ if x ∈ z 1 0 ∈ ℕ
58 57 con4i ⊢ if x ∈ z 1 0 ∈ ℕ → x ∈ z
59 53 58 syl ⊢ x ∈ k ∈ ℙ ⟼ if k ∈ z 1 0 -1 ℕ → x ∈ z
60 59 ssriv ⊢ k ∈ ℙ ⟼ if k ∈ z 1 0 -1 ℕ ⊆ z
61 elpwi ⊢ z ∈ 𝒫 p ∈ ℙ | p ∥ N → z ⊆ p ∈ ℙ | p ∥ N
62 61 adantl ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → z ⊆ p ∈ ℙ | p ∥ N
63 prmssnn ⊢ ℙ ⊆ ℕ
64 rabss2 ⊢ ℙ ⊆ ℕ → p ∈ ℙ | p ∥ N ⊆ p ∈ ℕ | p ∥ N
65 63 64 ax-mp ⊢ p ∈ ℙ | p ∥ N ⊆ p ∈ ℕ | p ∥ N
66 dvdsssfz1 ⊢ N ∈ ℕ → p ∈ ℕ | p ∥ N ⊆ 1 … N
67 66 adantr ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → p ∈ ℕ | p ∥ N ⊆ 1 … N
68 65 67 sstrid ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → p ∈ ℙ | p ∥ N ⊆ 1 … N
69 62 68 sstrd ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → z ⊆ 1 … N
70 60 69 sstrid ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → k ∈ ℙ ⟼ if k ∈ z 1 0 -1 ℕ ⊆ 1 … N
71 ssfi ⊢ 1 … N ∈ Fin ∧ k ∈ ℙ ⟼ if k ∈ z 1 0 -1 ℕ ⊆ 1 … N → k ∈ ℙ ⟼ if k ∈ z 1 0 -1 ℕ ∈ Fin
72 42 70 71 sylancr ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → k ∈ ℙ ⟼ if k ∈ z 1 0 -1 ℕ ∈ Fin
73 30 41 72 elrabd ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin
74 eqid ⊢ y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin = y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin
75 3 74 1arith ⊢ G : ℕ ⟶ 1-1 onto y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin
76 f1ocnv ⊢ G : ℕ ⟶ 1-1 onto y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin → G -1 : y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin ⟶ 1-1 onto ℕ
77 f1of ⊢ G -1 : y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin ⟶ 1-1 onto ℕ → G -1 : y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin ⟶ ℕ
78 75 76 77 mp2b ⊢ G -1 : y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin ⟶ ℕ
79 78 ffvelcdmi ⊢ k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin → G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ ℕ
80 73 79 syl ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ ℕ
81 f1ocnvfv2 ⊢ G : ℕ ⟶ 1-1 onto y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin ∧ k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin → G ⁡ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 = k ∈ ℙ ⟼ if k ∈ z 1 0
82 75 73 81 sylancr ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → G ⁡ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 = k ∈ ℙ ⟼ if k ∈ z 1 0
83 3 1arithlem1 ⊢ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ ℕ → G ⁡ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 = p ∈ ℙ ⟼ p pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0
84 80 83 syl ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → G ⁡ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 = p ∈ ℙ ⟼ p pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0
85 82 84 eqtr3d ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → k ∈ ℙ ⟼ if k ∈ z 1 0 = p ∈ ℙ ⟼ p pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0
86 85 fveq1d ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → k ∈ ℙ ⟼ if k ∈ z 1 0 ⁡ q = p ∈ ℙ ⟼ p pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ⁡ q
87 elequ1 ⊢ k = q → k ∈ z ↔ q ∈ z
88 87 ifbid ⊢ k = q → if k ∈ z 1 0 = if q ∈ z 1 0
89 31 32 ifcli ⊢ if q ∈ z 1 0 ∈ ℕ 0
90 89 elexi ⊢ if q ∈ z 1 0 ∈ V
91 88 35 90 fvmpt ⊢ q ∈ ℙ → k ∈ ℙ ⟼ if k ∈ z 1 0 ⁡ q = if q ∈ z 1 0
92 86 91 sylan9req ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ ℙ → p ∈ ℙ ⟼ p pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ⁡ q = if q ∈ z 1 0
93 oveq1 ⊢ p = q → p pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 = q pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0
94 eqid ⊢ p ∈ ℙ ⟼ p pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 = p ∈ ℙ ⟼ p pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0
95 ovex ⊢ q pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ V
96 93 94 95 fvmpt ⊢ q ∈ ℙ → p ∈ ℙ ⟼ p pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ⁡ q = q pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0
97 96 adantl ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ ℙ → p ∈ ℙ ⟼ p pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ⁡ q = q pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0
98 92 97 eqtr3d ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ ℙ → if q ∈ z 1 0 = q pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0
99 breq1 ⊢ 1 = if q ∈ z 1 0 → 1 ≤ 1 ↔ if q ∈ z 1 0 ≤ 1
100 breq1 ⊢ 0 = if q ∈ z 1 0 → 0 ≤ 1 ↔ if q ∈ z 1 0 ≤ 1
101 1le1 ⊢ 1 ≤ 1
102 0le1 ⊢ 0 ≤ 1
103 99 100 101 102 keephyp ⊢ if q ∈ z 1 0 ≤ 1
104 98 103 eqbrtrrdi ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ ℙ → q pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ≤ 1
105 104 ralrimiva ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → ∀ q ∈ ℙ q pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ≤ 1
106 issqf ⊢ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ ℕ → μ ⁡ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ≠ 0 ↔ ∀ q ∈ ℙ q pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ≤ 1
107 80 106 syl ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → μ ⁡ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ≠ 0 ↔ ∀ q ∈ ℙ q pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ≤ 1
108 105 107 mpbird ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → μ ⁡ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ≠ 0
109 iftrue ⊢ q ∈ z → if q ∈ z 1 0 = 1
110 109 adantl ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ z → if q ∈ z 1 0 = 1
111 62 sselda ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ z → q ∈ p ∈ ℙ | p ∥ N
112 breq1 ⊢ p = q → p ∥ N ↔ q ∥ N
113 112 elrab ⊢ q ∈ p ∈ ℙ | p ∥ N ↔ q ∈ ℙ ∧ q ∥ N
114 111 113 sylib ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ z → q ∈ ℙ ∧ q ∥ N
115 114 simprd ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ z → q ∥ N
116 114 simpld ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ z → q ∈ ℙ
117 simpll ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ z → N ∈ ℕ
118 pcelnn ⊢ q ∈ ℙ ∧ N ∈ ℕ → q pCnt N ∈ ℕ ↔ q ∥ N
119 116 117 118 syl2anc ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ z → q pCnt N ∈ ℕ ↔ q ∥ N
120 115 119 mpbird ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ z → q pCnt N ∈ ℕ
121 120 nnge1d ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ z → 1 ≤ q pCnt N
122 110 121 eqbrtrd ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ z → if q ∈ z 1 0 ≤ q pCnt N
123 122 ex ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → q ∈ z → if q ∈ z 1 0 ≤ q pCnt N
124 123 adantr ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ ℙ → q ∈ z → if q ∈ z 1 0 ≤ q pCnt N
125 simpr ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ ℙ → q ∈ ℙ
126 18 ad2antrr ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ ℙ → N ∈ ℤ
127 pcge0 ⊢ q ∈ ℙ ∧ N ∈ ℤ → 0 ≤ q pCnt N
128 125 126 127 syl2anc ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ ℙ → 0 ≤ q pCnt N
129 iffalse ⊢ ¬ q ∈ z → if q ∈ z 1 0 = 0
130 129 breq1d ⊢ ¬ q ∈ z → if q ∈ z 1 0 ≤ q pCnt N ↔ 0 ≤ q pCnt N
131 128 130 syl5ibrcom ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ ℙ → ¬ q ∈ z → if q ∈ z 1 0 ≤ q pCnt N
132 124 131 pm2.61d ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ ℙ → if q ∈ z 1 0 ≤ q pCnt N
133 98 132 eqbrtrrd ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ q ∈ ℙ → q pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ≤ q pCnt N
134 133 ralrimiva ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → ∀ q ∈ ℙ q pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ≤ q pCnt N
135 80 nnzd ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ ℤ
136 18 adantr ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → N ∈ ℤ
137 pc2dvds ⊢ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ ℤ ∧ N ∈ ℤ → G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∥ N ↔ ∀ q ∈ ℙ q pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ≤ q pCnt N
138 135 136 137 syl2anc ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∥ N ↔ ∀ q ∈ ℙ q pCnt G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ≤ q pCnt N
139 134 138 mpbird ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∥ N
140 108 139 jca ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → μ ⁡ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ≠ 0 ∧ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∥ N
141 fveq2 ⊢ x = G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 → μ ⁡ x = μ ⁡ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0
142 141 neeq1d ⊢ x = G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 → μ ⁡ x ≠ 0 ↔ μ ⁡ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ≠ 0
143 breq1 ⊢ x = G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 → x ∥ N ↔ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∥ N
144 142 143 anbi12d ⊢ x = G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 → μ ⁡ x ≠ 0 ∧ x ∥ N ↔ μ ⁡ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ≠ 0 ∧ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∥ N
145 144 1 elrab2 ⊢ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ S ↔ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ ℕ ∧ μ ⁡ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ≠ 0 ∧ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∥ N
146 80 140 145 sylanbrc ⊢ N ∈ ℕ ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ S
147 eqcom ⊢ n = G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ↔ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 = n
148 8 simplbi ⊢ n ∈ S → n ∈ ℕ
149 148 ad2antrl ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → n ∈ ℕ
150 24 mptex ⊢ p ∈ ℙ ⟼ p pCnt n ∈ V
151 3 fvmpt2 ⊢ n ∈ ℕ ∧ p ∈ ℙ ⟼ p pCnt n ∈ V → G ⁡ n = p ∈ ℙ ⟼ p pCnt n
152 149 150 151 sylancl ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → G ⁡ n = p ∈ ℙ ⟼ p pCnt n
153 152 eqeq1d ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → G ⁡ n = k ∈ ℙ ⟼ if k ∈ z 1 0 ↔ p ∈ ℙ ⟼ p pCnt n = k ∈ ℙ ⟼ if k ∈ z 1 0
154 75 a1i ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → G : ℕ ⟶ 1-1 onto y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin
155 73 adantrl ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin
156 f1ocnvfvb ⊢ G : ℕ ⟶ 1-1 onto y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin ∧ n ∈ ℕ ∧ k ∈ ℙ ⟼ if k ∈ z 1 0 ∈ y ∈ ℕ 0 ℙ | y -1 ℕ ∈ Fin → G ⁡ n = k ∈ ℙ ⟼ if k ∈ z 1 0 ↔ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 = n
157 154 149 155 156 syl3anc ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → G ⁡ n = k ∈ ℙ ⟼ if k ∈ z 1 0 ↔ G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 = n
158 24 a1i ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → ℙ ∈ V
159 0cnd ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → 0 ∈ ℂ
160 1cnd ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → 1 ∈ ℂ
161 0ne1 ⊢ 0 ≠ 1
162 161 a1i ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → 0 ≠ 1
163 158 159 160 162 pw2f1olem ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → z ∈ 𝒫 ℙ ∧ p ∈ ℙ ⟼ p pCnt n = k ∈ ℙ ⟼ if k ∈ z 1 0 ↔ p ∈ ℙ ⟼ p pCnt n ∈ 0 1 ℙ ∧ z = p ∈ ℙ ⟼ p pCnt n -1 1
164 ssrab2 ⊢ p ∈ ℙ | p ∥ N ⊆ ℙ
165 164 sspwi ⊢ 𝒫 p ∈ ℙ | p ∥ N ⊆ 𝒫 ℙ
166 simprr ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → z ∈ 𝒫 p ∈ ℙ | p ∥ N
167 165 166 sselid ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → z ∈ 𝒫 ℙ
168 167 biantrurd ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → p ∈ ℙ ⟼ p pCnt n = k ∈ ℙ ⟼ if k ∈ z 1 0 ↔ z ∈ 𝒫 ℙ ∧ p ∈ ℙ ⟼ p pCnt n = k ∈ ℙ ⟼ if k ∈ z 1 0
169 id ⊢ p ∈ ℙ → p ∈ ℙ
170 148 adantl ⊢ N ∈ ℕ ∧ n ∈ S → n ∈ ℕ
171 pccl ⊢ p ∈ ℙ ∧ n ∈ ℕ → p pCnt n ∈ ℕ 0
172 169 170 171 syl2anr ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → p pCnt n ∈ ℕ 0
173 elnn0 ⊢ p pCnt n ∈ ℕ 0 ↔ p pCnt n ∈ ℕ ∨ p pCnt n = 0
174 172 173 sylib ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → p pCnt n ∈ ℕ ∨ p pCnt n = 0
175 174 orcomd ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → p pCnt n = 0 ∨ p pCnt n ∈ ℕ
176 9 simpld ⊢ n ∈ S → μ ⁡ n ≠ 0
177 176 adantl ⊢ N ∈ ℕ ∧ n ∈ S → μ ⁡ n ≠ 0
178 issqf ⊢ n ∈ ℕ → μ ⁡ n ≠ 0 ↔ ∀ p ∈ ℙ p pCnt n ≤ 1
179 170 178 syl ⊢ N ∈ ℕ ∧ n ∈ S → μ ⁡ n ≠ 0 ↔ ∀ p ∈ ℙ p pCnt n ≤ 1
180 177 179 mpbid ⊢ N ∈ ℕ ∧ n ∈ S → ∀ p ∈ ℙ p pCnt n ≤ 1
181 180 r19.21bi ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → p pCnt n ≤ 1
182 nnle1eq1 ⊢ p pCnt n ∈ ℕ → p pCnt n ≤ 1 ↔ p pCnt n = 1
183 181 182 syl5ibcom ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → p pCnt n ∈ ℕ → p pCnt n = 1
184 183 orim2d ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → p pCnt n = 0 ∨ p pCnt n ∈ ℕ → p pCnt n = 0 ∨ p pCnt n = 1
185 175 184 mpd ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → p pCnt n = 0 ∨ p pCnt n = 1
186 ovex ⊢ p pCnt n ∈ V
187 186 elpr ⊢ p pCnt n ∈ 0 1 ↔ p pCnt n = 0 ∨ p pCnt n = 1
188 185 187 sylibr ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → p pCnt n ∈ 0 1
189 188 fmpttd ⊢ N ∈ ℕ ∧ n ∈ S → p ∈ ℙ ⟼ p pCnt n : ℙ ⟶ 0 1
190 189 adantrr ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → p ∈ ℙ ⟼ p pCnt n : ℙ ⟶ 0 1
191 prex ⊢ 0 1 ∈ V
192 191 24 elmap ⊢ p ∈ ℙ ⟼ p pCnt n ∈ 0 1 ℙ ↔ p ∈ ℙ ⟼ p pCnt n : ℙ ⟶ 0 1
193 190 192 sylibr ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → p ∈ ℙ ⟼ p pCnt n ∈ 0 1 ℙ
194 193 biantrurd ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → z = p ∈ ℙ ⟼ p pCnt n -1 1 ↔ p ∈ ℙ ⟼ p pCnt n ∈ 0 1 ℙ ∧ z = p ∈ ℙ ⟼ p pCnt n -1 1
195 163 168 194 3bitr4d ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → p ∈ ℙ ⟼ p pCnt n = k ∈ ℙ ⟼ if k ∈ z 1 0 ↔ z = p ∈ ℙ ⟼ p pCnt n -1 1
196 eqid ⊢ p ∈ ℙ ⟼ p pCnt n = p ∈ ℙ ⟼ p pCnt n
197 196 mptiniseg ⊢ 1 ∈ ℕ 0 → p ∈ ℙ ⟼ p pCnt n -1 1 = p ∈ ℙ | p pCnt n = 1
198 31 197 ax-mp ⊢ p ∈ ℙ ⟼ p pCnt n -1 1 = p ∈ ℙ | p pCnt n = 1
199 id ⊢ p pCnt n = 1 → p pCnt n = 1
200 1nn ⊢ 1 ∈ ℕ
201 199 200 eqeltrdi ⊢ p pCnt n = 1 → p pCnt n ∈ ℕ
202 201 183 impbid2 ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → p pCnt n = 1 ↔ p pCnt n ∈ ℕ
203 simpr ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → p ∈ ℙ
204 pcelnn ⊢ p ∈ ℙ ∧ n ∈ ℕ → p pCnt n ∈ ℕ ↔ p ∥ n
205 203 16 204 syl2anc ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → p pCnt n ∈ ℕ ↔ p ∥ n
206 202 205 bitrd ⊢ N ∈ ℕ ∧ n ∈ S ∧ p ∈ ℙ → p pCnt n = 1 ↔ p ∥ n
207 206 rabbidva ⊢ N ∈ ℕ ∧ n ∈ S → p ∈ ℙ | p pCnt n = 1 = p ∈ ℙ | p ∥ n
208 207 adantrr ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → p ∈ ℙ | p pCnt n = 1 = p ∈ ℙ | p ∥ n
209 198 208 eqtrid ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → p ∈ ℙ ⟼ p pCnt n -1 1 = p ∈ ℙ | p ∥ n
210 209 eqeq2d ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → z = p ∈ ℙ ⟼ p pCnt n -1 1 ↔ z = p ∈ ℙ | p ∥ n
211 195 210 bitrd ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → p ∈ ℙ ⟼ p pCnt n = k ∈ ℙ ⟼ if k ∈ z 1 0 ↔ z = p ∈ ℙ | p ∥ n
212 153 157 211 3bitr3d ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 = n ↔ z = p ∈ ℙ | p ∥ n
213 147 212 bitrid ⊢ N ∈ ℕ ∧ n ∈ S ∧ z ∈ 𝒫 p ∈ ℙ | p ∥ N → n = G -1 ⁡ k ∈ ℙ ⟼ if k ∈ z 1 0 ↔ z = p ∈ ℙ | p ∥ n
214 2 27 146 213 f1o2d ⊢ N ∈ ℕ → F : S ⟶ 1-1 onto 𝒫 p ∈ ℙ | p ∥ N