| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > trirecip | Structured version Visualization version GIF version | ||
| Description: The sum of the reciprocals of the triangle numbers converge to two. This is Metamath 100 proof #42. (Contributed by Scott Fenton, 23-Apr-2014.) (Revised by Mario Carneiro, 22-May-2014.) |
| Ref | Expression |
|---|---|
| trirecip | ⊢ Σ𝑘 ∈ ℕ (2 / (𝑘 · (𝑘 + 1))) = 2 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2cnd 12318 | . . . 4 ⊢ (𝑘 ∈ ℕ → 2 ∈ ℂ) | |
| 2 | peano2nn 12252 | . . . . . 6 ⊢ (𝑘 ∈ ℕ → (𝑘 + 1) ∈ ℕ) | |
| 3 | nnmulcl 12264 | . . . . . 6 ⊢ ((𝑘 ∈ ℕ ∧ (𝑘 + 1) ∈ ℕ) → (𝑘 · (𝑘 + 1)) ∈ ℕ) | |
| 4 | 2, 3 | mpdan 687 | . . . . 5 ⊢ (𝑘 ∈ ℕ → (𝑘 · (𝑘 + 1)) ∈ ℕ) |
| 5 | 4 | nncnd 12256 | . . . 4 ⊢ (𝑘 ∈ ℕ → (𝑘 · (𝑘 + 1)) ∈ ℂ) |
| 6 | 4 | nnne0d 12290 | . . . 4 ⊢ (𝑘 ∈ ℕ → (𝑘 · (𝑘 + 1)) ≠ 0) |
| 7 | 1, 5, 6 | divrecd 12020 | . . 3 ⊢ (𝑘 ∈ ℕ → (2 / (𝑘 · (𝑘 + 1))) = (2 · (1 / (𝑘 · (𝑘 + 1))))) |
| 8 | 7 | sumeq2i 15714 | . 2 ⊢ Σ𝑘 ∈ ℕ (2 / (𝑘 · (𝑘 + 1))) = Σ𝑘 ∈ ℕ (2 · (1 / (𝑘 · (𝑘 + 1)))) |
| 9 | nnuz 12895 | . . . . 5 ⊢ ℕ = (ℤ≥‘1) | |
| 10 | 1zzd 12623 | . . . . 5 ⊢ (⊤ → 1 ∈ ℤ) | |
| 11 | id 22 | . . . . . . . . 9 ⊢ (𝑛 = 𝑘 → 𝑛 = 𝑘) | |
| 12 | oveq1 7412 | . . . . . . . . 9 ⊢ (𝑛 = 𝑘 → (𝑛 + 1) = (𝑘 + 1)) | |
| 13 | 11, 12 | oveq12d 7423 | . . . . . . . 8 ⊢ (𝑛 = 𝑘 → (𝑛 · (𝑛 + 1)) = (𝑘 · (𝑘 + 1))) |
| 14 | 13 | oveq2d 7421 | . . . . . . 7 ⊢ (𝑛 = 𝑘 → (1 / (𝑛 · (𝑛 + 1))) = (1 / (𝑘 · (𝑘 + 1)))) |
| 15 | eqid 2735 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1)))) = (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1)))) | |
| 16 | ovex 7438 | . . . . . . 7 ⊢ (1 / (𝑘 · (𝑘 + 1))) ∈ V | |
| 17 | 14, 15, 16 | fvmpt 6986 | . . . . . 6 ⊢ (𝑘 ∈ ℕ → ((𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))‘𝑘) = (1 / (𝑘 · (𝑘 + 1)))) |
| 18 | 17 | adantl 481 | . . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))‘𝑘) = (1 / (𝑘 · (𝑘 + 1)))) |
| 19 | 4 | nnrecred 12291 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ → (1 / (𝑘 · (𝑘 + 1))) ∈ ℝ) |
| 20 | 19 | recnd 11263 | . . . . . 6 ⊢ (𝑘 ∈ ℕ → (1 / (𝑘 · (𝑘 + 1))) ∈ ℂ) |
| 21 | 20 | adantl 481 | . . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (1 / (𝑘 · (𝑘 + 1))) ∈ ℂ) |
| 22 | 15 | trireciplem 15878 | . . . . . . 7 ⊢ seq1( + , (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))) ⇝ 1 |
| 23 | 22 | a1i 11 | . . . . . 6 ⊢ (⊤ → seq1( + , (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))) ⇝ 1) |
| 24 | climrel 15508 | . . . . . . 7 ⊢ Rel ⇝ | |
| 25 | 24 | releldmi 5928 | . . . . . 6 ⊢ (seq1( + , (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))) ⇝ 1 → seq1( + , (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))) ∈ dom ⇝ ) |
| 26 | 23, 25 | syl 17 | . . . . 5 ⊢ (⊤ → seq1( + , (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))) ∈ dom ⇝ ) |
| 27 | 2cnd 12318 | . . . . 5 ⊢ (⊤ → 2 ∈ ℂ) | |
| 28 | 9, 10, 18, 21, 26, 27 | isummulc2 15778 | . . . 4 ⊢ (⊤ → (2 · Σ𝑘 ∈ ℕ (1 / (𝑘 · (𝑘 + 1)))) = Σ𝑘 ∈ ℕ (2 · (1 / (𝑘 · (𝑘 + 1))))) |
| 29 | 9, 10, 18, 21, 23 | isumclim 15773 | . . . . 5 ⊢ (⊤ → Σ𝑘 ∈ ℕ (1 / (𝑘 · (𝑘 + 1))) = 1) |
| 30 | 29 | oveq2d 7421 | . . . 4 ⊢ (⊤ → (2 · Σ𝑘 ∈ ℕ (1 / (𝑘 · (𝑘 + 1)))) = (2 · 1)) |
| 31 | 28, 30 | eqtr3d 2772 | . . 3 ⊢ (⊤ → Σ𝑘 ∈ ℕ (2 · (1 / (𝑘 · (𝑘 + 1)))) = (2 · 1)) |
| 32 | 31 | mptru 1547 | . 2 ⊢ Σ𝑘 ∈ ℕ (2 · (1 / (𝑘 · (𝑘 + 1)))) = (2 · 1) |
| 33 | 2t1e2 12403 | . 2 ⊢ (2 · 1) = 2 | |
| 34 | 8, 32, 33 | 3eqtri 2762 | 1 ⊢ Σ𝑘 ∈ ℕ (2 / (𝑘 · (𝑘 + 1))) = 2 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 ⊤wtru 1541 ∈ wcel 2108 class class class wbr 5119 ↦ cmpt 5201 dom cdm 5654 ‘cfv 6531 (class class class)co 7405 ℂcc 11127 1c1 11130 + caddc 11132 · cmul 11134 / cdiv 11894 ℕcn 12240 2c2 12295 seqcseq 14019 ⇝ cli 15500 Σcsu 15702 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-inf2 9655 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206 ax-pre-sup 11207 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-int 4923 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-se 5607 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7862 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-er 8719 df-pm 8843 df-en 8960 df-dom 8961 df-sdom 8962 df-fin 8963 df-sup 9454 df-inf 9455 df-oi 9524 df-card 9953 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-div 11895 df-nn 12241 df-2 12303 df-3 12304 df-n0 12502 df-z 12589 df-uz 12853 df-rp 13009 df-fz 13525 df-fzo 13672 df-fl 13809 df-seq 14020 df-exp 14080 df-hash 14349 df-shft 15086 df-cj 15118 df-re 15119 df-im 15120 df-sqrt 15254 df-abs 15255 df-clim 15504 df-rlim 15505 df-sum 15703 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |