ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  phisum GIF version

Theorem phisum 12103
Description: The divisor sum identity of the totient function. Theorem 2.2 in [ApostolNT] p. 26. (Contributed by Stefan O'Rear, 12-Sep-2015.)
Assertion
Ref Expression
phisum (𝑁 ∈ ℕ → Σ𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (ϕ‘𝑑) = 𝑁)
Distinct variable group:   𝑥,𝑁,𝑑

Proof of Theorem phisum
Dummy variables 𝑧 𝑦 𝑤 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq1 3968 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝑁𝑦𝑁))
21elrab 2868 . . . . 5 (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ↔ (𝑦 ∈ ℕ ∧ 𝑦𝑁))
3 hashgcdeq 12102 . . . . . . 7 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ ℕ) → (♯‘{𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = if(𝑦𝑁, (ϕ‘(𝑁 / 𝑦)), 0))
43adantrr 471 . . . . . 6 ((𝑁 ∈ ℕ ∧ (𝑦 ∈ ℕ ∧ 𝑦𝑁)) → (♯‘{𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = if(𝑦𝑁, (ϕ‘(𝑁 / 𝑦)), 0))
5 iftrue 3510 . . . . . . 7 (𝑦𝑁 → if(𝑦𝑁, (ϕ‘(𝑁 / 𝑦)), 0) = (ϕ‘(𝑁 / 𝑦)))
65ad2antll 483 . . . . . 6 ((𝑁 ∈ ℕ ∧ (𝑦 ∈ ℕ ∧ 𝑦𝑁)) → if(𝑦𝑁, (ϕ‘(𝑁 / 𝑦)), 0) = (ϕ‘(𝑁 / 𝑦)))
74, 6eqtrd 2190 . . . . 5 ((𝑁 ∈ ℕ ∧ (𝑦 ∈ ℕ ∧ 𝑦𝑁)) → (♯‘{𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = (ϕ‘(𝑁 / 𝑦)))
82, 7sylan2b 285 . . . 4 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → (♯‘{𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = (ϕ‘(𝑁 / 𝑦)))
98sumeq2dv 11258 . . 3 (𝑁 ∈ ℕ → Σ𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (♯‘{𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = Σ𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (ϕ‘(𝑁 / 𝑦)))
10 1zzd 9188 . . . . . 6 (𝑁 ∈ ℕ → 1 ∈ ℤ)
11 nnz 9180 . . . . . 6 (𝑁 ∈ ℕ → 𝑁 ∈ ℤ)
1210, 11fzfigd 10323 . . . . 5 (𝑁 ∈ ℕ → (1...𝑁) ∈ Fin)
13 dvdsssfz1 11736 . . . . 5 (𝑁 ∈ ℕ → {𝑥 ∈ ℕ ∣ 𝑥𝑁} ⊆ (1...𝑁))
14 elfznn 9949 . . . . . . . 8 (𝑗 ∈ (1...𝑁) → 𝑗 ∈ ℕ)
15 dvdsdc 11687 . . . . . . . 8 ((𝑗 ∈ ℕ ∧ 𝑁 ∈ ℤ) → DECID 𝑗𝑁)
1614, 11, 15syl2anr 288 . . . . . . 7 ((𝑁 ∈ ℕ ∧ 𝑗 ∈ (1...𝑁)) → DECID 𝑗𝑁)
17 ibar 299 . . . . . . . . . . 11 (𝑗 ∈ ℕ → (𝑗𝑁 ↔ (𝑗 ∈ ℕ ∧ 𝑗𝑁)))
1814, 17syl 14 . . . . . . . . . 10 (𝑗 ∈ (1...𝑁) → (𝑗𝑁 ↔ (𝑗 ∈ ℕ ∧ 𝑗𝑁)))
19 breq1 3968 . . . . . . . . . . 11 (𝑥 = 𝑗 → (𝑥𝑁𝑗𝑁))
2019elrab 2868 . . . . . . . . . 10 (𝑗 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ↔ (𝑗 ∈ ℕ ∧ 𝑗𝑁))
2118, 20bitr4di 197 . . . . . . . . 9 (𝑗 ∈ (1...𝑁) → (𝑗𝑁𝑗 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}))
2221dcbid 824 . . . . . . . 8 (𝑗 ∈ (1...𝑁) → (DECID 𝑗𝑁DECID 𝑗 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}))
2322adantl 275 . . . . . . 7 ((𝑁 ∈ ℕ ∧ 𝑗 ∈ (1...𝑁)) → (DECID 𝑗𝑁DECID 𝑗 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}))
2416, 23mpbid 146 . . . . . 6 ((𝑁 ∈ ℕ ∧ 𝑗 ∈ (1...𝑁)) → DECID 𝑗 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁})
2524ralrimiva 2530 . . . . 5 (𝑁 ∈ ℕ → ∀𝑗 ∈ (1...𝑁)DECID 𝑗 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁})
26 ssfidc 6876 . . . . 5 (((1...𝑁) ∈ Fin ∧ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ⊆ (1...𝑁) ∧ ∀𝑗 ∈ (1...𝑁)DECID 𝑗 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → {𝑥 ∈ ℕ ∣ 𝑥𝑁} ∈ Fin)
2712, 13, 25, 26syl3anc 1220 . . . 4 (𝑁 ∈ ℕ → {𝑥 ∈ ℕ ∣ 𝑥𝑁} ∈ Fin)
28 0z 9172 . . . . . . 7 0 ∈ ℤ
29 fzofig 10324 . . . . . . 7 ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0..^𝑁) ∈ Fin)
3028, 11, 29sylancr 411 . . . . . 6 (𝑁 ∈ ℕ → (0..^𝑁) ∈ Fin)
3130adantr 274 . . . . 5 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → (0..^𝑁) ∈ Fin)
32 ssrab2 3213 . . . . . 6 {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} ⊆ (0..^𝑁)
3332a1i 9 . . . . 5 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} ⊆ (0..^𝑁))
34 elfzoelz 10039 . . . . . . . . . . 11 (𝑗 ∈ (0..^𝑁) → 𝑗 ∈ ℤ)
3534adantl 275 . . . . . . . . . 10 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → 𝑗 ∈ ℤ)
3611ad2antrr 480 . . . . . . . . . 10 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → 𝑁 ∈ ℤ)
3735, 36gcdcld 11843 . . . . . . . . 9 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → (𝑗 gcd 𝑁) ∈ ℕ0)
3837nn0zd 9278 . . . . . . . 8 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → (𝑗 gcd 𝑁) ∈ ℤ)
39 elrabi 2865 . . . . . . . . . 10 (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} → 𝑦 ∈ ℕ)
4039ad2antlr 481 . . . . . . . . 9 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → 𝑦 ∈ ℕ)
4140nnzd 9279 . . . . . . . 8 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → 𝑦 ∈ ℤ)
42 zdceq 9233 . . . . . . . 8 (((𝑗 gcd 𝑁) ∈ ℤ ∧ 𝑦 ∈ ℤ) → DECID (𝑗 gcd 𝑁) = 𝑦)
4338, 41, 42syl2anc 409 . . . . . . 7 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → DECID (𝑗 gcd 𝑁) = 𝑦)
44 ibar 299 . . . . . . . . . 10 (𝑗 ∈ (0..^𝑁) → ((𝑗 gcd 𝑁) = 𝑦 ↔ (𝑗 ∈ (0..^𝑁) ∧ (𝑗 gcd 𝑁) = 𝑦)))
45 oveq1 5828 . . . . . . . . . . . 12 (𝑧 = 𝑗 → (𝑧 gcd 𝑁) = (𝑗 gcd 𝑁))
4645eqeq1d 2166 . . . . . . . . . . 11 (𝑧 = 𝑗 → ((𝑧 gcd 𝑁) = 𝑦 ↔ (𝑗 gcd 𝑁) = 𝑦))
4746elrab 2868 . . . . . . . . . 10 (𝑗 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} ↔ (𝑗 ∈ (0..^𝑁) ∧ (𝑗 gcd 𝑁) = 𝑦))
4844, 47bitr4di 197 . . . . . . . . 9 (𝑗 ∈ (0..^𝑁) → ((𝑗 gcd 𝑁) = 𝑦𝑗 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}))
4948dcbid 824 . . . . . . . 8 (𝑗 ∈ (0..^𝑁) → (DECID (𝑗 gcd 𝑁) = 𝑦DECID 𝑗 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}))
5049adantl 275 . . . . . . 7 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → (DECID (𝑗 gcd 𝑁) = 𝑦DECID 𝑗 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}))
5143, 50mpbid 146 . . . . . 6 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → DECID 𝑗 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦})
5251ralrimiva 2530 . . . . 5 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → ∀𝑗 ∈ (0..^𝑁)DECID 𝑗 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦})
53 ssfidc 6876 . . . . 5 (((0..^𝑁) ∈ Fin ∧ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} ⊆ (0..^𝑁) ∧ ∀𝑗 ∈ (0..^𝑁)DECID 𝑗 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) → {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} ∈ Fin)
5431, 33, 52, 53syl3anc 1220 . . . 4 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} ∈ Fin)
55 oveq1 5828 . . . . . . . . . 10 (𝑧 = 𝑤 → (𝑧 gcd 𝑁) = (𝑤 gcd 𝑁))
5655eqeq1d 2166 . . . . . . . . 9 (𝑧 = 𝑤 → ((𝑧 gcd 𝑁) = 𝑦 ↔ (𝑤 gcd 𝑁) = 𝑦))
5756elrab 2868 . . . . . . . 8 (𝑤 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} ↔ (𝑤 ∈ (0..^𝑁) ∧ (𝑤 gcd 𝑁) = 𝑦))
5857simprbi 273 . . . . . . 7 (𝑤 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} → (𝑤 gcd 𝑁) = 𝑦)
5958rgen 2510 . . . . . 6 𝑤 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} (𝑤 gcd 𝑁) = 𝑦
6059rgenw 2512 . . . . 5 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}∀𝑤 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} (𝑤 gcd 𝑁) = 𝑦
61 invdisj 3959 . . . . 5 (∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}∀𝑤 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} (𝑤 gcd 𝑁) = 𝑦Disj 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦})
6260, 61mp1i 10 . . . 4 (𝑁 ∈ ℕ → Disj 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦})
6327, 54, 62hashiun 11368 . . 3 (𝑁 ∈ ℕ → (♯‘ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = Σ𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (♯‘{𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}))
64 fveq2 5467 . . . 4 (𝑑 = (𝑁 / 𝑦) → (ϕ‘𝑑) = (ϕ‘(𝑁 / 𝑦)))
65 eqid 2157 . . . . 5 {𝑥 ∈ ℕ ∣ 𝑥𝑁} = {𝑥 ∈ ℕ ∣ 𝑥𝑁}
66 eqid 2157 . . . . 5 (𝑧 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ↦ (𝑁 / 𝑧)) = (𝑧 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ↦ (𝑁 / 𝑧))
6765, 66dvdsflip 11735 . . . 4 (𝑁 ∈ ℕ → (𝑧 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ↦ (𝑁 / 𝑧)):{𝑥 ∈ ℕ ∣ 𝑥𝑁}–1-1-onto→{𝑥 ∈ ℕ ∣ 𝑥𝑁})
68 oveq2 5829 . . . . 5 (𝑧 = 𝑦 → (𝑁 / 𝑧) = (𝑁 / 𝑦))
69 simpr 109 . . . . 5 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁})
7011adantr 274 . . . . . 6 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → 𝑁 ∈ ℤ)
7139adantl 275 . . . . . 6 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → 𝑦 ∈ ℕ)
72 znq 9526 . . . . . 6 ((𝑁 ∈ ℤ ∧ 𝑦 ∈ ℕ) → (𝑁 / 𝑦) ∈ ℚ)
7370, 71, 72syl2anc 409 . . . . 5 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → (𝑁 / 𝑦) ∈ ℚ)
7466, 68, 69, 73fvmptd3 5560 . . . 4 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → ((𝑧 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ↦ (𝑁 / 𝑧))‘𝑦) = (𝑁 / 𝑦))
75 elrabi 2865 . . . . . . 7 (𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} → 𝑑 ∈ ℕ)
7675adantl 275 . . . . . 6 ((𝑁 ∈ ℕ ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → 𝑑 ∈ ℕ)
7776phicld 12081 . . . . 5 ((𝑁 ∈ ℕ ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → (ϕ‘𝑑) ∈ ℕ)
7877nncnd 8841 . . . 4 ((𝑁 ∈ ℕ ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → (ϕ‘𝑑) ∈ ℂ)
7964, 27, 67, 74, 78fsumf1o 11280 . . 3 (𝑁 ∈ ℕ → Σ𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (ϕ‘𝑑) = Σ𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (ϕ‘(𝑁 / 𝑦)))
809, 63, 793eqtr4rd 2201 . 2 (𝑁 ∈ ℕ → Σ𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (ϕ‘𝑑) = (♯‘ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}))
81 iunrab 3896 . . . . 5 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} = {𝑧 ∈ (0..^𝑁) ∣ ∃𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (𝑧 gcd 𝑁) = 𝑦}
82 breq1 3968 . . . . . . . . 9 (𝑥 = (𝑧 gcd 𝑁) → (𝑥𝑁 ↔ (𝑧 gcd 𝑁) ∥ 𝑁))
83 elfzoelz 10039 . . . . . . . . . . 11 (𝑧 ∈ (0..^𝑁) → 𝑧 ∈ ℤ)
8483adantl 275 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → 𝑧 ∈ ℤ)
8511adantr 274 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → 𝑁 ∈ ℤ)
86 nnne0 8855 . . . . . . . . . . . . 13 (𝑁 ∈ ℕ → 𝑁 ≠ 0)
8786neneqd 2348 . . . . . . . . . . . 12 (𝑁 ∈ ℕ → ¬ 𝑁 = 0)
8887intnand 917 . . . . . . . . . . 11 (𝑁 ∈ ℕ → ¬ (𝑧 = 0 ∧ 𝑁 = 0))
8988adantr 274 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → ¬ (𝑧 = 0 ∧ 𝑁 = 0))
90 gcdn0cl 11837 . . . . . . . . . 10 (((𝑧 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑧 = 0 ∧ 𝑁 = 0)) → (𝑧 gcd 𝑁) ∈ ℕ)
9184, 85, 89, 90syl21anc 1219 . . . . . . . . 9 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → (𝑧 gcd 𝑁) ∈ ℕ)
92 gcddvds 11838 . . . . . . . . . . 11 ((𝑧 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑧 gcd 𝑁) ∥ 𝑧 ∧ (𝑧 gcd 𝑁) ∥ 𝑁))
9384, 85, 92syl2anc 409 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → ((𝑧 gcd 𝑁) ∥ 𝑧 ∧ (𝑧 gcd 𝑁) ∥ 𝑁))
9493simprd 113 . . . . . . . . 9 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → (𝑧 gcd 𝑁) ∥ 𝑁)
9582, 91, 94elrabd 2870 . . . . . . . 8 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → (𝑧 gcd 𝑁) ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁})
96 clel5 2849 . . . . . . . 8 ((𝑧 gcd 𝑁) ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ↔ ∃𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (𝑧 gcd 𝑁) = 𝑦)
9795, 96sylib 121 . . . . . . 7 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → ∃𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (𝑧 gcd 𝑁) = 𝑦)
9897ralrimiva 2530 . . . . . 6 (𝑁 ∈ ℕ → ∀𝑧 ∈ (0..^𝑁)∃𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (𝑧 gcd 𝑁) = 𝑦)
99 rabid2 2633 . . . . . 6 ((0..^𝑁) = {𝑧 ∈ (0..^𝑁) ∣ ∃𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (𝑧 gcd 𝑁) = 𝑦} ↔ ∀𝑧 ∈ (0..^𝑁)∃𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (𝑧 gcd 𝑁) = 𝑦)
10098, 99sylibr 133 . . . . 5 (𝑁 ∈ ℕ → (0..^𝑁) = {𝑧 ∈ (0..^𝑁) ∣ ∃𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (𝑧 gcd 𝑁) = 𝑦})
10181, 100eqtr4id 2209 . . . 4 (𝑁 ∈ ℕ → 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} = (0..^𝑁))
102101fveq2d 5471 . . 3 (𝑁 ∈ ℕ → (♯‘ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = (♯‘(0..^𝑁)))
103 nnnn0 9091 . . . 4 (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0)
104 hashfzo0 10690 . . . 4 (𝑁 ∈ ℕ0 → (♯‘(0..^𝑁)) = 𝑁)
105103, 104syl 14 . . 3 (𝑁 ∈ ℕ → (♯‘(0..^𝑁)) = 𝑁)
106102, 105eqtrd 2190 . 2 (𝑁 ∈ ℕ → (♯‘ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = 𝑁)
10780, 106eqtrd 2190 1 (𝑁 ∈ ℕ → Σ𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (ϕ‘𝑑) = 𝑁)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wb 104  DECID wdc 820   = wceq 1335  wcel 2128  wral 2435  wrex 2436  {crab 2439  wss 3102  ifcif 3505   ciun 3849  Disj wdisj 3942   class class class wbr 3965  cmpt 4025  cfv 5169  (class class class)co 5821  Fincfn 6682  0cc0 7726  1c1 7727   / cdiv 8539  cn 8827  0cn0 9084  cz 9161  cq 9521  ...cfz 9905  ..^cfzo 10034  chash 10642  Σcsu 11243  cdvds 11676   gcd cgcd 11821  ϕcphi 12073
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-13 2130  ax-14 2131  ax-ext 2139  ax-coll 4079  ax-sep 4082  ax-nul 4090  ax-pow 4135  ax-pr 4169  ax-un 4393  ax-setind 4495  ax-iinf 4546  ax-cnex 7817  ax-resscn 7818  ax-1cn 7819  ax-1re 7820  ax-icn 7821  ax-addcl 7822  ax-addrcl 7823  ax-mulcl 7824  ax-mulrcl 7825  ax-addcom 7826  ax-mulcom 7827  ax-addass 7828  ax-mulass 7829  ax-distr 7830  ax-i2m1 7831  ax-0lt1 7832  ax-1rid 7833  ax-0id 7834  ax-rnegex 7835  ax-precex 7836  ax-cnre 7837  ax-pre-ltirr 7838  ax-pre-ltwlin 7839  ax-pre-lttrn 7840  ax-pre-apti 7841  ax-pre-ltadd 7842  ax-pre-mulgt0 7843  ax-pre-mulext 7844  ax-arch 7845  ax-caucvg 7846
This theorem depends on definitions:  df-bi 116  df-stab 817  df-dc 821  df-3or 964  df-3an 965  df-tru 1338  df-fal 1341  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ne 2328  df-nel 2423  df-ral 2440  df-rex 2441  df-reu 2442  df-rmo 2443  df-rab 2444  df-v 2714  df-sbc 2938  df-csb 3032  df-dif 3104  df-un 3106  df-in 3108  df-ss 3115  df-nul 3395  df-if 3506  df-pw 3545  df-sn 3566  df-pr 3567  df-op 3569  df-uni 3773  df-int 3808  df-iun 3851  df-disj 3943  df-br 3966  df-opab 4026  df-mpt 4027  df-tr 4063  df-id 4253  df-po 4256  df-iso 4257  df-iord 4326  df-on 4328  df-ilim 4329  df-suc 4331  df-iom 4549  df-xp 4591  df-rel 4592  df-cnv 4593  df-co 4594  df-dm 4595  df-rn 4596  df-res 4597  df-ima 4598  df-iota 5134  df-fun 5171  df-fn 5172  df-f 5173  df-f1 5174  df-fo 5175  df-f1o 5176  df-fv 5177  df-isom 5178  df-riota 5777  df-ov 5824  df-oprab 5825  df-mpo 5826  df-1st 6085  df-2nd 6086  df-recs 6249  df-irdg 6314  df-frec 6335  df-1o 6360  df-oadd 6364  df-er 6477  df-en 6683  df-dom 6684  df-fin 6685  df-sup 6924  df-pnf 7908  df-mnf 7909  df-xr 7910  df-ltxr 7911  df-le 7912  df-sub 8042  df-neg 8043  df-reap 8444  df-ap 8451  df-div 8540  df-inn 8828  df-2 8886  df-3 8887  df-4 8888  df-n0 9085  df-z 9162  df-uz 9434  df-q 9522  df-rp 9554  df-fz 9906  df-fzo 10035  df-fl 10162  df-mod 10215  df-seqfrec 10338  df-exp 10412  df-ihash 10643  df-cj 10735  df-re 10736  df-im 10737  df-rsqrt 10891  df-abs 10892  df-clim 11169  df-sumdc 11244  df-dvds 11677  df-gcd 11822  df-phi 12074
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator