| 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 34948. 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 34922 | . 2 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (𝑆‘𝐴) = Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘)) |
| 4 | fzssuz 13667 | . . . . 5 ⊢ (1...(𝑆‘𝐴)) ⊆ (ℤ≥‘1) | |
| 5 | nnuz 12973 | . . . . 5 ⊢ ℕ = (ℤ≥‘1) | |
| 6 | 4, 5 | sseqtrri 3979 | . . . 4 ⊢ (1...(𝑆‘𝐴)) ⊆ ℕ |
| 7 | 6 | a1i 11 | . . 3 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (1...(𝑆‘𝐴)) ⊆ ℕ) |
| 8 | 1, 2 | eulerpartlemelr 34923 | . . . . . . . 8 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (𝐴:ℕ⟶ℕ0 ∧ (◡𝐴 “ ℕ) ∈ Fin)) |
| 9 | 8 | simpld 500 | . . . . . . 7 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → 𝐴:ℕ⟶ℕ0) |
| 10 | 9 | adantr 486 | . . . . . 6 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → 𝐴:ℕ⟶ℕ0) |
| 11 | 7 | sselda 3930 | . . . . . 6 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → 𝑘 ∈ ℕ) |
| 12 | 10, 11 | ffvelcdmd 7073 | . . . . 5 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → (𝐴‘𝑘) ∈ ℕ0) |
| 13 | 12 | nn0cnd 12638 | . . . 4 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → (𝐴‘𝑘) ∈ ℂ) |
| 14 | 11 | nncnd 12320 | . . . 4 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → 𝑘 ∈ ℂ) |
| 15 | 13, 14 | mulcld 11300 | . . 3 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → ((𝐴‘𝑘) · 𝑘) ∈ ℂ) |
| 16 | 1, 2 | eulerpartlems 34926 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑡 ∈ (ℤ≥‘((𝑆‘𝐴) + 1))) → (𝐴‘𝑡) = 0) |
| 17 | 16 | ralrimiva 3154 | . . . . . . . 8 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → ∀𝑡 ∈ (ℤ≥‘((𝑆‘𝐴) + 1))(𝐴‘𝑡) = 0) |
| 18 | fveqeq2 6882 | . . . . . . . . 9 ⊢ (𝑘 = 𝑡 → ((𝐴‘𝑘) = 0 ↔ (𝐴‘𝑡) = 0)) | |
| 19 | 18 | cbvralvw 3240 | . . . . . . . 8 ⊢ (∀𝑘 ∈ (ℤ≥‘((𝑆‘𝐴) + 1))(𝐴‘𝑘) = 0 ↔ ∀𝑡 ∈ (ℤ≥‘((𝑆‘𝐴) + 1))(𝐴‘𝑡) = 0) |
| 20 | 17, 19 | sylibr 237 | . . . . . . 7 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → ∀𝑘 ∈ (ℤ≥‘((𝑆‘𝐴) + 1))(𝐴‘𝑘) = 0) |
| 21 | 1, 2 | eulerpartlemsf 34925 | . . . . . . . . 9 ⊢ 𝑆:((ℕ0 ↑m ℕ) ∩ 𝑅)⟶ℕ0 |
| 22 | 21 | ffvelcdmi 7071 | . . . . . . . 8 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (𝑆‘𝐴) ∈ ℕ0) |
| 23 | nndiffz1 33311 | . . . . . . . 8 ⊢ ((𝑆‘𝐴) ∈ ℕ0 → (ℕ ∖ (1...(𝑆‘𝐴))) = (ℤ≥‘((𝑆‘𝐴) + 1))) | |
| 24 | 22, 23 | syl 18 | . . . . . . 7 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (ℕ ∖ (1...(𝑆‘𝐴))) = (ℤ≥‘((𝑆‘𝐴) + 1))) |
| 25 | 20, 24 | raleqtrrdv 3323 | . . . . . 6 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → ∀𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))(𝐴‘𝑘) = 0) |
| 26 | 25 | r19.21bi 3254 | . . . . 5 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → (𝐴‘𝑘) = 0) |
| 27 | 26 | oveq1d 7423 | . . . 4 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → ((𝐴‘𝑘) · 𝑘) = (0 · 𝑘)) |
| 28 | simpr 490 | . . . . . . 7 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) | |
| 29 | 28 | eldifad 3910 | . . . . . 6 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → 𝑘 ∈ ℕ) |
| 30 | 29 | nncnd 12320 | . . . . 5 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → 𝑘 ∈ ℂ) |
| 31 | 30 | mul02d 11479 | . . . 4 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → (0 · 𝑘) = 0) |
| 32 | 27, 31 | eqtrd 2795 | . . 3 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → ((𝐴‘𝑘) · 𝑘) = 0) |
| 33 | 5 | eqimssi 3990 | . . . 4 ⊢ ℕ ⊆ (ℤ≥‘1) |
| 34 | 33 | a1i 11 | . . 3 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → ℕ ⊆ (ℤ≥‘1)) |
| 35 | 7, 15, 32, 34 | sumss 15857 | . 2 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → Σ𝑘 ∈ (1...(𝑆‘𝐴))((𝐴‘𝑘) · 𝑘) = Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘)) |
| 36 | 3, 35 | eqtr4d 2798 | 1 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (𝑆‘𝐴) = Σ𝑘 ∈ (1...(𝑆‘𝐴))((𝐴‘𝑘) · 𝑘)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {cab 2738 ∀wral 3076 ∖ cdif 3895 ∩ cin 3897 ⊆ wss 3898 ↦ cmpt 5185 ◡ccnv 5646 “ cima 5650 ⟶wf 6523 ‘cfv 6527 (class class class)co 7408 ↑m cmap 8825 Fincfn 8951 0cc0 11171 1c1 11172 + caddc 11174 · cmul 11176 ℕcn 12304 ℕ0cn0 12575 ℤ≥cuz 12934 ...cfz 13608 Σcsu 15820 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-inf2 9620 ax-cnex 11227 ax-resscn 11228 ax-1cn 11229 ax-icn 11230 ax-addcl 11231 ax-addrcl 11232 ax-mulcl 11233 ax-mulrcl 11234 ax-mulcom 11235 ax-addass 11236 ax-mulass 11237 ax-distr 11238 ax-i2m1 11239 ax-1ne0 11240 ax-1rid 11241 ax-rnegex 11242 ax-rrecex 11243 ax-cnre 11244 ax-pre-lttri 11245 ax-pre-lttrn 11246 ax-pre-ltadd 11247 ax-pre-mulgt0 11248 ax-pre-sup 11249 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-se 5601 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6293 df-ord 6354 df-on 6355 df-lim 6356 df-suc 6357 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-isom 6536 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7861 df-1st 7984 df-2nd 7985 df-supp 8156 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8454 df-er 8695 df-map 8827 df-pm 8828 df-en 8952 df-dom 8953 df-sdom 8954 df-fin 8955 df-sup 9412 df-inf 9413 df-oi 9482 df-card 9991 df-pnf 11316 df-mnf 11317 df-xr 11318 df-ltxr 11319 df-le 11320 df-sub 11514 df-neg 11515 df-div 11943 df-nn 12305 df-2 12374 df-3 12375 df-n0 12576 df-z 12663 df-uz 12935 df-rp 13090 df-fz 13609 df-fzo 13757 df-fl 13900 df-seq 14113 df-exp 14173 df-hash 14442 df-cj 15233 df-re 15234 df-im 15235 df-sqrt 15369 df-abs 15370 df-clim 15622 df-rlim 15623 df-sum 15821 |
| This theorem is used by: eulerpartlemgc 34928 |
| Copyright terms: Public domain | W3C validator |