Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eulerpartlemgs2 Structured version   Visualization version   GIF version

Theorem eulerpartlemgs2 34362
Description: Lemma for eulerpart 34364: The 𝐺 function also preserves partition sums. (Contributed by Thierry Arnoux, 10-Sep-2017.)
Hypotheses
Ref Expression
eulerpart.p 𝑃 = {𝑓 ∈ (ℕ0m ℕ) ∣ ((𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓𝑘) · 𝑘) = 𝑁)}
eulerpart.o 𝑂 = {𝑔𝑃 ∣ ∀𝑛 ∈ (𝑔 “ ℕ) ¬ 2 ∥ 𝑛}
eulerpart.d 𝐷 = {𝑔𝑃 ∣ ∀𝑛 ∈ ℕ (𝑔𝑛) ≤ 1}
eulerpart.j 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧}
eulerpart.f 𝐹 = (𝑥𝐽, 𝑦 ∈ ℕ0 ↦ ((2↑𝑦) · 𝑥))
eulerpart.h 𝐻 = {𝑟 ∈ ((𝒫 ℕ0 ∩ Fin) ↑m 𝐽) ∣ (𝑟 supp ∅) ∈ Fin}
eulerpart.m 𝑀 = (𝑟𝐻 ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐽𝑦 ∈ (𝑟𝑥))})
eulerpart.r 𝑅 = {𝑓 ∣ (𝑓 “ ℕ) ∈ Fin}
eulerpart.t 𝑇 = {𝑓 ∈ (ℕ0m ℕ) ∣ (𝑓 “ ℕ) ⊆ 𝐽}
eulerpart.g 𝐺 = (𝑜 ∈ (𝑇𝑅) ↦ ((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝑜𝐽))))))
eulerpart.s 𝑆 = (𝑓 ∈ ((ℕ0m ℕ) ∩ 𝑅) ↦ Σ𝑘 ∈ ℕ ((𝑓𝑘) · 𝑘))
Assertion
Ref Expression
eulerpartlemgs2 (𝐴 ∈ (𝑇𝑅) → (𝑆‘(𝐺𝐴)) = (𝑆𝐴))
Distinct variable groups:   𝑓,𝑔,𝑘,𝑛,𝑜,𝑥,𝑦,𝑧   𝑓,𝑟,𝐴,𝑔,𝑘,𝑛,𝑜,𝑥,𝑦   𝑓,𝐺,𝑘   𝑛,𝐹,𝑜,𝑥,𝑦   𝑜,𝐻,𝑟   𝑓,𝐽,𝑛,𝑜,𝑟,𝑥,𝑦   𝑛,𝑀,𝑜,𝑟,𝑥,𝑦   𝑓,𝑁,𝑔,𝑘,𝑛,𝑥   𝑛,𝑂,𝑟,𝑥,𝑦   𝑃,𝑔,𝑘,𝑛   𝑅,𝑓,𝑘,𝑛,𝑜,𝑟,𝑥,𝑦   𝑇,𝑓,𝑘,𝑛,𝑜,𝑟,𝑥,𝑦
Allowed substitution hints:   𝐴(𝑧)   𝐷(𝑥,𝑦,𝑧,𝑓,𝑔,𝑘,𝑛,𝑜,𝑟)   𝑃(𝑥,𝑦,𝑧,𝑓,𝑜,𝑟)   𝑅(𝑧,𝑔)   𝑆(𝑥,𝑦,𝑧,𝑓,𝑔,𝑘,𝑛,𝑜,𝑟)   𝑇(𝑧,𝑔)   𝐹(𝑧,𝑓,𝑔,𝑘,𝑟)   𝐺(𝑥,𝑦,𝑧,𝑔,𝑛,𝑜,𝑟)   𝐻(𝑥,𝑦,𝑧,𝑓,𝑔,𝑘,𝑛)   𝐽(𝑧,𝑔,𝑘)   𝑀(𝑧,𝑓,𝑔,𝑘)   𝑁(𝑦,𝑧,𝑜,𝑟)   𝑂(𝑧,𝑓,𝑔,𝑘,𝑜)

Proof of Theorem eulerpartlemgs2
Dummy variables 𝑡 𝑚 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnvimass 6102 . . . . . . . 8 ((𝐺𝐴) “ ℕ) ⊆ dom (𝐺𝐴)
2 eulerpart.p . . . . . . . . . . . . . 14 𝑃 = {𝑓 ∈ (ℕ0m ℕ) ∣ ((𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓𝑘) · 𝑘) = 𝑁)}
3 eulerpart.o . . . . . . . . . . . . . 14 𝑂 = {𝑔𝑃 ∣ ∀𝑛 ∈ (𝑔 “ ℕ) ¬ 2 ∥ 𝑛}
4 eulerpart.d . . . . . . . . . . . . . 14 𝐷 = {𝑔𝑃 ∣ ∀𝑛 ∈ ℕ (𝑔𝑛) ≤ 1}
5 eulerpart.j . . . . . . . . . . . . . 14 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧}
6 eulerpart.f . . . . . . . . . . . . . 14 𝐹 = (𝑥𝐽, 𝑦 ∈ ℕ0 ↦ ((2↑𝑦) · 𝑥))
7 eulerpart.h . . . . . . . . . . . . . 14 𝐻 = {𝑟 ∈ ((𝒫 ℕ0 ∩ Fin) ↑m 𝐽) ∣ (𝑟 supp ∅) ∈ Fin}
8 eulerpart.m . . . . . . . . . . . . . 14 𝑀 = (𝑟𝐻 ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐽𝑦 ∈ (𝑟𝑥))})
9 eulerpart.r . . . . . . . . . . . . . 14 𝑅 = {𝑓 ∣ (𝑓 “ ℕ) ∈ Fin}
10 eulerpart.t . . . . . . . . . . . . . 14 𝑇 = {𝑓 ∈ (ℕ0m ℕ) ∣ (𝑓 “ ℕ) ⊆ 𝐽}
11 eulerpart.g . . . . . . . . . . . . . 14 𝐺 = (𝑜 ∈ (𝑇𝑅) ↦ ((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝑜𝐽))))))
122, 3, 4, 5, 6, 7, 8, 9, 10, 11eulerpartgbij 34354 . . . . . . . . . . . . 13 𝐺:(𝑇𝑅)–1-1-onto→(({0, 1} ↑m ℕ) ∩ 𝑅)
13 f1of 6849 . . . . . . . . . . . . 13 (𝐺:(𝑇𝑅)–1-1-onto→(({0, 1} ↑m ℕ) ∩ 𝑅) → 𝐺:(𝑇𝑅)⟶(({0, 1} ↑m ℕ) ∩ 𝑅))
1412, 13ax-mp 5 . . . . . . . . . . . 12 𝐺:(𝑇𝑅)⟶(({0, 1} ↑m ℕ) ∩ 𝑅)
1514ffvelcdmi 7103 . . . . . . . . . . 11 (𝐴 ∈ (𝑇𝑅) → (𝐺𝐴) ∈ (({0, 1} ↑m ℕ) ∩ 𝑅))
16 elin 3979 . . . . . . . . . . 11 ((𝐺𝐴) ∈ (({0, 1} ↑m ℕ) ∩ 𝑅) ↔ ((𝐺𝐴) ∈ ({0, 1} ↑m ℕ) ∧ (𝐺𝐴) ∈ 𝑅))
1715, 16sylib 218 . . . . . . . . . 10 (𝐴 ∈ (𝑇𝑅) → ((𝐺𝐴) ∈ ({0, 1} ↑m ℕ) ∧ (𝐺𝐴) ∈ 𝑅))
1817simpld 494 . . . . . . . . 9 (𝐴 ∈ (𝑇𝑅) → (𝐺𝐴) ∈ ({0, 1} ↑m ℕ))
19 elmapi 8888 . . . . . . . . 9 ((𝐺𝐴) ∈ ({0, 1} ↑m ℕ) → (𝐺𝐴):ℕ⟶{0, 1})
20 fdm 6746 . . . . . . . . 9 ((𝐺𝐴):ℕ⟶{0, 1} → dom (𝐺𝐴) = ℕ)
2118, 19, 203syl 18 . . . . . . . 8 (𝐴 ∈ (𝑇𝑅) → dom (𝐺𝐴) = ℕ)
221, 21sseqtrid 4048 . . . . . . 7 (𝐴 ∈ (𝑇𝑅) → ((𝐺𝐴) “ ℕ) ⊆ ℕ)
2322sselda 3995 . . . . . 6 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ ((𝐺𝐴) “ ℕ)) → 𝑘 ∈ ℕ)
242, 3, 4, 5, 6, 7, 8, 9, 10, 11eulerpartlemgvv 34358 . . . . . . 7 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ ℕ) → ((𝐺𝐴)‘𝑘) = if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0))
2524oveq1d 7446 . . . . . 6 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ ℕ) → (((𝐺𝐴)‘𝑘) · 𝑘) = (if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) · 𝑘))
2623, 25syldan 591 . . . . 5 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ ((𝐺𝐴) “ ℕ)) → (((𝐺𝐴)‘𝑘) · 𝑘) = (if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) · 𝑘))
2726sumeq2dv 15735 . . . 4 (𝐴 ∈ (𝑇𝑅) → Σ𝑘 ∈ ((𝐺𝐴) “ ℕ)(((𝐺𝐴)‘𝑘) · 𝑘) = Σ𝑘 ∈ ((𝐺𝐴) “ ℕ)(if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) · 𝑘))
28 eqeq2 2747 . . . . . . . . . . . . 13 (𝑚 = 𝑘 → (((2↑𝑛) · 𝑡) = 𝑚 ↔ ((2↑𝑛) · 𝑡) = 𝑘))
29282rexbidv 3220 . . . . . . . . . . . 12 (𝑚 = 𝑘 → (∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚 ↔ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘))
3029elrab 3695 . . . . . . . . . . 11 (𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} ↔ (𝑘 ∈ ℕ ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘))
3130simprbi 496 . . . . . . . . . 10 (𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} → ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘)
3231iftrued 4539 . . . . . . . . 9 (𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} → if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) = 1)
3332oveq1d 7446 . . . . . . . 8 (𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} → (if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) · 𝑘) = (1 · 𝑘))
34 elrabi 3690 . . . . . . . . . 10 (𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} → 𝑘 ∈ ℕ)
3534nncnd 12280 . . . . . . . . 9 (𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} → 𝑘 ∈ ℂ)
3635mullidd 11277 . . . . . . . 8 (𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} → (1 · 𝑘) = 𝑘)
3733, 36eqtrd 2775 . . . . . . 7 (𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} → (if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) · 𝑘) = 𝑘)
3837sumeq2i 15731 . . . . . 6 Σ𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} (if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) · 𝑘) = Σ𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}𝑘
39 id 22 . . . . . . 7 (𝑘 = ((2↑(2nd𝑤)) · (1st𝑤)) → 𝑘 = ((2↑(2nd𝑤)) · (1st𝑤)))
402, 3, 4, 5, 6, 7, 8, 9, 10, 11eulerpartlemgf 34361 . . . . . . . . 9 (𝐴 ∈ (𝑇𝑅) → ((𝐺𝐴) “ ℕ) ∈ Fin)
4134adantl 481 . . . . . . . . . . . 12 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → 𝑘 ∈ ℕ)
4241, 24syldan 591 . . . . . . . . . . . . . 14 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → ((𝐺𝐴)‘𝑘) = if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0))
4331adantl 481 . . . . . . . . . . . . . . 15 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘)
4443iftrued 4539 . . . . . . . . . . . . . 14 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) = 1)
4542, 44eqtrd 2775 . . . . . . . . . . . . 13 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → ((𝐺𝐴)‘𝑘) = 1)
46 1nn 12275 . . . . . . . . . . . . 13 1 ∈ ℕ
4745, 46eqeltrdi 2847 . . . . . . . . . . . 12 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → ((𝐺𝐴)‘𝑘) ∈ ℕ)
48 ffn 6737 . . . . . . . . . . . . . 14 ((𝐺𝐴):ℕ⟶{0, 1} → (𝐺𝐴) Fn ℕ)
49 elpreima 7078 . . . . . . . . . . . . . 14 ((𝐺𝐴) Fn ℕ → (𝑘 ∈ ((𝐺𝐴) “ ℕ) ↔ (𝑘 ∈ ℕ ∧ ((𝐺𝐴)‘𝑘) ∈ ℕ)))
5018, 19, 48, 494syl 19 . . . . . . . . . . . . 13 (𝐴 ∈ (𝑇𝑅) → (𝑘 ∈ ((𝐺𝐴) “ ℕ) ↔ (𝑘 ∈ ℕ ∧ ((𝐺𝐴)‘𝑘) ∈ ℕ)))
5150adantr 480 . . . . . . . . . . . 12 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → (𝑘 ∈ ((𝐺𝐴) “ ℕ) ↔ (𝑘 ∈ ℕ ∧ ((𝐺𝐴)‘𝑘) ∈ ℕ)))
5241, 47, 51mpbir2and 713 . . . . . . . . . . 11 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → 𝑘 ∈ ((𝐺𝐴) “ ℕ))
5352ex 412 . . . . . . . . . 10 (𝐴 ∈ (𝑇𝑅) → (𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} → 𝑘 ∈ ((𝐺𝐴) “ ℕ)))
5453ssrdv 4001 . . . . . . . . 9 (𝐴 ∈ (𝑇𝑅) → {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} ⊆ ((𝐺𝐴) “ ℕ))
55 ssfi 9212 . . . . . . . . 9 ((((𝐺𝐴) “ ℕ) ∈ Fin ∧ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} ⊆ ((𝐺𝐴) “ ℕ)) → {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} ∈ Fin)
5640, 54, 55syl2anc 584 . . . . . . . 8 (𝐴 ∈ (𝑇𝑅) → {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} ∈ Fin)
57 cnvexg 7947 . . . . . . . . . . 11 (𝐴 ∈ (𝑇𝑅) → 𝐴 ∈ V)
58 imaexg 7936 . . . . . . . . . . 11 (𝐴 ∈ V → (𝐴 “ ℕ) ∈ V)
59 inex1g 5325 . . . . . . . . . . 11 ((𝐴 “ ℕ) ∈ V → ((𝐴 “ ℕ) ∩ 𝐽) ∈ V)
6057, 58, 593syl 18 . . . . . . . . . 10 (𝐴 ∈ (𝑇𝑅) → ((𝐴 “ ℕ) ∩ 𝐽) ∈ V)
61 vsnex 5440 . . . . . . . . . . . 12 {𝑡} ∈ V
62 fvex 6920 . . . . . . . . . . . 12 (bits‘(𝐴𝑡)) ∈ V
6361, 62xpex 7772 . . . . . . . . . . 11 ({𝑡} × (bits‘(𝐴𝑡))) ∈ V
6463rgenw 3063 . . . . . . . . . 10 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) ∈ V
65 iunexg 7987 . . . . . . . . . 10 ((((𝐴 “ ℕ) ∩ 𝐽) ∈ V ∧ ∀𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) ∈ V) → 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) ∈ V)
6660, 64, 65sylancl 586 . . . . . . . . 9 (𝐴 ∈ (𝑇𝑅) → 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) ∈ V)
67 eqid 2735 . . . . . . . . . 10 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) = 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡)))
682, 3, 4, 5, 6, 7, 8, 9, 10, 11, 67eulerpartlemgh 34360 . . . . . . . . 9 (𝐴 ∈ (𝑇𝑅) → (𝐹 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡)))): 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡)))–1-1-onto→{𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚})
69 f1oeng 9010 . . . . . . . . 9 (( 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) ∈ V ∧ (𝐹 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡)))): 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡)))–1-1-onto→{𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) ≈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚})
7066, 68, 69syl2anc 584 . . . . . . . 8 (𝐴 ∈ (𝑇𝑅) → 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) ≈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚})
71 enfii 9224 . . . . . . . 8 (({𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} ∈ Fin ∧ 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) ≈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) ∈ Fin)
7256, 70, 71syl2anc 584 . . . . . . 7 (𝐴 ∈ (𝑇𝑅) → 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) ∈ Fin)
73 fvres 6926 . . . . . . . . 9 (𝑤 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) → ((𝐹 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))))‘𝑤) = (𝐹𝑤))
7473adantl 481 . . . . . . . 8 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑤 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡)))) → ((𝐹 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))))‘𝑤) = (𝐹𝑤))
75 inss2 4246 . . . . . . . . . . . . . . 15 ((𝐴 “ ℕ) ∩ 𝐽) ⊆ 𝐽
76 simpr 484 . . . . . . . . . . . . . . 15 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)) → 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽))
7775, 76sselid 3993 . . . . . . . . . . . . . 14 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)) → 𝑡𝐽)
7877snssd 4814 . . . . . . . . . . . . 13 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)) → {𝑡} ⊆ 𝐽)
79 bitsss 16460 . . . . . . . . . . . . 13 (bits‘(𝐴𝑡)) ⊆ ℕ0
80 xpss12 5704 . . . . . . . . . . . . 13 (({𝑡} ⊆ 𝐽 ∧ (bits‘(𝐴𝑡)) ⊆ ℕ0) → ({𝑡} × (bits‘(𝐴𝑡))) ⊆ (𝐽 × ℕ0))
8178, 79, 80sylancl 586 . . . . . . . . . . . 12 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)) → ({𝑡} × (bits‘(𝐴𝑡))) ⊆ (𝐽 × ℕ0))
8281ralrimiva 3144 . . . . . . . . . . 11 (𝐴 ∈ (𝑇𝑅) → ∀𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) ⊆ (𝐽 × ℕ0))
83 iunss 5050 . . . . . . . . . . 11 ( 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) ⊆ (𝐽 × ℕ0) ↔ ∀𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) ⊆ (𝐽 × ℕ0))
8482, 83sylibr 234 . . . . . . . . . 10 (𝐴 ∈ (𝑇𝑅) → 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))) ⊆ (𝐽 × ℕ0))
8584sselda 3995 . . . . . . . . 9 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑤 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡)))) → 𝑤 ∈ (𝐽 × ℕ0))
865, 6oddpwdcv 34337 . . . . . . . . 9 (𝑤 ∈ (𝐽 × ℕ0) → (𝐹𝑤) = ((2↑(2nd𝑤)) · (1st𝑤)))
8785, 86syl 17 . . . . . . . 8 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑤 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡)))) → (𝐹𝑤) = ((2↑(2nd𝑤)) · (1st𝑤)))
8874, 87eqtrd 2775 . . . . . . 7 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑤 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡)))) → ((𝐹 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡))))‘𝑤) = ((2↑(2nd𝑤)) · (1st𝑤)))
8941nncnd 12280 . . . . . . 7 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → 𝑘 ∈ ℂ)
9039, 72, 68, 88, 89fsumf1o 15756 . . . . . 6 (𝐴 ∈ (𝑇𝑅) → Σ𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}𝑘 = Σ𝑤 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡)))((2↑(2nd𝑤)) · (1st𝑤)))
9138, 90eqtrid 2787 . . . . 5 (𝐴 ∈ (𝑇𝑅) → Σ𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} (if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) · 𝑘) = Σ𝑤 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡)))((2↑(2nd𝑤)) · (1st𝑤)))
92 ax-1cn 11211 . . . . . . . . 9 1 ∈ ℂ
93 0cn 11251 . . . . . . . . 9 0 ∈ ℂ
9492, 93ifcli 4578 . . . . . . . 8 if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) ∈ ℂ
9594a1i 11 . . . . . . 7 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) ∈ ℂ)
96 ssrab2 4090 . . . . . . . . 9 {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} ⊆ ℕ
97 simpr 484 . . . . . . . . 9 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚})
9896, 97sselid 3993 . . . . . . . 8 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → 𝑘 ∈ ℕ)
9998nncnd 12280 . . . . . . 7 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → 𝑘 ∈ ℂ)
10095, 99mulcld 11279 . . . . . 6 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) → (if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) · 𝑘) ∈ ℂ)
101 simpr 484 . . . . . . . . . . 11 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ (((𝐺𝐴) “ ℕ) ∖ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚})) → 𝑘 ∈ (((𝐺𝐴) “ ℕ) ∖ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}))
102101eldifbd 3976 . . . . . . . . . 10 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ (((𝐺𝐴) “ ℕ) ∖ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚})) → ¬ 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚})
10322ssdifssd 4157 . . . . . . . . . . 11 (𝐴 ∈ (𝑇𝑅) → (((𝐺𝐴) “ ℕ) ∖ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) ⊆ ℕ)
104103sselda 3995 . . . . . . . . . 10 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ (((𝐺𝐴) “ ℕ) ∖ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚})) → 𝑘 ∈ ℕ)
10530notbii 320 . . . . . . . . . . 11 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} ↔ ¬ (𝑘 ∈ ℕ ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘))
106 imnan 399 . . . . . . . . . . 11 ((𝑘 ∈ ℕ → ¬ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘) ↔ ¬ (𝑘 ∈ ℕ ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘))
107105, 106sylbb2 238 . . . . . . . . . 10 𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} → (𝑘 ∈ ℕ → ¬ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘))
108102, 104, 107sylc 65 . . . . . . . . 9 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ (((𝐺𝐴) “ ℕ) ∖ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚})) → ¬ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘)
109108iffalsed 4542 . . . . . . . 8 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ (((𝐺𝐴) “ ℕ) ∖ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚})) → if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) = 0)
110109oveq1d 7446 . . . . . . 7 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ (((𝐺𝐴) “ ℕ) ∖ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚})) → (if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) · 𝑘) = (0 · 𝑘))
111 nnsscn 12269 . . . . . . . . . 10 ℕ ⊆ ℂ
112103, 111sstrdi 4008 . . . . . . . . 9 (𝐴 ∈ (𝑇𝑅) → (((𝐺𝐴) “ ℕ) ∖ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚}) ⊆ ℂ)
113112sselda 3995 . . . . . . . 8 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ (((𝐺𝐴) “ ℕ) ∖ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚})) → 𝑘 ∈ ℂ)
114113mul02d 11457 . . . . . . 7 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ (((𝐺𝐴) “ ℕ) ∖ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚})) → (0 · 𝑘) = 0)
115110, 114eqtrd 2775 . . . . . 6 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑘 ∈ (((𝐺𝐴) “ ℕ) ∖ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚})) → (if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) · 𝑘) = 0)
11654, 100, 115, 40fsumss 15758 . . . . 5 (𝐴 ∈ (𝑇𝑅) → Σ𝑘 ∈ {𝑚 ∈ ℕ ∣ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑚} (if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) · 𝑘) = Σ𝑘 ∈ ((𝐺𝐴) “ ℕ)(if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) · 𝑘))
11791, 116eqtr3d 2777 . . . 4 (𝐴 ∈ (𝑇𝑅) → Σ𝑤 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡)))((2↑(2nd𝑤)) · (1st𝑤)) = Σ𝑘 ∈ ((𝐺𝐴) “ ℕ)(if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝑘, 1, 0) · 𝑘))
1182, 3, 4, 5, 6, 7, 8, 9, 10eulerpartlemt0 34351 . . . . . . . . . . . . 13 (𝐴 ∈ (𝑇𝑅) ↔ (𝐴 ∈ (ℕ0m ℕ) ∧ (𝐴 “ ℕ) ∈ Fin ∧ (𝐴 “ ℕ) ⊆ 𝐽))
119118simp1bi 1144 . . . . . . . . . . . 12 (𝐴 ∈ (𝑇𝑅) → 𝐴 ∈ (ℕ0m ℕ))
120 elmapi 8888 . . . . . . . . . . . 12 (𝐴 ∈ (ℕ0m ℕ) → 𝐴:ℕ⟶ℕ0)
121119, 120syl 17 . . . . . . . . . . 11 (𝐴 ∈ (𝑇𝑅) → 𝐴:ℕ⟶ℕ0)
122121adantr 480 . . . . . . . . . 10 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)) → 𝐴:ℕ⟶ℕ0)
123 cnvimass 6102 . . . . . . . . . . . . 13 (𝐴 “ ℕ) ⊆ dom 𝐴
124123, 121fssdm 6756 . . . . . . . . . . . 12 (𝐴 ∈ (𝑇𝑅) → (𝐴 “ ℕ) ⊆ ℕ)
125124adantr 480 . . . . . . . . . . 11 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)) → (𝐴 “ ℕ) ⊆ ℕ)
126 inss1 4245 . . . . . . . . . . . 12 ((𝐴 “ ℕ) ∩ 𝐽) ⊆ (𝐴 “ ℕ)
127126, 76sselid 3993 . . . . . . . . . . 11 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)) → 𝑡 ∈ (𝐴 “ ℕ))
128125, 127sseldd 3996 . . . . . . . . . 10 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)) → 𝑡 ∈ ℕ)
129122, 128ffvelcdmd 7105 . . . . . . . . 9 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)) → (𝐴𝑡) ∈ ℕ0)
130 bitsfi 16471 . . . . . . . . 9 ((𝐴𝑡) ∈ ℕ0 → (bits‘(𝐴𝑡)) ∈ Fin)
131129, 130syl 17 . . . . . . . 8 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)) → (bits‘(𝐴𝑡)) ∈ Fin)
132128nncnd 12280 . . . . . . . 8 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)) → 𝑡 ∈ ℂ)
133 2cnd 12342 . . . . . . . . . 10 ((𝐴 ∈ (𝑇𝑅) ∧ (𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽) ∧ 𝑛 ∈ (bits‘(𝐴𝑡)))) → 2 ∈ ℂ)
134 simprr 773 . . . . . . . . . . 11 ((𝐴 ∈ (𝑇𝑅) ∧ (𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽) ∧ 𝑛 ∈ (bits‘(𝐴𝑡)))) → 𝑛 ∈ (bits‘(𝐴𝑡)))
13579, 134sselid 3993 . . . . . . . . . 10 ((𝐴 ∈ (𝑇𝑅) ∧ (𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽) ∧ 𝑛 ∈ (bits‘(𝐴𝑡)))) → 𝑛 ∈ ℕ0)
136133, 135expcld 14183 . . . . . . . . 9 ((𝐴 ∈ (𝑇𝑅) ∧ (𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽) ∧ 𝑛 ∈ (bits‘(𝐴𝑡)))) → (2↑𝑛) ∈ ℂ)
137136anassrs 467 . . . . . . . 8 (((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)) ∧ 𝑛 ∈ (bits‘(𝐴𝑡))) → (2↑𝑛) ∈ ℂ)
138131, 132, 137fsummulc1 15818 . . . . . . 7 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)) → (Σ𝑛 ∈ (bits‘(𝐴𝑡))(2↑𝑛) · 𝑡) = Σ𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡))
139138sumeq2dv 15735 . . . . . 6 (𝐴 ∈ (𝑇𝑅) → Σ𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)(Σ𝑛 ∈ (bits‘(𝐴𝑡))(2↑𝑛) · 𝑡) = Σ𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡))
140 bitsinv1 16476 . . . . . . . . 9 ((𝐴𝑡) ∈ ℕ0 → Σ𝑛 ∈ (bits‘(𝐴𝑡))(2↑𝑛) = (𝐴𝑡))
141140oveq1d 7446 . . . . . . . 8 ((𝐴𝑡) ∈ ℕ0 → (Σ𝑛 ∈ (bits‘(𝐴𝑡))(2↑𝑛) · 𝑡) = ((𝐴𝑡) · 𝑡))
142129, 141syl 17 . . . . . . 7 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)) → (Σ𝑛 ∈ (bits‘(𝐴𝑡))(2↑𝑛) · 𝑡) = ((𝐴𝑡) · 𝑡))
143142sumeq2dv 15735 . . . . . 6 (𝐴 ∈ (𝑇𝑅) → Σ𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)(Σ𝑛 ∈ (bits‘(𝐴𝑡))(2↑𝑛) · 𝑡) = Σ𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)((𝐴𝑡) · 𝑡))
144 vex 3482 . . . . . . . . . 10 𝑡 ∈ V
145 vex 3482 . . . . . . . . . 10 𝑛 ∈ V
146144, 145op2ndd 8024 . . . . . . . . 9 (𝑤 = ⟨𝑡, 𝑛⟩ → (2nd𝑤) = 𝑛)
147146oveq2d 7447 . . . . . . . 8 (𝑤 = ⟨𝑡, 𝑛⟩ → (2↑(2nd𝑤)) = (2↑𝑛))
148144, 145op1std 8023 . . . . . . . 8 (𝑤 = ⟨𝑡, 𝑛⟩ → (1st𝑤) = 𝑡)
149147, 148oveq12d 7449 . . . . . . 7 (𝑤 = ⟨𝑡, 𝑛⟩ → ((2↑(2nd𝑤)) · (1st𝑤)) = ((2↑𝑛) · 𝑡))
150 inss2 4246 . . . . . . . . . 10 (𝑇𝑅) ⊆ 𝑅
151150sseli 3991 . . . . . . . . 9 (𝐴 ∈ (𝑇𝑅) → 𝐴𝑅)
152 cnveq 5887 . . . . . . . . . . . 12 (𝑓 = 𝐴𝑓 = 𝐴)
153152imaeq1d 6079 . . . . . . . . . . 11 (𝑓 = 𝐴 → (𝑓 “ ℕ) = (𝐴 “ ℕ))
154153eleq1d 2824 . . . . . . . . . 10 (𝑓 = 𝐴 → ((𝑓 “ ℕ) ∈ Fin ↔ (𝐴 “ ℕ) ∈ Fin))
155154, 9elab2g 3683 . . . . . . . . 9 (𝐴 ∈ (𝑇𝑅) → (𝐴𝑅 ↔ (𝐴 “ ℕ) ∈ Fin))
156151, 155mpbid 232 . . . . . . . 8 (𝐴 ∈ (𝑇𝑅) → (𝐴 “ ℕ) ∈ Fin)
157 ssfi 9212 . . . . . . . 8 (((𝐴 “ ℕ) ∈ Fin ∧ ((𝐴 “ ℕ) ∩ 𝐽) ⊆ (𝐴 “ ℕ)) → ((𝐴 “ ℕ) ∩ 𝐽) ∈ Fin)
158156, 126, 157sylancl 586 . . . . . . 7 (𝐴 ∈ (𝑇𝑅) → ((𝐴 “ ℕ) ∩ 𝐽) ∈ Fin)
159132adantrr 717 . . . . . . . 8 ((𝐴 ∈ (𝑇𝑅) ∧ (𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽) ∧ 𝑛 ∈ (bits‘(𝐴𝑡)))) → 𝑡 ∈ ℂ)
160136, 159mulcld 11279 . . . . . . 7 ((𝐴 ∈ (𝑇𝑅) ∧ (𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽) ∧ 𝑛 ∈ (bits‘(𝐴𝑡)))) → ((2↑𝑛) · 𝑡) ∈ ℂ)
161149, 158, 131, 160fsum2d 15804 . . . . . 6 (𝐴 ∈ (𝑇𝑅) → Σ𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = Σ𝑤 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡)))((2↑(2nd𝑤)) · (1st𝑤)))
162139, 143, 1613eqtr3d 2783 . . . . 5 (𝐴 ∈ (𝑇𝑅) → Σ𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)((𝐴𝑡) · 𝑡) = Σ𝑤 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡)))((2↑(2nd𝑤)) · (1st𝑤)))
163 inss1 4245 . . . . . . . . 9 (𝑇𝑅) ⊆ 𝑇
164163sseli 3991 . . . . . . . 8 (𝐴 ∈ (𝑇𝑅) → 𝐴𝑇)
165153sseq1d 4027 . . . . . . . . . 10 (𝑓 = 𝐴 → ((𝑓 “ ℕ) ⊆ 𝐽 ↔ (𝐴 “ ℕ) ⊆ 𝐽))
166165, 10elrab2 3698 . . . . . . . . 9 (𝐴𝑇 ↔ (𝐴 ∈ (ℕ0m ℕ) ∧ (𝐴 “ ℕ) ⊆ 𝐽))
167166simprbi 496 . . . . . . . 8 (𝐴𝑇 → (𝐴 “ ℕ) ⊆ 𝐽)
168164, 167syl 17 . . . . . . 7 (𝐴 ∈ (𝑇𝑅) → (𝐴 “ ℕ) ⊆ 𝐽)
169 dfss2 3981 . . . . . . 7 ((𝐴 “ ℕ) ⊆ 𝐽 ↔ ((𝐴 “ ℕ) ∩ 𝐽) = (𝐴 “ ℕ))
170168, 169sylib 218 . . . . . 6 (𝐴 ∈ (𝑇𝑅) → ((𝐴 “ ℕ) ∩ 𝐽) = (𝐴 “ ℕ))
171170sumeq1d 15733 . . . . 5 (𝐴 ∈ (𝑇𝑅) → Σ𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)((𝐴𝑡) · 𝑡) = Σ𝑡 ∈ (𝐴 “ ℕ)((𝐴𝑡) · 𝑡))
172162, 171eqtr3d 2777 . . . 4 (𝐴 ∈ (𝑇𝑅) → Σ𝑤 𝑡 ∈ ((𝐴 “ ℕ) ∩ 𝐽)({𝑡} × (bits‘(𝐴𝑡)))((2↑(2nd𝑤)) · (1st𝑤)) = Σ𝑡 ∈ (𝐴 “ ℕ)((𝐴𝑡) · 𝑡))
17327, 117, 1723eqtr2d 2781 . . 3 (𝐴 ∈ (𝑇𝑅) → Σ𝑘 ∈ ((𝐺𝐴) “ ℕ)(((𝐺𝐴)‘𝑘) · 𝑘) = Σ𝑡 ∈ (𝐴 “ ℕ)((𝐴𝑡) · 𝑡))
174 fveq2 6907 . . . . 5 (𝑘 = 𝑡 → (𝐴𝑘) = (𝐴𝑡))
175 id 22 . . . . 5 (𝑘 = 𝑡𝑘 = 𝑡)
176174, 175oveq12d 7449 . . . 4 (𝑘 = 𝑡 → ((𝐴𝑘) · 𝑘) = ((𝐴𝑡) · 𝑡))
177176cbvsumv 15729 . . 3 Σ𝑘 ∈ (𝐴 “ ℕ)((𝐴𝑘) · 𝑘) = Σ𝑡 ∈ (𝐴 “ ℕ)((𝐴𝑡) · 𝑡)
178173, 177eqtr4di 2793 . 2 (𝐴 ∈ (𝑇𝑅) → Σ𝑘 ∈ ((𝐺𝐴) “ ℕ)(((𝐺𝐴)‘𝑘) · 𝑘) = Σ𝑘 ∈ (𝐴 “ ℕ)((𝐴𝑘) · 𝑘))
179 0nn0 12539 . . . . . . . 8 0 ∈ ℕ0
180 1nn0 12540 . . . . . . . 8 1 ∈ ℕ0
181 prssi 4826 . . . . . . . 8 ((0 ∈ ℕ0 ∧ 1 ∈ ℕ0) → {0, 1} ⊆ ℕ0)
182179, 180, 181mp2an 692 . . . . . . 7 {0, 1} ⊆ ℕ0
183 fss 6753 . . . . . . 7 (((𝐺𝐴):ℕ⟶{0, 1} ∧ {0, 1} ⊆ ℕ0) → (𝐺𝐴):ℕ⟶ℕ0)
184182, 183mpan2 691 . . . . . 6 ((𝐺𝐴):ℕ⟶{0, 1} → (𝐺𝐴):ℕ⟶ℕ0)
185 nn0ex 12530 . . . . . . . 8 0 ∈ V
186 nnex 12270 . . . . . . . 8 ℕ ∈ V
187185, 186elmap 8910 . . . . . . 7 ((𝐺𝐴) ∈ (ℕ0m ℕ) ↔ (𝐺𝐴):ℕ⟶ℕ0)
188187biimpri 228 . . . . . 6 ((𝐺𝐴):ℕ⟶ℕ0 → (𝐺𝐴) ∈ (ℕ0m ℕ))
18919, 184, 1883syl 18 . . . . 5 ((𝐺𝐴) ∈ ({0, 1} ↑m ℕ) → (𝐺𝐴) ∈ (ℕ0m ℕ))
190189anim1i 615 . . . 4 (((𝐺𝐴) ∈ ({0, 1} ↑m ℕ) ∧ (𝐺𝐴) ∈ 𝑅) → ((𝐺𝐴) ∈ (ℕ0m ℕ) ∧ (𝐺𝐴) ∈ 𝑅))
191 elin 3979 . . . 4 ((𝐺𝐴) ∈ ((ℕ0m ℕ) ∩ 𝑅) ↔ ((𝐺𝐴) ∈ (ℕ0m ℕ) ∧ (𝐺𝐴) ∈ 𝑅))
192190, 16, 1913imtr4i 292 . . 3 ((𝐺𝐴) ∈ (({0, 1} ↑m ℕ) ∩ 𝑅) → (𝐺𝐴) ∈ ((ℕ0m ℕ) ∩ 𝑅))
193 eulerpart.s . . . 4 𝑆 = (𝑓 ∈ ((ℕ0m ℕ) ∩ 𝑅) ↦ Σ𝑘 ∈ ℕ ((𝑓𝑘) · 𝑘))
1949, 193eulerpartlemsv2 34340 . . 3 ((𝐺𝐴) ∈ ((ℕ0m ℕ) ∩ 𝑅) → (𝑆‘(𝐺𝐴)) = Σ𝑘 ∈ ((𝐺𝐴) “ ℕ)(((𝐺𝐴)‘𝑘) · 𝑘))
19515, 192, 1943syl 18 . 2 (𝐴 ∈ (𝑇𝑅) → (𝑆‘(𝐺𝐴)) = Σ𝑘 ∈ ((𝐺𝐴) “ ℕ)(((𝐺𝐴)‘𝑘) · 𝑘))
196119, 151elind 4210 . . 3 (𝐴 ∈ (𝑇𝑅) → 𝐴 ∈ ((ℕ0m ℕ) ∩ 𝑅))
1979, 193eulerpartlemsv2 34340 . . 3 (𝐴 ∈ ((ℕ0m ℕ) ∩ 𝑅) → (𝑆𝐴) = Σ𝑘 ∈ (𝐴 “ ℕ)((𝐴𝑘) · 𝑘))
198196, 197syl 17 . 2 (𝐴 ∈ (𝑇𝑅) → (𝑆𝐴) = Σ𝑘 ∈ (𝐴 “ ℕ)((𝐴𝑘) · 𝑘))
199178, 195, 1983eqtr4d 2785 1 (𝐴 ∈ (𝑇𝑅) → (𝑆‘(𝐺𝐴)) = (𝑆𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1537  wcel 2106  {cab 2712  wral 3059  wrex 3068  {crab 3433  Vcvv 3478  cdif 3960  cin 3962  wss 3963  c0 4339  ifcif 4531  𝒫 cpw 4605  {csn 4631  {cpr 4633  cop 4637   ciun 4996   class class class wbr 5148  {copab 5210  cmpt 5231   × cxp 5687  ccnv 5688  dom cdm 5689  cres 5691  cima 5692  ccom 5693   Fn wfn 6558  wf 6559  1-1-ontowf1o 6562  cfv 6563  (class class class)co 7431  cmpo 7433  1st c1st 8011  2nd c2nd 8012   supp csupp 8184  m cmap 8865  cen 8981  Fincfn 8984  cc 11151  0cc0 11153  1c1 11154   · cmul 11158  cle 11294  cn 12264  2c2 12319  0cn0 12524  cexp 14099  Σcsu 15719  cdvds 16287  bitscbits 16453  𝟭cind 33991
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-inf2 9679  ax-ac2 10501  ax-cnex 11209  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230  ax-pre-sup 11231
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-disj 5116  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-se 5642  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-isom 6572  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-supp 8185  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-1o 8505  df-2o 8506  df-oadd 8509  df-er 8744  df-map 8867  df-pm 8868  df-en 8985  df-dom 8986  df-sdom 8987  df-fin 8988  df-fsupp 9400  df-sup 9480  df-inf 9481  df-oi 9548  df-dju 9939  df-card 9977  df-acn 9980  df-ac 10154  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-div 11919  df-nn 12265  df-2 12327  df-3 12328  df-n0 12525  df-xnn0 12598  df-z 12612  df-uz 12877  df-rp 13033  df-fz 13545  df-fzo 13692  df-fl 13829  df-mod 13907  df-seq 14040  df-exp 14100  df-hash 14367  df-cj 15135  df-re 15136  df-im 15137  df-sqrt 15271  df-abs 15272  df-clim 15521  df-sum 15720  df-dvds 16288  df-bits 16456  df-ind 33992
This theorem is referenced by:  eulerpartlemn  34363
  Copyright terms: Public domain W3C validator