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 8951 | . . . 4 ⊢ (𝑘 ∈ ℕ → 2 ∈ ℂ) | |
2 | peano2nn 8890 | . . . . . 6 ⊢ (𝑘 ∈ ℕ → (𝑘 + 1) ∈ ℕ) | |
3 | nnmulcl 8899 | . . . . . 6 ⊢ ((𝑘 ∈ ℕ ∧ (𝑘 + 1) ∈ ℕ) → (𝑘 · (𝑘 + 1)) ∈ ℕ) | |
4 | 2, 3 | mpdan 419 | . . . . 5 ⊢ (𝑘 ∈ ℕ → (𝑘 · (𝑘 + 1)) ∈ ℕ) |
5 | 4 | nncnd 8892 | . . . 4 ⊢ (𝑘 ∈ ℕ → (𝑘 · (𝑘 + 1)) ∈ ℂ) |
6 | 4 | nnap0d 8924 | . . . 4 ⊢ (𝑘 ∈ ℕ → (𝑘 · (𝑘 + 1)) # 0) |
7 | 1, 5, 6 | divrecapd 8710 | . . 3 ⊢ (𝑘 ∈ ℕ → (2 / (𝑘 · (𝑘 + 1))) = (2 · (1 / (𝑘 · (𝑘 + 1))))) |
8 | 7 | sumeq2i 11327 | . 2 ⊢ Σ𝑘 ∈ ℕ (2 / (𝑘 · (𝑘 + 1))) = Σ𝑘 ∈ ℕ (2 · (1 / (𝑘 · (𝑘 + 1)))) |
9 | nnuz 9522 | . . . . 5 ⊢ ℕ = (ℤ≥‘1) | |
10 | 1zzd 9239 | . . . . 5 ⊢ (⊤ → 1 ∈ ℤ) | |
11 | simpr 109 | . . . . . 6 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℕ) | |
12 | 4 | adantl 275 | . . . . . . 7 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (𝑘 · (𝑘 + 1)) ∈ ℕ) |
13 | 12 | nnrecred 8925 | . . . . . 6 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (1 / (𝑘 · (𝑘 + 1))) ∈ ℝ) |
14 | id 19 | . . . . . . . . 9 ⊢ (𝑛 = 𝑘 → 𝑛 = 𝑘) | |
15 | oveq1 5860 | . . . . . . . . 9 ⊢ (𝑛 = 𝑘 → (𝑛 + 1) = (𝑘 + 1)) | |
16 | 14, 15 | oveq12d 5871 | . . . . . . . 8 ⊢ (𝑛 = 𝑘 → (𝑛 · (𝑛 + 1)) = (𝑘 · (𝑘 + 1))) |
17 | 16 | oveq2d 5869 | . . . . . . 7 ⊢ (𝑛 = 𝑘 → (1 / (𝑛 · (𝑛 + 1))) = (1 / (𝑘 · (𝑘 + 1)))) |
18 | eqid 2170 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1)))) = (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1)))) | |
19 | 17, 18 | fvmptg 5572 | . . . . . 6 ⊢ ((𝑘 ∈ ℕ ∧ (1 / (𝑘 · (𝑘 + 1))) ∈ ℝ) → ((𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))‘𝑘) = (1 / (𝑘 · (𝑘 + 1)))) |
20 | 11, 13, 19 | syl2anc 409 | . . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))‘𝑘) = (1 / (𝑘 · (𝑘 + 1)))) |
21 | 4 | nnrecred 8925 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ → (1 / (𝑘 · (𝑘 + 1))) ∈ ℝ) |
22 | 21 | recnd 7948 | . . . . . 6 ⊢ (𝑘 ∈ ℕ → (1 / (𝑘 · (𝑘 + 1))) ∈ ℂ) |
23 | 22 | adantl 275 | . . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (1 / (𝑘 · (𝑘 + 1))) ∈ ℂ) |
24 | 18 | trireciplem 11463 | . . . . . . 7 ⊢ seq1( + , (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))) ⇝ 1 |
25 | 24 | a1i 9 | . . . . . 6 ⊢ (⊤ → seq1( + , (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))) ⇝ 1) |
26 | climrel 11243 | . . . . . . 7 ⊢ Rel ⇝ | |
27 | 26 | releldmi 4850 | . . . . . 6 ⊢ (seq1( + , (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))) ⇝ 1 → seq1( + , (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))) ∈ dom ⇝ ) |
28 | 25, 27 | syl 14 | . . . . 5 ⊢ (⊤ → seq1( + , (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))) ∈ dom ⇝ ) |
29 | 2cnd 8951 | . . . . 5 ⊢ (⊤ → 2 ∈ ℂ) | |
30 | 9, 10, 20, 23, 28, 29 | isummulc2 11389 | . . . 4 ⊢ (⊤ → (2 · Σ𝑘 ∈ ℕ (1 / (𝑘 · (𝑘 + 1)))) = Σ𝑘 ∈ ℕ (2 · (1 / (𝑘 · (𝑘 + 1))))) |
31 | 9, 10, 20, 23, 25 | isumclim 11384 | . . . . 5 ⊢ (⊤ → Σ𝑘 ∈ ℕ (1 / (𝑘 · (𝑘 + 1))) = 1) |
32 | 31 | oveq2d 5869 | . . . 4 ⊢ (⊤ → (2 · Σ𝑘 ∈ ℕ (1 / (𝑘 · (𝑘 + 1)))) = (2 · 1)) |
33 | 30, 32 | eqtr3d 2205 | . . 3 ⊢ (⊤ → Σ𝑘 ∈ ℕ (2 · (1 / (𝑘 · (𝑘 + 1)))) = (2 · 1)) |
34 | 33 | mptru 1357 | . 2 ⊢ Σ𝑘 ∈ ℕ (2 · (1 / (𝑘 · (𝑘 + 1)))) = (2 · 1) |
35 | 2t1e2 9031 | . 2 ⊢ (2 · 1) = 2 | |
36 | 8, 34, 35 | 3eqtri 2195 | 1 ⊢ Σ𝑘 ∈ ℕ (2 / (𝑘 · (𝑘 + 1))) = 2 |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 = wceq 1348 ⊤wtru 1349 ∈ wcel 2141 class class class wbr 3989 ↦ cmpt 4050 dom cdm 4611 ‘cfv 5198 (class class class)co 5853 ℂcc 7772 ℝcr 7773 1c1 7775 + caddc 7777 · cmul 7779 / cdiv 8589 ℕcn 8878 2c2 8929 seqcseq 10401 ⇝ cli 11241 Σcsu 11316 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-coll 4104 ax-sep 4107 ax-nul 4115 ax-pow 4160 ax-pr 4194 ax-un 4418 ax-setind 4521 ax-iinf 4572 ax-cnex 7865 ax-resscn 7866 ax-1cn 7867 ax-1re 7868 ax-icn 7869 ax-addcl 7870 ax-addrcl 7871 ax-mulcl 7872 ax-mulrcl 7873 ax-addcom 7874 ax-mulcom 7875 ax-addass 7876 ax-mulass 7877 ax-distr 7878 ax-i2m1 7879 ax-0lt1 7880 ax-1rid 7881 ax-0id 7882 ax-rnegex 7883 ax-precex 7884 ax-cnre 7885 ax-pre-ltirr 7886 ax-pre-ltwlin 7887 ax-pre-lttrn 7888 ax-pre-apti 7889 ax-pre-ltadd 7890 ax-pre-mulgt0 7891 ax-pre-mulext 7892 ax-arch 7893 ax-caucvg 7894 |
This theorem depends on definitions: df-bi 116 df-dc 830 df-3or 974 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-ral 2453 df-rex 2454 df-reu 2455 df-rmo 2456 df-rab 2457 df-v 2732 df-sbc 2956 df-csb 3050 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-nul 3415 df-if 3527 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-int 3832 df-iun 3875 df-br 3990 df-opab 4051 df-mpt 4052 df-tr 4088 df-id 4278 df-po 4281 df-iso 4282 df-iord 4351 df-on 4353 df-ilim 4354 df-suc 4356 df-iom 4575 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-rn 4622 df-res 4623 df-ima 4624 df-iota 5160 df-fun 5200 df-fn 5201 df-f 5202 df-f1 5203 df-fo 5204 df-f1o 5205 df-fv 5206 df-isom 5207 df-riota 5809 df-ov 5856 df-oprab 5857 df-mpo 5858 df-1st 6119 df-2nd 6120 df-recs 6284 df-irdg 6349 df-frec 6370 df-1o 6395 df-oadd 6399 df-er 6513 df-en 6719 df-dom 6720 df-fin 6721 df-pnf 7956 df-mnf 7957 df-xr 7958 df-ltxr 7959 df-le 7960 df-sub 8092 df-neg 8093 df-reap 8494 df-ap 8501 df-div 8590 df-inn 8879 df-2 8937 df-3 8938 df-4 8939 df-n0 9136 df-z 9213 df-uz 9488 df-q 9579 df-rp 9611 df-fz 9966 df-fzo 10099 df-seqfrec 10402 df-exp 10476 df-ihash 10710 df-shft 10779 df-cj 10806 df-re 10807 df-im 10808 df-rsqrt 10962 df-abs 10963 df-clim 11242 df-sumdc 11317 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |