| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > eulerpartlemsv3 | Structured version Visualization version GIF version | ||
| Description: Lemma for eulerpart 34623. Value of the sum of a finite partition 𝐴 (Contributed by Thierry Arnoux, 19-Aug-2018.) |
| Ref | Expression |
|---|---|
| eulerpartlems.r | ⊢ 𝑅 = {𝑓 ∣ (◡𝑓 “ ℕ) ∈ Fin} |
| eulerpartlems.s | ⊢ 𝑆 = (𝑓 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ↦ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘)) |
| Ref | Expression |
|---|---|
| eulerpartlemsv3 | ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (𝑆‘𝐴) = Σ𝑘 ∈ (1...(𝑆‘𝐴))((𝐴‘𝑘) · 𝑘)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eulerpartlems.r | . . 3 ⊢ 𝑅 = {𝑓 ∣ (◡𝑓 “ ℕ) ∈ Fin} | |
| 2 | eulerpartlems.s | . . 3 ⊢ 𝑆 = (𝑓 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ↦ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘)) | |
| 3 | 1, 2 | eulerpartlemsv1 34597 | . 2 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (𝑆‘𝐴) = Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘)) |
| 4 | fzssuz 13556 | . . . . 5 ⊢ (1...(𝑆‘𝐴)) ⊆ (ℤ≥‘1) | |
| 5 | nnuz 12864 | . . . . 5 ⊢ ℕ = (ℤ≥‘1) | |
| 6 | 4, 5 | sseqtrri 3976 | . . . 4 ⊢ (1...(𝑆‘𝐴)) ⊆ ℕ |
| 7 | 6 | a1i 11 | . . 3 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (1...(𝑆‘𝐴)) ⊆ ℕ) |
| 8 | 1, 2 | eulerpartlemelr 34598 | . . . . . . . 8 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (𝐴:ℕ⟶ℕ0 ∧ (◡𝐴 “ ℕ) ∈ Fin)) |
| 9 | 8 | simpld 497 | . . . . . . 7 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → 𝐴:ℕ⟶ℕ0) |
| 10 | 9 | adantr 483 | . . . . . 6 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → 𝐴:ℕ⟶ℕ0) |
| 11 | 7 | sselda 3927 | . . . . . 6 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → 𝑘 ∈ ℕ) |
| 12 | 10, 11 | ffvelcdmd 7051 | . . . . 5 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → (𝐴‘𝑘) ∈ ℕ0) |
| 13 | 12 | nn0cnd 12530 | . . . 4 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → (𝐴‘𝑘) ∈ ℂ) |
| 14 | 11 | nncnd 12212 | . . . 4 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → 𝑘 ∈ ℂ) |
| 15 | 13, 14 | mulcld 11188 | . . 3 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → ((𝐴‘𝑘) · 𝑘) ∈ ℂ) |
| 16 | 1, 2 | eulerpartlems 34601 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑡 ∈ (ℤ≥‘((𝑆‘𝐴) + 1))) → (𝐴‘𝑡) = 0) |
| 17 | 16 | ralrimiva 3144 | . . . . . . . 8 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → ∀𝑡 ∈ (ℤ≥‘((𝑆‘𝐴) + 1))(𝐴‘𝑡) = 0) |
| 18 | fveqeq2 6861 | . . . . . . . . 9 ⊢ (𝑘 = 𝑡 → ((𝐴‘𝑘) = 0 ↔ (𝐴‘𝑡) = 0)) | |
| 19 | 18 | cbvralvw 3230 | . . . . . . . 8 ⊢ (∀𝑘 ∈ (ℤ≥‘((𝑆‘𝐴) + 1))(𝐴‘𝑘) = 0 ↔ ∀𝑡 ∈ (ℤ≥‘((𝑆‘𝐴) + 1))(𝐴‘𝑡) = 0) |
| 20 | 17, 19 | sylibr 236 | . . . . . . 7 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → ∀𝑘 ∈ (ℤ≥‘((𝑆‘𝐴) + 1))(𝐴‘𝑘) = 0) |
| 21 | 1, 2 | eulerpartlemsf 34600 | . . . . . . . . 9 ⊢ 𝑆:((ℕ0 ↑m ℕ) ∩ 𝑅)⟶ℕ0 |
| 22 | 21 | ffvelcdmi 7049 | . . . . . . . 8 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (𝑆‘𝐴) ∈ ℕ0) |
| 23 | nndiffz1 32927 | . . . . . . . 8 ⊢ ((𝑆‘𝐴) ∈ ℕ0 → (ℕ ∖ (1...(𝑆‘𝐴))) = (ℤ≥‘((𝑆‘𝐴) + 1))) | |
| 24 | 22, 23 | syl 17 | . . . . . . 7 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (ℕ ∖ (1...(𝑆‘𝐴))) = (ℤ≥‘((𝑆‘𝐴) + 1))) |
| 25 | 20, 24 | raleqtrrdv 3314 | . . . . . 6 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → ∀𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))(𝐴‘𝑘) = 0) |
| 26 | 25 | r19.21bi 3244 | . . . . 5 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → (𝐴‘𝑘) = 0) |
| 27 | 26 | oveq1d 7396 | . . . 4 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → ((𝐴‘𝑘) · 𝑘) = (0 · 𝑘)) |
| 28 | simpr 487 | . . . . . . 7 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) | |
| 29 | 28 | eldifad 3907 | . . . . . 6 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → 𝑘 ∈ ℕ) |
| 30 | 29 | nncnd 12212 | . . . . 5 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → 𝑘 ∈ ℂ) |
| 31 | 30 | mul02d 11367 | . . . 4 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → (0 · 𝑘) = 0) |
| 32 | 27, 31 | eqtrd 2787 | . . 3 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → ((𝐴‘𝑘) · 𝑘) = 0) |
| 33 | 5 | eqimssi 3987 | . . . 4 ⊢ ℕ ⊆ (ℤ≥‘1) |
| 34 | 33 | a1i 11 | . . 3 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → ℕ ⊆ (ℤ≥‘1)) |
| 35 | 7, 15, 32, 34 | sumss 15723 | . 2 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → Σ𝑘 ∈ (1...(𝑆‘𝐴))((𝐴‘𝑘) · 𝑘) = Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘)) |
| 36 | 3, 35 | eqtr4d 2790 | 1 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (𝑆‘𝐴) = Σ𝑘 ∈ (1...(𝑆‘𝐴))((𝐴‘𝑘) · 𝑘)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 398 = wceq 1550 ∈ wcel 2132 {cab 2730 ∀wral 3066 ∖ cdif 3892 ∩ cin 3894 ⊆ wss 3895 ↦ cmpt 5171 ◡ccnv 5635 “ cima 5639 ⟶wf 6502 ‘cfv 6506 (class class class)co 7381 ↑m cmap 8792 Fincfn 8912 0cc0 11059 1c1 11060 + caddc 11062 · cmul 11064 ℕcn 12196 ℕ0cn0 12467 ℤ≥cuz 12825 ...cfz 13498 Σcsu 15685 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-rep 5217 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 ax-inf2 9582 ax-cnex 11115 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-addrcl 11120 ax-mulcl 11121 ax-mulrcl 11122 ax-mulcom 11123 ax-addass 11124 ax-mulass 11125 ax-distr 11126 ax-i2m1 11127 ax-1ne0 11128 ax-1rid 11129 ax-rnegex 11130 ax-rrecex 11131 ax-cnre 11132 ax-pre-lttri 11133 ax-pre-lttrn 11134 ax-pre-ltadd 11135 ax-pre-mulgt0 11136 ax-pre-sup 11137 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-nel 3052 df-ral 3067 df-rex 3077 df-rmo 3357 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-int 4896 df-iun 4941 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-se 5590 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-pred 6273 df-ord 6334 df-on 6335 df-lim 6336 df-suc 6337 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-isom 6515 df-riota 7338 df-ov 7384 df-oprab 7385 df-mpo 7386 df-om 7832 df-1st 7955 df-2nd 7956 df-supp 8125 df-frecs 8246 df-wrecs 8277 df-recs 8326 df-rdg 8365 df-1o 8421 df-er 8662 df-map 8794 df-pm 8795 df-en 8913 df-dom 8914 df-sdom 8915 df-fin 8916 df-sup 9374 df-inf 9375 df-oi 9444 df-card 9883 df-pnf 11204 df-mnf 11205 df-xr 11206 df-ltxr 11207 df-le 11208 df-sub 11402 df-neg 11403 df-div 11831 df-nn 12197 df-2 12266 df-3 12267 df-n0 12468 df-z 12555 df-uz 12826 df-rp 12980 df-fz 13499 df-fzo 13646 df-fl 13788 df-seq 14001 df-exp 14061 df-hash 14330 df-cj 15098 df-re 15099 df-im 15100 df-sqrt 15234 df-abs 15235 df-clim 15487 df-rlim 15488 df-sum 15686 |
| This theorem is referenced by: eulerpartlemgc 34603 |
| Copyright terms: Public domain | W3C validator |