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

Theorem phisum 12381
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 4033 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝑁𝑦𝑁))
21elrab 2917 . . . . 5 (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ↔ (𝑦 ∈ ℕ ∧ 𝑦𝑁))
3 hashgcdeq 12380 . . . . . . 7 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ ℕ) → (♯‘{𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = if(𝑦𝑁, (ϕ‘(𝑁 / 𝑦)), 0))
43adantrr 479 . . . . . 6 ((𝑁 ∈ ℕ ∧ (𝑦 ∈ ℕ ∧ 𝑦𝑁)) → (♯‘{𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = if(𝑦𝑁, (ϕ‘(𝑁 / 𝑦)), 0))
5 iftrue 3563 . . . . . . 7 (𝑦𝑁 → if(𝑦𝑁, (ϕ‘(𝑁 / 𝑦)), 0) = (ϕ‘(𝑁 / 𝑦)))
65ad2antll 491 . . . . . 6 ((𝑁 ∈ ℕ ∧ (𝑦 ∈ ℕ ∧ 𝑦𝑁)) → if(𝑦𝑁, (ϕ‘(𝑁 / 𝑦)), 0) = (ϕ‘(𝑁 / 𝑦)))
74, 6eqtrd 2226 . . . . 5 ((𝑁 ∈ ℕ ∧ (𝑦 ∈ ℕ ∧ 𝑦𝑁)) → (♯‘{𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = (ϕ‘(𝑁 / 𝑦)))
82, 7sylan2b 287 . . . 4 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → (♯‘{𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = (ϕ‘(𝑁 / 𝑦)))
98sumeq2dv 11514 . . 3 (𝑁 ∈ ℕ → Σ𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (♯‘{𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = Σ𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (ϕ‘(𝑁 / 𝑦)))
10 1zzd 9347 . . . . . 6 (𝑁 ∈ ℕ → 1 ∈ ℤ)
11 nnz 9339 . . . . . 6 (𝑁 ∈ ℕ → 𝑁 ∈ ℤ)
1210, 11fzfigd 10505 . . . . 5 (𝑁 ∈ ℕ → (1...𝑁) ∈ Fin)
13 dvdsssfz1 11997 . . . . 5 (𝑁 ∈ ℕ → {𝑥 ∈ ℕ ∣ 𝑥𝑁} ⊆ (1...𝑁))
14 elfznn 10123 . . . . . . . 8 (𝑗 ∈ (1...𝑁) → 𝑗 ∈ ℕ)
15 dvdsdc 11944 . . . . . . . 8 ((𝑗 ∈ ℕ ∧ 𝑁 ∈ ℤ) → DECID 𝑗𝑁)
1614, 11, 15syl2anr 290 . . . . . . 7 ((𝑁 ∈ ℕ ∧ 𝑗 ∈ (1...𝑁)) → DECID 𝑗𝑁)
17 ibar 301 . . . . . . . . . . 11 (𝑗 ∈ ℕ → (𝑗𝑁 ↔ (𝑗 ∈ ℕ ∧ 𝑗𝑁)))
1814, 17syl 14 . . . . . . . . . 10 (𝑗 ∈ (1...𝑁) → (𝑗𝑁 ↔ (𝑗 ∈ ℕ ∧ 𝑗𝑁)))
19 breq1 4033 . . . . . . . . . . 11 (𝑥 = 𝑗 → (𝑥𝑁𝑗𝑁))
2019elrab 2917 . . . . . . . . . 10 (𝑗 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ↔ (𝑗 ∈ ℕ ∧ 𝑗𝑁))
2118, 20bitr4di 198 . . . . . . . . 9 (𝑗 ∈ (1...𝑁) → (𝑗𝑁𝑗 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}))
2221dcbid 839 . . . . . . . 8 (𝑗 ∈ (1...𝑁) → (DECID 𝑗𝑁DECID 𝑗 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}))
2322adantl 277 . . . . . . 7 ((𝑁 ∈ ℕ ∧ 𝑗 ∈ (1...𝑁)) → (DECID 𝑗𝑁DECID 𝑗 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}))
2416, 23mpbid 147 . . . . . 6 ((𝑁 ∈ ℕ ∧ 𝑗 ∈ (1...𝑁)) → DECID 𝑗 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁})
2524ralrimiva 2567 . . . . 5 (𝑁 ∈ ℕ → ∀𝑗 ∈ (1...𝑁)DECID 𝑗 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁})
26 ssfidc 6993 . . . . 5 (((1...𝑁) ∈ Fin ∧ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ⊆ (1...𝑁) ∧ ∀𝑗 ∈ (1...𝑁)DECID 𝑗 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → {𝑥 ∈ ℕ ∣ 𝑥𝑁} ∈ Fin)
2712, 13, 25, 26syl3anc 1249 . . . 4 (𝑁 ∈ ℕ → {𝑥 ∈ ℕ ∣ 𝑥𝑁} ∈ Fin)
28 0z 9331 . . . . . . 7 0 ∈ ℤ
29 fzofig 10506 . . . . . . 7 ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0..^𝑁) ∈ Fin)
3028, 11, 29sylancr 414 . . . . . 6 (𝑁 ∈ ℕ → (0..^𝑁) ∈ Fin)
3130adantr 276 . . . . 5 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → (0..^𝑁) ∈ Fin)
32 ssrab2 3265 . . . . . 6 {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} ⊆ (0..^𝑁)
3332a1i 9 . . . . 5 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} ⊆ (0..^𝑁))
34 elfzoelz 10216 . . . . . . . . . . 11 (𝑗 ∈ (0..^𝑁) → 𝑗 ∈ ℤ)
3534adantl 277 . . . . . . . . . 10 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → 𝑗 ∈ ℤ)
3611ad2antrr 488 . . . . . . . . . 10 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → 𝑁 ∈ ℤ)
3735, 36gcdcld 12108 . . . . . . . . 9 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → (𝑗 gcd 𝑁) ∈ ℕ0)
3837nn0zd 9440 . . . . . . . 8 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → (𝑗 gcd 𝑁) ∈ ℤ)
39 elrabi 2914 . . . . . . . . . 10 (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} → 𝑦 ∈ ℕ)
4039ad2antlr 489 . . . . . . . . 9 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → 𝑦 ∈ ℕ)
4140nnzd 9441 . . . . . . . 8 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → 𝑦 ∈ ℤ)
42 zdceq 9395 . . . . . . . 8 (((𝑗 gcd 𝑁) ∈ ℤ ∧ 𝑦 ∈ ℤ) → DECID (𝑗 gcd 𝑁) = 𝑦)
4338, 41, 42syl2anc 411 . . . . . . 7 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → DECID (𝑗 gcd 𝑁) = 𝑦)
44 ibar 301 . . . . . . . . . 10 (𝑗 ∈ (0..^𝑁) → ((𝑗 gcd 𝑁) = 𝑦 ↔ (𝑗 ∈ (0..^𝑁) ∧ (𝑗 gcd 𝑁) = 𝑦)))
45 oveq1 5926 . . . . . . . . . . . 12 (𝑧 = 𝑗 → (𝑧 gcd 𝑁) = (𝑗 gcd 𝑁))
4645eqeq1d 2202 . . . . . . . . . . 11 (𝑧 = 𝑗 → ((𝑧 gcd 𝑁) = 𝑦 ↔ (𝑗 gcd 𝑁) = 𝑦))
4746elrab 2917 . . . . . . . . . 10 (𝑗 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} ↔ (𝑗 ∈ (0..^𝑁) ∧ (𝑗 gcd 𝑁) = 𝑦))
4844, 47bitr4di 198 . . . . . . . . 9 (𝑗 ∈ (0..^𝑁) → ((𝑗 gcd 𝑁) = 𝑦𝑗 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}))
4948dcbid 839 . . . . . . . 8 (𝑗 ∈ (0..^𝑁) → (DECID (𝑗 gcd 𝑁) = 𝑦DECID 𝑗 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}))
5049adantl 277 . . . . . . 7 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → (DECID (𝑗 gcd 𝑁) = 𝑦DECID 𝑗 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}))
5143, 50mpbid 147 . . . . . 6 (((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) ∧ 𝑗 ∈ (0..^𝑁)) → DECID 𝑗 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦})
5251ralrimiva 2567 . . . . 5 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → ∀𝑗 ∈ (0..^𝑁)DECID 𝑗 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦})
53 ssfidc 6993 . . . . 5 (((0..^𝑁) ∈ Fin ∧ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} ⊆ (0..^𝑁) ∧ ∀𝑗 ∈ (0..^𝑁)DECID 𝑗 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) → {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} ∈ Fin)
5431, 33, 52, 53syl3anc 1249 . . . 4 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} ∈ Fin)
55 oveq1 5926 . . . . . . . . . 10 (𝑧 = 𝑤 → (𝑧 gcd 𝑁) = (𝑤 gcd 𝑁))
5655eqeq1d 2202 . . . . . . . . 9 (𝑧 = 𝑤 → ((𝑧 gcd 𝑁) = 𝑦 ↔ (𝑤 gcd 𝑁) = 𝑦))
5756elrab 2917 . . . . . . . 8 (𝑤 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} ↔ (𝑤 ∈ (0..^𝑁) ∧ (𝑤 gcd 𝑁) = 𝑦))
5857simprbi 275 . . . . . . 7 (𝑤 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} → (𝑤 gcd 𝑁) = 𝑦)
5958rgen 2547 . . . . . 6 𝑤 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} (𝑤 gcd 𝑁) = 𝑦
6059rgenw 2549 . . . . 5 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}∀𝑤 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} (𝑤 gcd 𝑁) = 𝑦
61 invdisj 4024 . . . . 5 (∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}∀𝑤 ∈ {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} (𝑤 gcd 𝑁) = 𝑦Disj 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦})
6260, 61mp1i 10 . . . 4 (𝑁 ∈ ℕ → Disj 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦})
6327, 54, 62hashiun 11624 . . 3 (𝑁 ∈ ℕ → (♯‘ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = Σ𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (♯‘{𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}))
64 fveq2 5555 . . . 4 (𝑑 = (𝑁 / 𝑦) → (ϕ‘𝑑) = (ϕ‘(𝑁 / 𝑦)))
65 eqid 2193 . . . . 5 {𝑥 ∈ ℕ ∣ 𝑥𝑁} = {𝑥 ∈ ℕ ∣ 𝑥𝑁}
66 eqid 2193 . . . . 5 (𝑧 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ↦ (𝑁 / 𝑧)) = (𝑧 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ↦ (𝑁 / 𝑧))
6765, 66dvdsflip 11996 . . . 4 (𝑁 ∈ ℕ → (𝑧 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ↦ (𝑁 / 𝑧)):{𝑥 ∈ ℕ ∣ 𝑥𝑁}–1-1-onto→{𝑥 ∈ ℕ ∣ 𝑥𝑁})
68 oveq2 5927 . . . . 5 (𝑧 = 𝑦 → (𝑁 / 𝑧) = (𝑁 / 𝑦))
69 simpr 110 . . . . 5 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁})
7011adantr 276 . . . . . 6 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → 𝑁 ∈ ℤ)
7139adantl 277 . . . . . 6 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → 𝑦 ∈ ℕ)
72 znq 9692 . . . . . 6 ((𝑁 ∈ ℤ ∧ 𝑦 ∈ ℕ) → (𝑁 / 𝑦) ∈ ℚ)
7370, 71, 72syl2anc 411 . . . . 5 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → (𝑁 / 𝑦) ∈ ℚ)
7466, 68, 69, 73fvmptd3 5652 . . . 4 ((𝑁 ∈ ℕ ∧ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → ((𝑧 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ↦ (𝑁 / 𝑧))‘𝑦) = (𝑁 / 𝑦))
75 elrabi 2914 . . . . . . 7 (𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} → 𝑑 ∈ ℕ)
7675adantl 277 . . . . . 6 ((𝑁 ∈ ℕ ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → 𝑑 ∈ ℕ)
7776phicld 12359 . . . . 5 ((𝑁 ∈ ℕ ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → (ϕ‘𝑑) ∈ ℕ)
7877nncnd 8998 . . . 4 ((𝑁 ∈ ℕ ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁}) → (ϕ‘𝑑) ∈ ℂ)
7964, 27, 67, 74, 78fsumf1o 11536 . . 3 (𝑁 ∈ ℕ → Σ𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (ϕ‘𝑑) = Σ𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (ϕ‘(𝑁 / 𝑦)))
809, 63, 793eqtr4rd 2237 . 2 (𝑁 ∈ ℕ → Σ𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (ϕ‘𝑑) = (♯‘ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}))
81 iunrab 3961 . . . . 5 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} = {𝑧 ∈ (0..^𝑁) ∣ ∃𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (𝑧 gcd 𝑁) = 𝑦}
82 breq1 4033 . . . . . . . . 9 (𝑥 = (𝑧 gcd 𝑁) → (𝑥𝑁 ↔ (𝑧 gcd 𝑁) ∥ 𝑁))
83 elfzoelz 10216 . . . . . . . . . . 11 (𝑧 ∈ (0..^𝑁) → 𝑧 ∈ ℤ)
8483adantl 277 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → 𝑧 ∈ ℤ)
8511adantr 276 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → 𝑁 ∈ ℤ)
86 nnne0 9012 . . . . . . . . . . . . 13 (𝑁 ∈ ℕ → 𝑁 ≠ 0)
8786neneqd 2385 . . . . . . . . . . . 12 (𝑁 ∈ ℕ → ¬ 𝑁 = 0)
8887intnand 932 . . . . . . . . . . 11 (𝑁 ∈ ℕ → ¬ (𝑧 = 0 ∧ 𝑁 = 0))
8988adantr 276 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → ¬ (𝑧 = 0 ∧ 𝑁 = 0))
90 gcdn0cl 12102 . . . . . . . . . 10 (((𝑧 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑧 = 0 ∧ 𝑁 = 0)) → (𝑧 gcd 𝑁) ∈ ℕ)
9184, 85, 89, 90syl21anc 1248 . . . . . . . . 9 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → (𝑧 gcd 𝑁) ∈ ℕ)
92 gcddvds 12103 . . . . . . . . . . 11 ((𝑧 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑧 gcd 𝑁) ∥ 𝑧 ∧ (𝑧 gcd 𝑁) ∥ 𝑁))
9384, 85, 92syl2anc 411 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → ((𝑧 gcd 𝑁) ∥ 𝑧 ∧ (𝑧 gcd 𝑁) ∥ 𝑁))
9493simprd 114 . . . . . . . . 9 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → (𝑧 gcd 𝑁) ∥ 𝑁)
9582, 91, 94elrabd 2919 . . . . . . . 8 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → (𝑧 gcd 𝑁) ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁})
96 clel5 2898 . . . . . . . 8 ((𝑧 gcd 𝑁) ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} ↔ ∃𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (𝑧 gcd 𝑁) = 𝑦)
9795, 96sylib 122 . . . . . . 7 ((𝑁 ∈ ℕ ∧ 𝑧 ∈ (0..^𝑁)) → ∃𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (𝑧 gcd 𝑁) = 𝑦)
9897ralrimiva 2567 . . . . . 6 (𝑁 ∈ ℕ → ∀𝑧 ∈ (0..^𝑁)∃𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (𝑧 gcd 𝑁) = 𝑦)
99 rabid2 2671 . . . . . 6 ((0..^𝑁) = {𝑧 ∈ (0..^𝑁) ∣ ∃𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (𝑧 gcd 𝑁) = 𝑦} ↔ ∀𝑧 ∈ (0..^𝑁)∃𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (𝑧 gcd 𝑁) = 𝑦)
10098, 99sylibr 134 . . . . 5 (𝑁 ∈ ℕ → (0..^𝑁) = {𝑧 ∈ (0..^𝑁) ∣ ∃𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (𝑧 gcd 𝑁) = 𝑦})
10181, 100eqtr4id 2245 . . . 4 (𝑁 ∈ ℕ → 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦} = (0..^𝑁))
102101fveq2d 5559 . . 3 (𝑁 ∈ ℕ → (♯‘ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = (♯‘(0..^𝑁)))
103 nnnn0 9250 . . . 4 (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0)
104 hashfzo0 10897 . . . 4 (𝑁 ∈ ℕ0 → (♯‘(0..^𝑁)) = 𝑁)
105103, 104syl 14 . . 3 (𝑁 ∈ ℕ → (♯‘(0..^𝑁)) = 𝑁)
106102, 105eqtrd 2226 . 2 (𝑁 ∈ ℕ → (♯‘ 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} {𝑧 ∈ (0..^𝑁) ∣ (𝑧 gcd 𝑁) = 𝑦}) = 𝑁)
10780, 106eqtrd 2226 1 (𝑁 ∈ ℕ → Σ𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥𝑁} (ϕ‘𝑑) = 𝑁)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  DECID wdc 835   = wceq 1364  wcel 2164  wral 2472  wrex 2473  {crab 2476  wss 3154  ifcif 3558   ciun 3913  Disj wdisj 4007   class class class wbr 4030  cmpt 4091  cfv 5255  (class class class)co 5919  Fincfn 6796  0cc0 7874  1c1 7875   / cdiv 8693  cn 8984  0cn0 9243  cz 9320  cq 9687  ...cfz 10077  ..^cfzo 10211  chash 10849  Σcsu 11499  cdvds 11933   gcd cgcd 12082  ϕcphi 12350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-nul 4156  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-iinf 4621  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-mulrcl 7973  ax-addcom 7974  ax-mulcom 7975  ax-addass 7976  ax-mulass 7977  ax-distr 7978  ax-i2m1 7979  ax-0lt1 7980  ax-1rid 7981  ax-0id 7982  ax-rnegex 7983  ax-precex 7984  ax-cnre 7985  ax-pre-ltirr 7986  ax-pre-ltwlin 7987  ax-pre-lttrn 7988  ax-pre-apti 7989  ax-pre-ltadd 7990  ax-pre-mulgt0 7991  ax-pre-mulext 7992  ax-arch 7993  ax-caucvg 7994
This theorem depends on definitions:  df-bi 117  df-stab 832  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-if 3559  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-disj 4008  df-br 4031  df-opab 4092  df-mpt 4093  df-tr 4129  df-id 4325  df-po 4328  df-iso 4329  df-iord 4398  df-on 4400  df-ilim 4401  df-suc 4403  df-iom 4624  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-isom 5264  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-recs 6360  df-irdg 6425  df-frec 6446  df-1o 6471  df-oadd 6475  df-er 6589  df-en 6797  df-dom 6798  df-fin 6799  df-sup 7045  df-pnf 8058  df-mnf 8059  df-xr 8060  df-ltxr 8061  df-le 8062  df-sub 8194  df-neg 8195  df-reap 8596  df-ap 8603  df-div 8694  df-inn 8985  df-2 9043  df-3 9044  df-4 9045  df-n0 9244  df-z 9321  df-uz 9596  df-q 9688  df-rp 9723  df-fz 10078  df-fzo 10212  df-fl 10342  df-mod 10397  df-seqfrec 10522  df-exp 10613  df-ihash 10850  df-cj 10989  df-re 10990  df-im 10991  df-rsqrt 11145  df-abs 11146  df-clim 11425  df-sumdc 11500  df-dvds 11934  df-gcd 12083  df-phi 12352
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator