Theorem trireciplem 16075

Description: Lemma for trirecip 16076. Show that the sum converges. (Contributed by Scott Fenton, 22-Apr-2014.) (Revised by Mario Carneiro, 22-May-2014.)

Hypothesis

Ref	Expression
trireciplem.1	⊢ 𝐹 = (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))

Assertion

Ref	Expression
trireciplem	⊢ seq1( + , 𝐹) ⇝ 1

Proof of Theorem trireciplem

Dummy variables 𝑗 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nnuz 13044	. . . 4 ⊢ ℕ = (ℤ≥‘1)
2		1zzd 12767	. . . 4 ⊢ (⊤ → 1 ∈ ℤ)
3		1cnd 11341	. . . . 5 ⊢ (⊤ → 1 ∈ ℂ)
4		nnex 12381	. . . . . . 7 ⊢ ℕ ∈ V
5	4	mptex 7260	. . . . . 6 ⊢ (𝑛 ∈ ℕ ↦ (1 / (𝑛 + 1))) ∈ V
6	5	a1i 11	. . . . 5 ⊢ (⊤ → (𝑛 ∈ ℕ ↦ (1 / (𝑛 + 1))) ∈ V)
7		oveq1 7458	. . . . . . . 8 ⊢ (𝑛 = 𝑘 → (𝑛 + 1) = (𝑘 + 1))
8	7	oveq2d 7467	. . . . . . 7 ⊢ (𝑛 = 𝑘 → (1 / (𝑛 + 1)) = (1 / (𝑘 + 1)))
9		eqid 2763	. . . . . . 7 ⊢ (𝑛 ∈ ℕ ↦ (1 / (𝑛 + 1))) = (𝑛 ∈ ℕ ↦ (1 / (𝑛 + 1)))
10		ovex 7484	. . . . . . 7 ⊢ (1 / (𝑘 + 1)) ∈ V
11	8, 9, 10	fvmpt 7024	. . . . . 6 ⊢ (𝑘 ∈ ℕ → ((𝑛 ∈ ℕ ↦ (1 / (𝑛 + 1)))‘𝑘) = (1 / (𝑘 + 1)))
12	11	adantl 487	. . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ (1 / (𝑛 + 1)))‘𝑘) = (1 / (𝑘 + 1)))
13	1, 2, 3, 2, 6, 12	divcnvshft 16068	. . . 4 ⊢ (⊤ → (𝑛 ∈ ℕ ↦ (1 / (𝑛 + 1))) ⇝ 0)
14		seqex 14186	. . . . 5 ⊢ seq1( + , 𝐹) ∈ V
15	14	a1i 11	. . . 4 ⊢ (⊤ → seq1( + , 𝐹) ∈ V)
16		peano2nn 12387	. . . . . . . 8 ⊢ (𝑘 ∈ ℕ → (𝑘 + 1) ∈ ℕ)
17	16	adantl 487	. . . . . . 7 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (𝑘 + 1) ∈ ℕ)
18	17	nnrecred 12429	. . . . . 6 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (1 / (𝑘 + 1)) ∈ ℝ)
19	18	recnd 11376	. . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (1 / (𝑘 + 1)) ∈ ℂ)
20	12, 19	eqeltrd 2864	. . . 4 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ (1 / (𝑛 + 1)))‘𝑘) ∈ ℂ)
21	12	oveq2d 7467	. . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (1 − ((𝑛 ∈ ℕ ↦ (1 / (𝑛 + 1)))‘𝑘)) = (1 − (1 / (𝑘 + 1))))
22		elfznn 13727	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ (1...𝑘) → 𝑗 ∈ ℕ)
23	22	adantl 487	. . . . . . . . . . 11 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → 𝑗 ∈ ℕ)
24	23	nncnd 12391	. . . . . . . . . 10 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → 𝑗 ∈ ℂ)
25		peano2cn 11521	. . . . . . . . . 10 ⊢ (𝑗 ∈ ℂ → (𝑗 + 1) ∈ ℂ)
26	24, 25	syl 18	. . . . . . . . 9 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (𝑗 + 1) ∈ ℂ)
27		peano2nn 12387	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ ℕ → (𝑗 + 1) ∈ ℕ)
28	23, 27	syl 18	. . . . . . . . . . 11 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (𝑗 + 1) ∈ ℕ)
29	23, 28	nnmulcld 12431	. . . . . . . . . 10 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (𝑗 · (𝑗 + 1)) ∈ ℕ)
30	29	nncnd 12391	. . . . . . . . 9 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (𝑗 · (𝑗 + 1)) ∈ ℂ)
31	29	nnne0d 12428	. . . . . . . . 9 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (𝑗 · (𝑗 + 1)) ≠ 0)
32	26, 24, 30, 31	divsubdird 12172	. . . . . . . 8 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (((𝑗 + 1) − 𝑗) / (𝑗 · (𝑗 + 1))) = (((𝑗 + 1) / (𝑗 · (𝑗 + 1))) − (𝑗 / (𝑗 · (𝑗 + 1)))))
33		ax-1cn 11297	. . . . . . . . . 10 ⊢ 1 ∈ ℂ
34		pncan2 11603	. . . . . . . . . 10 ⊢ ((𝑗 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑗 + 1) − 𝑗) = 1)
35	24, 33, 34	sylancl 598	. . . . . . . . 9 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → ((𝑗 + 1) − 𝑗) = 1)
36	35	oveq1d 7466	. . . . . . . 8 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (((𝑗 + 1) − 𝑗) / (𝑗 · (𝑗 + 1))) = (1 / (𝑗 · (𝑗 + 1))))
37	26	mulridd 11365	. . . . . . . . . . 11 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → ((𝑗 + 1) · 1) = (𝑗 + 1))
38	26, 24	mulcomd 11369	. . . . . . . . . . 11 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → ((𝑗 + 1) · 𝑗) = (𝑗 · (𝑗 + 1)))
39	37, 38	oveq12d 7469	. . . . . . . . . 10 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (((𝑗 + 1) · 1) / ((𝑗 + 1) · 𝑗)) = ((𝑗 + 1) / (𝑗 · (𝑗 + 1))))
40		1cnd 11341	. . . . . . . . . . 11 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → 1 ∈ ℂ)
41	23	nnne0d 12428	. . . . . . . . . . 11 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → 𝑗 ≠ 0)
42	28	nnne0d 12428	. . . . . . . . . . 11 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (𝑗 + 1) ≠ 0)
43	40, 24, 26, 41, 42	divcan5d 12159	. . . . . . . . . 10 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (((𝑗 + 1) · 1) / ((𝑗 + 1) · 𝑗)) = (1 / 𝑗))
44	39, 43	eqtr3d 2800	. . . . . . . . 9 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → ((𝑗 + 1) / (𝑗 · (𝑗 + 1))) = (1 / 𝑗))
45	24	mulridd 11365	. . . . . . . . . . 11 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (𝑗 · 1) = 𝑗)
46	45	oveq1d 7466	. . . . . . . . . 10 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → ((𝑗 · 1) / (𝑗 · (𝑗 + 1))) = (𝑗 / (𝑗 · (𝑗 + 1))))
47	40, 26, 24, 42, 41	divcan5d 12159	. . . . . . . . . 10 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → ((𝑗 · 1) / (𝑗 · (𝑗 + 1))) = (1 / (𝑗 + 1)))
48	46, 47	eqtr3d 2800	. . . . . . . . 9 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (𝑗 / (𝑗 · (𝑗 + 1))) = (1 / (𝑗 + 1)))
49	44, 48	oveq12d 7469	. . . . . . . 8 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (((𝑗 + 1) / (𝑗 · (𝑗 + 1))) − (𝑗 / (𝑗 · (𝑗 + 1)))) = ((1 / 𝑗) − (1 / (𝑗 + 1))))
50	32, 36, 49	3eqtr3d 2806	. . . . . . 7 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (1 / (𝑗 · (𝑗 + 1))) = ((1 / 𝑗) − (1 / (𝑗 + 1))))
51	50	sumeq2dv 15913	. . . . . 6 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → Σ𝑗 ∈ (1...𝑘)(1 / (𝑗 · (𝑗 + 1))) = Σ𝑗 ∈ (1...𝑘)((1 / 𝑗) − (1 / (𝑗 + 1))))
52		oveq2 7459	. . . . . . 7 ⊢ (𝑛 = 𝑗 → (1 / 𝑛) = (1 / 𝑗))
53		oveq2 7459	. . . . . . 7 ⊢ (𝑛 = (𝑗 + 1) → (1 / 𝑛) = (1 / (𝑗 + 1)))
54		oveq2 7459	. . . . . . . 8 ⊢ (𝑛 = 1 → (1 / 𝑛) = (1 / 1))
55		1div1e1 12047	. . . . . . . 8 ⊢ (1 / 1) = 1
56	54, 55	eqtrdi 2814	. . . . . . 7 ⊢ (𝑛 = 1 → (1 / 𝑛) = 1)
57		oveq2 7459	. . . . . . 7 ⊢ (𝑛 = (𝑘 + 1) → (1 / 𝑛) = (1 / (𝑘 + 1)))
58		nnz 12754	. . . . . . . 8 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℤ)
59	58	adantl 487	. . . . . . 7 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℤ)
60	17, 1	eleqtrdi 2874	. . . . . . 7 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (𝑘 + 1) ∈ (ℤ≥‘1))
61		elfznn 13727	. . . . . . . . . 10 ⊢ (𝑛 ∈ (1...(𝑘 + 1)) → 𝑛 ∈ ℕ)
62	61	adantl 487	. . . . . . . . 9 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...(𝑘 + 1))) → 𝑛 ∈ ℕ)
63	62	nnrecred 12429	. . . . . . . 8 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...(𝑘 + 1))) → (1 / 𝑛) ∈ ℝ)
64	63	recnd 11376	. . . . . . 7 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ (1...(𝑘 + 1))) → (1 / 𝑛) ∈ ℂ)
65	52, 53, 56, 57, 59, 60, 64	telfsum 16015	. . . . . 6 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → Σ𝑗 ∈ (1...𝑘)((1 / 𝑗) − (1 / (𝑗 + 1))) = (1 − (1 / (𝑘 + 1))))
66	51, 65	eqtrd 2798	. . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → Σ𝑗 ∈ (1...𝑘)(1 / (𝑗 · (𝑗 + 1))) = (1 − (1 / (𝑘 + 1))))
67		id 23	. . . . . . . . . 10 ⊢ (𝑛 = 𝑗 → 𝑛 = 𝑗)
68		oveq1 7458	. . . . . . . . . 10 ⊢ (𝑛 = 𝑗 → (𝑛 + 1) = (𝑗 + 1))
69	67, 68	oveq12d 7469	. . . . . . . . 9 ⊢ (𝑛 = 𝑗 → (𝑛 · (𝑛 + 1)) = (𝑗 · (𝑗 + 1)))
70	69	oveq2d 7467	. . . . . . . 8 ⊢ (𝑛 = 𝑗 → (1 / (𝑛 · (𝑛 + 1))) = (1 / (𝑗 · (𝑗 + 1))))
71		trireciplem.1	. . . . . . . 8 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ (1 / (𝑛 · (𝑛 + 1))))
72		ovex 7484	. . . . . . . 8 ⊢ (1 / (𝑗 · (𝑗 + 1))) ∈ V
73	70, 71, 72	fvmpt 7024	. . . . . . 7 ⊢ (𝑗 ∈ ℕ → (𝐹‘𝑗) = (1 / (𝑗 · (𝑗 + 1))))
74	23, 73	syl 18	. . . . . 6 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (𝐹‘𝑗) = (1 / (𝑗 · (𝑗 + 1))))
75		simpr 490	. . . . . . 7 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℕ)
76	75, 1	eleqtrdi 2874	. . . . . 6 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ (ℤ≥‘1))
77	29	nnrecred 12429	. . . . . . 7 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (1 / (𝑗 · (𝑗 + 1))) ∈ ℝ)
78	77	recnd 11376	. . . . . 6 ⊢ (((⊤ ∧ 𝑘 ∈ ℕ) ∧ 𝑗 ∈ (1...𝑘)) → (1 / (𝑗 · (𝑗 + 1))) ∈ ℂ)
79	74, 76, 78	fsumser 15940	. . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → Σ𝑗 ∈ (1...𝑘)(1 / (𝑗 · (𝑗 + 1))) = (seq1( + , 𝐹)‘𝑘))
80	21, 66, 79	3eqtr2rd 2805	. . . 4 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (seq1( + , 𝐹)‘𝑘) = (1 − ((𝑛 ∈ ℕ ↦ (1 / (𝑛 + 1)))‘𝑘)))
81	1, 2, 13, 3, 15, 20, 80	climsubc2 15850	. . 3 ⊢ (⊤ → seq1( + , 𝐹) ⇝ (1 − 0))
82	81	mptru 1577	. 2 ⊢ seq1( + , 𝐹) ⇝ (1 − 0)
83		1m0e1 12502	. 2 ⊢ (1 − 0) = 1
84	82, 83	breqtri 5136	1 ⊢ seq1( + , 𝐹) ⇝ 1

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  ⊤wtru 1571   ∈ wcel 2147  Vcvv 3454   class class class wbr 5108   ↦ cmpt 5192  ‘cfv 6566  (class class class)co 7451  ℂcc 11237  0cc0 11239  1c1 11240   + caddc 11242   · cmul 11244   − cmin 11580   / cdiv 12013  ℕcn 12375  ℤcz 12733  ℤ_≥cuz 13005  ...cfz 13679  seqcseq 14184   ⇝ cli 15695  Σcsu 15897

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-inf2 9679  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316  ax-pre-sup 11317

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-isom 6575  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-er 8755  df-pm 8888  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-sup 9471  df-inf 9472  df-oi 9541  df-card 10057  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-div 12014  df-nn 12376  df-2 12445  df-3 12446  df-n0 12647  df-z 12734  df-uz 13006  df-rp 13161  df-fz 13680  df-fzo 13829  df-fl 13972  df-seq 14185  df-exp 14245  df-hash 14516  df-shft 15263  df-cj 15309  df-re 15310  df-im 15311  df-sqrt 15445  df-abs 15446  df-clim 15699  df-rlim 15700  df-sum 15898

This theorem is used by:  trirecip  16076  stirlinglem12  47368