resqrexlemcvg - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > resqrexlemcvg		GIF version

Theorem resqrexlemcvg 11525

Description: Lemma for resqrex 11532. The sequence has a limit. (Contributed by Jim Kingdon, 6-Aug-2021.)

**Hypotheses**
Ref	Expression
resqrexlemex.seq	⊢ 𝐹 = seq1((𝑦 ∈ ℝ⁺, 𝑧 ∈ ℝ⁺ ↦ ((𝑦 + (𝐴 / 𝑦)) / 2)), (ℕ × {(1 + 𝐴)}))
resqrexlemex.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
resqrexlemex.agt0	⊢ (𝜑 → 0 ≤ 𝐴)

**Assertion**
Ref	Expression
resqrexlemcvg	⊢ (𝜑 → ∃𝑟 ∈ ℝ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑖 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑖) < (𝑟 + 𝑥) ∧ 𝑟 < ((𝐹‘𝑖) + 𝑥)))

Distinct variable groups: 𝑦,𝐴,𝑧 𝑖,𝐹,𝑗,𝑟,𝑥 𝜑,𝑖,𝑗,𝑟 𝜑,𝑦,𝑧 𝜑,𝑥 Allowed substitution hints: 𝐴(𝑥,𝑖,𝑗,𝑟) 𝐹(𝑦,𝑧)

Proof of Theorem resqrexlemcvg Dummy variables 𝑘 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		resqrexlemex.seq	. . . 4 ⊢ 𝐹 = seq1((𝑦 ∈ ℝ⁺, 𝑧 ∈ ℝ⁺ ↦ ((𝑦 + (𝐴 / 𝑦)) / 2)), (ℕ × {(1 + 𝐴)}))
2		resqrexlemex.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ)
3		resqrexlemex.agt0	. . . 4 ⊢ (𝜑 → 0 ≤ 𝐴)
4	1, 2, 3	resqrexlemf 11513	. . 3 ⊢ (𝜑 → 𝐹:ℕ⟶ℝ⁺)
5		rpssre 9856	. . . 4 ⊢ ℝ⁺ ⊆ ℝ
6	5	a1i 9	. . 3 ⊢ (𝜑 → ℝ⁺ ⊆ ℝ)
7	4, 6	fssd 5485	. 2 ⊢ (𝜑 → 𝐹:ℕ⟶ℝ)
8		1nn 9117	. . . . . . 7 ⊢ 1 ∈ ℕ
9	8	a1i 9	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℕ)
10	4, 9	ffvelcdmd 5770	. . . . 5 ⊢ (𝜑 → (𝐹‘1) ∈ ℝ⁺)
11		2z 9470	. . . . . 6 ⊢ 2 ∈ ℤ
12	11	a1i 9	. . . . 5 ⊢ (𝜑 → 2 ∈ ℤ)
13	10, 12	rpexpcld 10914	. . . 4 ⊢ (𝜑 → ((𝐹‘1)↑2) ∈ ℝ⁺)
14		2rp 9850	. . . . 5 ⊢ 2 ∈ ℝ⁺
15	14	a1i 9	. . . 4 ⊢ (𝜑 → 2 ∈ ℝ⁺)
16	13, 15	rpmulcld 9905	. . 3 ⊢ (𝜑 → (((𝐹‘1)↑2) · 2) ∈ ℝ⁺)
17	16, 15	rpmulcld 9905	. 2 ⊢ (𝜑 → ((((𝐹‘1)↑2) · 2) · 2) ∈ ℝ⁺)
18	4	ad2antrr 488	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 𝐹:ℕ⟶ℝ⁺)
19		simplr 528	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 𝑛 ∈ ℕ)
20	18, 19	ffvelcdmd 5770	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (𝐹‘𝑛) ∈ ℝ⁺)
21	20	rpred 9888	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (𝐹‘𝑛) ∈ ℝ)
22		eluznn 9791	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 𝑘 ∈ ℕ)
23	22	adantll 476	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 𝑘 ∈ ℕ)
24	18, 23	ffvelcdmd 5770	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (𝐹‘𝑘) ∈ ℝ⁺)
25	24	rpred 9888	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (𝐹‘𝑘) ∈ ℝ)
26	21, 25	resubcld 8523	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘𝑛) − (𝐹‘𝑘)) ∈ ℝ)
27	17	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → ((((𝐹‘1)↑2) · 2) · 2) ∈ ℝ⁺)
28	14	a1i 9	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 2 ∈ ℝ⁺)
29	19	nnzd 9564	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 𝑛 ∈ ℤ)
30	28, 29	rpexpcld 10914	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (2↑𝑛) ∈ ℝ⁺)
31	27, 30	rpdivcld 9906	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (((((𝐹‘1)↑2) · 2) · 2) / (2↑𝑛)) ∈ ℝ⁺)
32	31	rpred 9888	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (((((𝐹‘1)↑2) · 2) · 2) / (2↑𝑛)) ∈ ℝ)
33	19	nnrpd 9886	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 𝑛 ∈ ℝ⁺)
34	27, 33	rpdivcld 9906	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (((((𝐹‘1)↑2) · 2) · 2) / 𝑛) ∈ ℝ⁺)
35	34	rpred 9888	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (((((𝐹‘1)↑2) · 2) · 2) / 𝑛) ∈ ℝ)
36	2	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 𝐴 ∈ ℝ)
37	3	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 0 ≤ 𝐴)
38		eluzle 9730	. . . . . . . . . 10 ⊢ (𝑘 ∈ (ℤ_≥‘𝑛) → 𝑛 ≤ 𝑘)
39	38	adantl 277	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 𝑛 ≤ 𝑘)
40	1, 36, 37, 19, 23, 39	resqrexlemnm 11524	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘𝑛) − (𝐹‘𝑘)) < ((((𝐹‘1)↑2) · 2) / (2↑(𝑛 − 1))))
41		2cn 9177	. . . . . . . . . . 11 ⊢ 2 ∈ ℂ
42		expm1t 10784	. . . . . . . . . . 11 ⊢ ((2 ∈ ℂ ∧ 𝑛 ∈ ℕ) → (2↑𝑛) = ((2↑(𝑛 − 1)) · 2))
43	41, 19, 42	sylancr 414	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (2↑𝑛) = ((2↑(𝑛 − 1)) · 2))
44	43	oveq2d 6016	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (((((𝐹‘1)↑2) · 2) · 2) / (2↑𝑛)) = (((((𝐹‘1)↑2) · 2) · 2) / ((2↑(𝑛 − 1)) · 2)))
45	8	a1i 9	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 1 ∈ ℕ)
46	18, 45	ffvelcdmd 5770	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (𝐹‘1) ∈ ℝ⁺)
47	11	a1i 9	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 2 ∈ ℤ)
48	46, 47	rpexpcld 10914	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘1)↑2) ∈ ℝ⁺)
49	48, 28	rpmulcld 9905	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (((𝐹‘1)↑2) · 2) ∈ ℝ⁺)
50	49	rpcnd 9890	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (((𝐹‘1)↑2) · 2) ∈ ℂ)
51	41	a1i 9	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 2 ∈ ℂ)
52		nnm1nn0 9406	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℕ₀)
53	19, 52	syl 14	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (𝑛 − 1) ∈ ℕ₀)
54	51, 53	expcld 10890	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (2↑(𝑛 − 1)) ∈ ℂ)
55		2ap0 9199	. . . . . . . . . . . 12 ⊢ 2 # 0
56	55	a1i 9	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 2 # 0)
57		1zzd 9469	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 1 ∈ ℤ)
58	29, 57	zsubcld 9570	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (𝑛 − 1) ∈ ℤ)
59	51, 56, 58	expap0d 10896	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (2↑(𝑛 − 1)) # 0)
60	50, 54, 51, 59, 56	divcanap5rd 8961	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (((((𝐹‘1)↑2) · 2) · 2) / ((2↑(𝑛 − 1)) · 2)) = ((((𝐹‘1)↑2) · 2) / (2↑(𝑛 − 1))))
61	44, 60	eqtrd 2262	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (((((𝐹‘1)↑2) · 2) · 2) / (2↑𝑛)) = ((((𝐹‘1)↑2) · 2) / (2↑(𝑛 − 1))))
62	40, 61	breqtrrd 4110	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘𝑛) − (𝐹‘𝑘)) < (((((𝐹‘1)↑2) · 2) · 2) / (2↑𝑛)))
63		uzid 9732	. . . . . . . . . 10 ⊢ (2 ∈ ℤ → 2 ∈ (ℤ_≥‘2))
64	11, 63	ax-mp 5	. . . . . . . . 9 ⊢ 2 ∈ (ℤ_≥‘2)
65	19	nnnn0d 9418	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 𝑛 ∈ ℕ₀)
66		bernneq3 10879	. . . . . . . . 9 ⊢ ((2 ∈ (ℤ_≥‘2) ∧ 𝑛 ∈ ℕ₀) → 𝑛 < (2↑𝑛))
67	64, 65, 66	sylancr 414	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 𝑛 < (2↑𝑛))
68	33, 30, 27	ltdiv2d 9912	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (𝑛 < (2↑𝑛) ↔ (((((𝐹‘1)↑2) · 2) · 2) / (2↑𝑛)) < (((((𝐹‘1)↑2) · 2) · 2) / 𝑛)))
69	67, 68	mpbid 147	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (((((𝐹‘1)↑2) · 2) · 2) / (2↑𝑛)) < (((((𝐹‘1)↑2) · 2) · 2) / 𝑛))
70	26, 32, 35, 62, 69	lttrd 8268	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘𝑛) − (𝐹‘𝑘)) < (((((𝐹‘1)↑2) · 2) · 2) / 𝑛))
71	21, 25, 35	ltsubadd2d 8686	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (((𝐹‘𝑛) − (𝐹‘𝑘)) < (((((𝐹‘1)↑2) · 2) · 2) / 𝑛) ↔ (𝐹‘𝑛) < ((𝐹‘𝑘) + (((((𝐹‘1)↑2) · 2) · 2) / 𝑛))))
72	70, 71	mpbid 147	. . . . 5 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (𝐹‘𝑛) < ((𝐹‘𝑘) + (((((𝐹‘1)↑2) · 2) · 2) / 𝑛)))
73	21, 35	readdcld 8172	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘𝑛) + (((((𝐹‘1)↑2) · 2) · 2) / 𝑛)) ∈ ℝ)
74	25	adantr 276	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) ∧ 𝑛 < 𝑘) → (𝐹‘𝑘) ∈ ℝ)
75	21	adantr 276	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) ∧ 𝑛 < 𝑘) → (𝐹‘𝑛) ∈ ℝ)
76	36	adantr 276	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) ∧ 𝑛 < 𝑘) → 𝐴 ∈ ℝ)
77	37	adantr 276	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) ∧ 𝑛 < 𝑘) → 0 ≤ 𝐴)
78	19	adantr 276	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) ∧ 𝑛 < 𝑘) → 𝑛 ∈ ℕ)
79	23	adantr 276	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) ∧ 𝑛 < 𝑘) → 𝑘 ∈ ℕ)
80		simpr 110	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) ∧ 𝑛 < 𝑘) → 𝑛 < 𝑘)
81	1, 76, 77, 78, 79, 80	resqrexlemdecn 11518	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) ∧ 𝑛 < 𝑘) → (𝐹‘𝑘) < (𝐹‘𝑛))
82	74, 75, 81	ltled 8261	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) ∧ 𝑛 < 𝑘) → (𝐹‘𝑘) ≤ (𝐹‘𝑛))
83		fveq2 5626	. . . . . . . . 9 ⊢ (𝑛 = 𝑘 → (𝐹‘𝑛) = (𝐹‘𝑘))
84	83	eqcomd 2235	. . . . . . . 8 ⊢ (𝑛 = 𝑘 → (𝐹‘𝑘) = (𝐹‘𝑛))
85		eqle 8234	. . . . . . . 8 ⊢ (((𝐹‘𝑘) ∈ ℝ ∧ (𝐹‘𝑘) = (𝐹‘𝑛)) → (𝐹‘𝑘) ≤ (𝐹‘𝑛))
86	25, 84, 85	syl2an 289	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) ∧ 𝑛 = 𝑘) → (𝐹‘𝑘) ≤ (𝐹‘𝑛))
87	23	nnzd 9564	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 𝑘 ∈ ℤ)
88		zleloe 9489	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℤ ∧ 𝑘 ∈ ℤ) → (𝑛 ≤ 𝑘 ↔ (𝑛 < 𝑘 ∨ 𝑛 = 𝑘)))
89	29, 87, 88	syl2anc 411	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (𝑛 ≤ 𝑘 ↔ (𝑛 < 𝑘 ∨ 𝑛 = 𝑘)))
90	39, 89	mpbid 147	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (𝑛 < 𝑘 ∨ 𝑛 = 𝑘))
91	82, 86, 90	mpjaodan 803	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (𝐹‘𝑘) ≤ (𝐹‘𝑛))
92	21, 34	ltaddrpd 9922	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (𝐹‘𝑛) < ((𝐹‘𝑛) + (((((𝐹‘1)↑2) · 2) · 2) / 𝑛)))
93	25, 21, 73, 91, 92	lelttrd 8267	. . . . 5 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → (𝐹‘𝑘) < ((𝐹‘𝑛) + (((((𝐹‘1)↑2) · 2) · 2) / 𝑛)))
94	72, 93	jca 306	. . . 4 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘𝑛) < ((𝐹‘𝑘) + (((((𝐹‘1)↑2) · 2) · 2) / 𝑛)) ∧ (𝐹‘𝑘) < ((𝐹‘𝑛) + (((((𝐹‘1)↑2) · 2) · 2) / 𝑛))))
95	94	ralrimiva 2603	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∀𝑘 ∈ (ℤ_≥‘𝑛)((𝐹‘𝑛) < ((𝐹‘𝑘) + (((((𝐹‘1)↑2) · 2) · 2) / 𝑛)) ∧ (𝐹‘𝑘) < ((𝐹‘𝑛) + (((((𝐹‘1)↑2) · 2) · 2) / 𝑛))))
96	95	ralrimiva 2603	. 2 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑛)((𝐹‘𝑛) < ((𝐹‘𝑘) + (((((𝐹‘1)↑2) · 2) · 2) / 𝑛)) ∧ (𝐹‘𝑘) < ((𝐹‘𝑛) + (((((𝐹‘1)↑2) · 2) · 2) / 𝑛))))
97	7, 17, 96	cvg1n 11492	1 ⊢ (𝜑 → ∃𝑟 ∈ ℝ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑖 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑖) < (𝑟 + 𝑥) ∧ 𝑟 < ((𝐹‘𝑖) + 𝑥)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 713 = wceq 1395 ∈ wcel 2200 ∀wral 2508 ∃wrex 2509 ⊆ wss 3197 {csn 3666 class class class wbr 4082 × cxp 4716 ⟶wf 5313 ‘cfv 5317 (class class class)co 6000 ∈ cmpo 6002 ℂcc 7993 ℝcr 7994 0cc0 7995 1c1 7996 + caddc 7998 · cmul 8000 < clt 8177 ≤ cle 8178 − cmin 8313 # cap 8724 / cdiv 8815 ℕcn 9106 2c2 9157 ℕ₀cn0 9365 ℤcz 9442 ℤ_≥cuz 9718 ℝ⁺crp 9845 seqcseq 10664 ↑cexp 10755

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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4198 ax-sep 4201 ax-nul 4209 ax-pow 4257 ax-pr 4292 ax-un 4523 ax-setind 4628 ax-iinf 4679 ax-cnex 8086 ax-resscn 8087 ax-1cn 8088 ax-1re 8089 ax-icn 8090 ax-addcl 8091 ax-addrcl 8092 ax-mulcl 8093 ax-mulrcl 8094 ax-addcom 8095 ax-mulcom 8096 ax-addass 8097 ax-mulass 8098 ax-distr 8099 ax-i2m1 8100 ax-0lt1 8101 ax-1rid 8102 ax-0id 8103 ax-rnegex 8104 ax-precex 8105 ax-cnre 8106 ax-pre-ltirr 8107 ax-pre-ltwlin 8108 ax-pre-lttrn 8109 ax-pre-apti 8110 ax-pre-ltadd 8111 ax-pre-mulgt0 8112 ax-pre-mulext 8113 ax-arch 8114 ax-caucvg 8115

This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-int 3923 df-iun 3966 df-br 4083 df-opab 4145 df-mpt 4146 df-tr 4182 df-id 4383 df-po 4386 df-iso 4387 df-iord 4456 df-on 4458 df-ilim 4459 df-suc 4461 df-iom 4682 df-xp 4724 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-rn 4729 df-res 4730 df-ima 4731 df-iota 5277 df-fun 5319 df-fn 5320 df-f 5321 df-f1 5322 df-fo 5323 df-f1o 5324 df-fv 5325 df-riota 5953 df-ov 6003 df-oprab 6004 df-mpo 6005 df-1st 6284 df-2nd 6285 df-recs 6449 df-frec 6535 df-pnf 8179 df-mnf 8180 df-xr 8181 df-ltxr 8182 df-le 8183 df-sub 8315 df-neg 8316 df-reap 8718 df-ap 8725 df-div 8816 df-inn 9107 df-2 9165 df-3 9166 df-4 9167 df-n0 9366 df-z 9443 df-uz 9719 df-rp 9846 df-seqfrec 10665 df-exp 10756

This theorem is referenced by: resqrexlemex 11531

W3C validator