| 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 34880. 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 34854 | . 2 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (𝑆‘𝐴) = Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘)) |
| 4 | fzssuz 13622 | . . . . 5 ⊢ (1...(𝑆‘𝐴)) ⊆ (ℤ≥‘1) | |
| 5 | nnuz 12929 | . . . . 5 ⊢ ℕ = (ℤ≥‘1) | |
| 6 | 4, 5 | sseqtrri 3983 | . . . 4 ⊢ (1...(𝑆‘𝐴)) ⊆ ℕ |
| 7 | 6 | a1i 11 | . . 3 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (1...(𝑆‘𝐴)) ⊆ ℕ) |
| 8 | 1, 2 | eulerpartlemelr 34855 | . . . . . . . 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 3934 | . . . . . 6 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → 𝑘 ∈ ℕ) |
| 12 | 10, 11 | ffvelcdmd 7081 | . . . . 5 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → (𝐴‘𝑘) ∈ ℕ0) |
| 13 | 12 | nn0cnd 12594 | . . . 4 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → (𝐴‘𝑘) ∈ ℂ) |
| 14 | 11 | nncnd 12276 | . . . 4 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → 𝑘 ∈ ℂ) |
| 15 | 13, 14 | mulcld 11256 | . . 3 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (1...(𝑆‘𝐴))) → ((𝐴‘𝑘) · 𝑘) ∈ ℂ) |
| 16 | 1, 2 | eulerpartlems 34858 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑡 ∈ (ℤ≥‘((𝑆‘𝐴) + 1))) → (𝐴‘𝑡) = 0) |
| 17 | 16 | ralrimiva 3156 | . . . . . . . 8 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → ∀𝑡 ∈ (ℤ≥‘((𝑆‘𝐴) + 1))(𝐴‘𝑡) = 0) |
| 18 | fveqeq2 6891 | . . . . . . . . 9 ⊢ (𝑘 = 𝑡 → ((𝐴‘𝑘) = 0 ↔ (𝐴‘𝑡) = 0)) | |
| 19 | 18 | cbvralvw 3242 | . . . . . . . 8 ⊢ (∀𝑘 ∈ (ℤ≥‘((𝑆‘𝐴) + 1))(𝐴‘𝑘) = 0 ↔ ∀𝑡 ∈ (ℤ≥‘((𝑆‘𝐴) + 1))(𝐴‘𝑡) = 0) |
| 20 | 17, 19 | sylibr 237 | . . . . . . 7 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → ∀𝑘 ∈ (ℤ≥‘((𝑆‘𝐴) + 1))(𝐴‘𝑘) = 0) |
| 21 | 1, 2 | eulerpartlemsf 34857 | . . . . . . . . 9 ⊢ 𝑆:((ℕ0 ↑m ℕ) ∩ 𝑅)⟶ℕ0 |
| 22 | 21 | ffvelcdmi 7079 | . . . . . . . 8 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (𝑆‘𝐴) ∈ ℕ0) |
| 23 | nndiffz1 33244 | . . . . . . . 8 ⊢ ((𝑆‘𝐴) ∈ ℕ0 → (ℕ ∖ (1...(𝑆‘𝐴))) = (ℤ≥‘((𝑆‘𝐴) + 1))) | |
| 24 | 22, 23 | syl 18 | . . . . . . 7 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → (ℕ ∖ (1...(𝑆‘𝐴))) = (ℤ≥‘((𝑆‘𝐴) + 1))) |
| 25 | 20, 24 | raleqtrrdv 3325 | . . . . . 6 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → ∀𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))(𝐴‘𝑘) = 0) |
| 26 | 25 | r19.21bi 3256 | . . . . 5 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → (𝐴‘𝑘) = 0) |
| 27 | 26 | oveq1d 7431 | . . . 4 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → ((𝐴‘𝑘) · 𝑘) = (0 · 𝑘)) |
| 28 | simpr 490 | . . . . . . 7 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) | |
| 29 | 28 | eldifad 3914 | . . . . . 6 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → 𝑘 ∈ ℕ) |
| 30 | 29 | nncnd 12276 | . . . . 5 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → 𝑘 ∈ ℂ) |
| 31 | 30 | mul02d 11435 | . . . 4 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → (0 · 𝑘) = 0) |
| 32 | 27, 31 | eqtrd 2797 | . . 3 ⊢ ((𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) ∧ 𝑘 ∈ (ℕ ∖ (1...(𝑆‘𝐴)))) → ((𝐴‘𝑘) · 𝑘) = 0) |
| 33 | 5 | eqimssi 3994 | . . . 4 ⊢ ℕ ⊆ (ℤ≥‘1) |
| 34 | 33 | a1i 11 | . . 3 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → ℕ ⊆ (ℤ≥‘1)) |
| 35 | 7, 15, 32, 34 | sumss 15812 | . 2 ⊢ (𝐴 ∈ ((ℕ0 ↑m ℕ) ∩ 𝑅) → Σ𝑘 ∈ (1...(𝑆‘𝐴))((𝐴‘𝑘) · 𝑘) = Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘)) |
| 36 | 3, 35 | eqtr4d 2800 | 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 2740 ∀wral 3078 ∖ cdif 3899 ∩ cin 3901 ⊆ wss 3902 ↦ cmpt 5190 ◡ccnv 5658 “ cima 5662 ⟶wf 6533 ‘cfv 6537 (class class class)co 7416 ↑m cmap 8829 Fincfn 8955 0cc0 11127 1c1 11128 + caddc 11130 · cmul 11132 ℕcn 12260 ℕ0cn0 12531 ℤ≥cuz 12890 ...cfz 13563 Σcsu 15775 |
| 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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-inf2 9623 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 ax-pre-sup 11205 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-supp 8162 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8458 df-er 8699 df-map 8831 df-pm 8832 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-sup 9415 df-inf 9416 df-oi 9485 df-card 9947 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-div 11899 df-nn 12261 df-2 12330 df-3 12331 df-n0 12532 df-z 12619 df-uz 12891 df-rp 13045 df-fz 13564 df-fzo 13712 df-fl 13855 df-seq 14068 df-exp 14128 df-hash 14397 df-cj 15188 df-re 15189 df-im 15190 df-sqrt 15324 df-abs 15325 df-clim 15577 df-rlim 15578 df-sum 15776 |
| This theorem is used by: eulerpartlemgc 34860 |
| Copyright terms: Public domain | W3C validator |