| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > trirecip | 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 9258 | . . . 4 ⊢ (𝑘 ∈ ℕ → 2 ∈ ℂ) | |
| 2 | peano2nn 9197 | . . . . . 6 ⊢ (𝑘 ∈ ℕ → (𝑘 + 1) ∈ ℕ) | |
| 3 | nnmulcl 9206 | . . . . . 6 ⊢ ((𝑘 ∈ ℕ ∧ (𝑘 + 1) ∈ ℕ) → (𝑘 · (𝑘 + 1)) ∈ ℕ) | |
| 4 | 2, 3 | mpdan 421 | . . . . 5 ⊢ (𝑘 ∈ ℕ → (𝑘 · (𝑘 + 1)) ∈ ℕ) |
| 5 | 4 | nncnd 9199 | . . . 4 ⊢ (𝑘 ∈ ℕ → (𝑘 · (𝑘 + 1)) ∈ ℂ) |
| 6 | 4 | nnap0d 9231 | . . . 4 ⊢ (𝑘 ∈ ℕ → (𝑘 · (𝑘 + 1)) # 0) |
| 7 | 1, 5, 6 | divrecapd 9015 | . . 3 ⊢ (𝑘 ∈ ℕ → (2 / (𝑘 · (𝑘 + 1))) = (2 · (1 / (𝑘 · (𝑘 + 1))))) |
| 8 | 7 | sumeq2i 11987 | . 2 ⊢ Σ𝑘 ∈ ℕ (2 / (𝑘 · (𝑘 + 1))) = Σ𝑘 ∈ ℕ (2 · (1 / (𝑘 · (𝑘 + 1)))) |
| 9 | nnuz 9836 | . . . . 5 ⊢ ℕ = (ℤ≥‘1) | |
| 10 | 1zzd 9550 | . . . . 5 ⊢ (⊤ → 1 ∈ ℤ) | |
| 11 | simpr 110 | . . . . . 6 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℕ) | |
| 12 | 4 | adantl 277 | . . . . . . 7 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (𝑘 · (𝑘 + 1)) ∈ ℕ) |
| 13 | 12 | nnrecred 9232 | . . . . . 6 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (1 / (𝑘 · (𝑘 + 1))) ∈ ℝ) |
| 14 | id 19 | . . . . . . . . 9 ⊢ (𝑛 = 𝑘 → 𝑛 = 𝑘) | |
| 15 | oveq1 6035 | . . . . . . . . 9 ⊢ (𝑛 = 𝑘 → (𝑛 + 1) = (𝑘 + 1)) | |
| 16 | 14, 15 | oveq12d 6046 | . . . . . . . 8 ⊢ (𝑛 = 𝑘 → (𝑛 · (𝑛 + 1)) = (𝑘 · (𝑘 + 1))) |
| 17 | 16 | oveq2d 6044 | . . . . . . 7 ⊢ (𝑛 = 𝑘 → (1 / (𝑛 · (𝑛 + 1))) = (1 / (𝑘 · (𝑘 + 1)))) |
| 18 | eqid 2231 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1)))) = (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1)))) | |
| 19 | 17, 18 | fvmptg 5731 | . . . . . 6 ⊢ ((𝑘 ∈ ℕ ∧ (1 / (𝑘 · (𝑘 + 1))) ∈ ℝ) → ((𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))‘𝑘) = (1 / (𝑘 · (𝑘 + 1)))) |
| 20 | 11, 13, 19 | syl2anc 411 | . . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))‘𝑘) = (1 / (𝑘 · (𝑘 + 1)))) |
| 21 | 4 | nnrecred 9232 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ → (1 / (𝑘 · (𝑘 + 1))) ∈ ℝ) |
| 22 | 21 | recnd 8250 | . . . . . 6 ⊢ (𝑘 ∈ ℕ → (1 / (𝑘 · (𝑘 + 1))) ∈ ℂ) |
| 23 | 22 | adantl 277 | . . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (1 / (𝑘 · (𝑘 + 1))) ∈ ℂ) |
| 24 | 18 | trireciplem 12124 | . . . . . . 7 ⊢ seq1( + , (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))) ⇝ 1 |
| 25 | 24 | a1i 9 | . . . . . 6 ⊢ (⊤ → seq1( + , (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))) ⇝ 1) |
| 26 | climrel 11903 | . . . . . . 7 ⊢ Rel ⇝ | |
| 27 | 26 | releldmi 4977 | . . . . . 6 ⊢ (seq1( + , (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))) ⇝ 1 → seq1( + , (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))) ∈ dom ⇝ ) |
| 28 | 25, 27 | syl 14 | . . . . 5 ⊢ (⊤ → seq1( + , (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))) ∈ dom ⇝ ) |
| 29 | 2cnd 9258 | . . . . 5 ⊢ (⊤ → 2 ∈ ℂ) | |
| 30 | 9, 10, 20, 23, 28, 29 | isummulc2 12050 | . . . 4 ⊢ (⊤ → (2 · Σ𝑘 ∈ ℕ (1 / (𝑘 · (𝑘 + 1)))) = Σ𝑘 ∈ ℕ (2 · (1 / (𝑘 · (𝑘 + 1))))) |
| 31 | 9, 10, 20, 23, 25 | isumclim 12045 | . . . . 5 ⊢ (⊤ → Σ𝑘 ∈ ℕ (1 / (𝑘 · (𝑘 + 1))) = 1) |
| 32 | 31 | oveq2d 6044 | . . . 4 ⊢ (⊤ → (2 · Σ𝑘 ∈ ℕ (1 / (𝑘 · (𝑘 + 1)))) = (2 · 1)) |
| 33 | 30, 32 | eqtr3d 2266 | . . 3 ⊢ (⊤ → Σ𝑘 ∈ ℕ (2 · (1 / (𝑘 · (𝑘 + 1)))) = (2 · 1)) |
| 34 | 33 | mptru 1407 | . 2 ⊢ Σ𝑘 ∈ ℕ (2 · (1 / (𝑘 · (𝑘 + 1)))) = (2 · 1) |
| 35 | 2t1e2 9339 | . 2 ⊢ (2 · 1) = 2 | |
| 36 | 8, 34, 35 | 3eqtri 2256 | 1 ⊢ Σ𝑘 ∈ ℕ (2 / (𝑘 · (𝑘 + 1))) = 2 |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 = wceq 1398 ⊤wtru 1399 ∈ wcel 2202 class class class wbr 4093 ↦ cmpt 4155 dom cdm 4731 ‘cfv 5333 (class class class)co 6028 ℂcc 8073 ℝcr 8074 1c1 8076 + caddc 8078 · cmul 8080 / cdiv 8894 ℕcn 9185 2c2 9236 seqcseq 10755 ⇝ cli 11901 Σcsu 11976 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-mulrcl 8174 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-precex 8185 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 ax-pre-mulgt0 8192 ax-pre-mulext 8193 ax-arch 8194 ax-caucvg 8195 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-po 4399 df-iso 4400 df-iord 4469 df-on 4471 df-ilim 4472 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-isom 5342 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-irdg 6579 df-frec 6600 df-1o 6625 df-oadd 6629 df-er 6745 df-en 6953 df-dom 6954 df-fin 6955 df-pnf 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-reap 8797 df-ap 8804 df-div 8895 df-inn 9186 df-2 9244 df-3 9245 df-4 9246 df-n0 9445 df-z 9524 df-uz 9800 df-q 9898 df-rp 9933 df-fz 10289 df-fzo 10423 df-seqfrec 10756 df-exp 10847 df-ihash 11084 df-shft 11438 df-cj 11465 df-re 11466 df-im 11467 df-rsqrt 11621 df-abs 11622 df-clim 11902 df-sumdc 11977 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |