caucvgrlem - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > caucvgrlem		Structured version Visualization version GIF version

Theorem caucvgrlem 15633

Description: Lemma for caurcvgr 15634. (Contributed by Mario Carneiro, 15-Feb-2014.) (Revised by AV, 12-Sep-2020.)

**Hypotheses**
Ref	Expression
caurcvgr.1	⊢ (𝜑 → 𝐴 ⊆ ℝ)
caurcvgr.2	⊢ (𝜑 → 𝐹:𝐴⟶ℝ)
caurcvgr.3	⊢ (𝜑 → sup(𝐴, ℝ^*, < ) = +∞)
caurcvgr.4	⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝐴 ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥))
caucvgrlem.4	⊢ (𝜑 → 𝑅 ∈ ℝ⁺)

**Assertion**
Ref	Expression
caucvgrlem	⊢ (𝜑 → ∃𝑗 ∈ 𝐴 ((lim sup‘𝐹) ∈ ℝ ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < (3 · 𝑅))))

Distinct variable groups: 𝑗,𝑘,𝑥,𝐴 𝑗,𝐹,𝑘,𝑥 𝜑,𝑗,𝑘,𝑥 𝑅,𝑗,𝑘,𝑥

Proof of Theorem caucvgrlem Dummy variables 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		caurcvgr.2	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ)
2		caurcvgr.1	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
3		reex 11127	. . . . . . . . 9 ⊢ ℝ ∈ V
4	3	ssex 5256	. . . . . . . 8 ⊢ (𝐴 ⊆ ℝ → 𝐴 ∈ V)
5	2, 4	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ V)
6	3	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℝ ∈ V)
7		fex2 7883	. . . . . . 7 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ∈ V ∧ ℝ ∈ V) → 𝐹 ∈ V)
8	1, 5, 6, 7	syl3anc 1379	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ V)
9		limsupcl 15433	. . . . . 6 ⊢ (𝐹 ∈ V → (lim sup‘𝐹) ∈ ℝ^*)
10	8, 9	syl 17	. . . . 5 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ^*)
11	10	adantr 481	. . . 4 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → (lim sup‘𝐹) ∈ ℝ^*)
12	1	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → 𝐹:𝐴⟶ℝ)
13		simprl 776	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → 𝑗 ∈ 𝐴)
14	12, 13	ffvelcdmd 7033	. . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → (𝐹‘𝑗) ∈ ℝ)
15		caucvgrlem.4	. . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ ℝ⁺)
16	15	rpred 12984	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ ℝ)
17	16	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → 𝑅 ∈ ℝ)
18	14, 17	readdcld 11172	. . . 4 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → ((𝐹‘𝑗) + 𝑅) ∈ ℝ)
19		mnfxr 11200	. . . . . 6 ⊢ -∞ ∈ ℝ^*
20	19	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → -∞ ∈ ℝ^*)
21	14, 17	resubcld 11576	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → ((𝐹‘𝑗) − 𝑅) ∈ ℝ)
22	21	rexrd 11193	. . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → ((𝐹‘𝑗) − 𝑅) ∈ ℝ^*)
23	21	mnfltd 13073	. . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → -∞ < ((𝐹‘𝑗) − 𝑅))
24	2	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → 𝐴 ⊆ ℝ)
25		ressxr 11187	. . . . . . . 8 ⊢ ℝ ⊆ ℝ^*
26		fss 6678	. . . . . . . 8 ⊢ ((𝐹:𝐴⟶ℝ ∧ ℝ ⊆ ℝ^) → 𝐹:𝐴⟶ℝ^)
27	1, 25, 26	sylancl 592	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ^*)
28	27	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → 𝐹:𝐴⟶ℝ^*)
29		caurcvgr.3	. . . . . . 7 ⊢ (𝜑 → sup(𝐴, ℝ^*, < ) = +∞)
30	29	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → sup(𝐴, ℝ^*, < ) = +∞)
31	24, 13	sseldd 3923	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → 𝑗 ∈ ℝ)
32		simprr 778	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))
33		breq2 5083	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑚 → (𝑗 ≤ 𝑘 ↔ 𝑗 ≤ 𝑚))
34	33	imbrov2fvoveq 7388	. . . . . . . . . 10 ⊢ (𝑘 = 𝑚 → ((𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅) ↔ (𝑗 ≤ 𝑚 → (abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) < 𝑅)))
35	34	cbvralvw 3218	. . . . . . . . 9 ⊢ (∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅) ↔ ∀𝑚 ∈ 𝐴 (𝑗 ≤ 𝑚 → (abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) < 𝑅))
36	32, 35	sylib 219	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → ∀𝑚 ∈ 𝐴 (𝑗 ≤ 𝑚 → (abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) < 𝑅))
37	12	ffvelcdmda 7032	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ 𝑚 ∈ 𝐴) → (𝐹‘𝑚) ∈ ℝ)
38	14	adantr 481	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ 𝑚 ∈ 𝐴) → (𝐹‘𝑗) ∈ ℝ)
39	37, 38	resubcld 11576	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ 𝑚 ∈ 𝐴) → ((𝐹‘𝑚) − (𝐹‘𝑗)) ∈ ℝ)
40	39	recnd 11171	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ 𝑚 ∈ 𝐴) → ((𝐹‘𝑚) − (𝐹‘𝑗)) ∈ ℂ)
41	40	abscld 15399	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ 𝑚 ∈ 𝐴) → (abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) ∈ ℝ)
42	17	adantr 481	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ 𝑚 ∈ 𝐴) → 𝑅 ∈ ℝ)
43		ltle 11232	. . . . . . . . . . . . 13 ⊢ (((abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) ∈ ℝ ∧ 𝑅 ∈ ℝ) → ((abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) < 𝑅 → (abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) ≤ 𝑅))
44	41, 42, 43	syl2anc 590	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ 𝑚 ∈ 𝐴) → ((abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) < 𝑅 → (abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) ≤ 𝑅))
45	37, 38, 42	absdifled 15397	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ 𝑚 ∈ 𝐴) → ((abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) ≤ 𝑅 ↔ (((𝐹‘𝑗) − 𝑅) ≤ (𝐹‘𝑚) ∧ (𝐹‘𝑚) ≤ ((𝐹‘𝑗) + 𝑅))))
46	44, 45	sylibd 240	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ 𝑚 ∈ 𝐴) → ((abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) < 𝑅 → (((𝐹‘𝑗) − 𝑅) ≤ (𝐹‘𝑚) ∧ (𝐹‘𝑚) ≤ ((𝐹‘𝑗) + 𝑅))))
47		simpl 483	. . . . . . . . . . 11 ⊢ ((((𝐹‘𝑗) − 𝑅) ≤ (𝐹‘𝑚) ∧ (𝐹‘𝑚) ≤ ((𝐹‘𝑗) + 𝑅)) → ((𝐹‘𝑗) − 𝑅) ≤ (𝐹‘𝑚))
48	46, 47	syl6 35	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ 𝑚 ∈ 𝐴) → ((abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) < 𝑅 → ((𝐹‘𝑗) − 𝑅) ≤ (𝐹‘𝑚)))
49	48	imim2d 57	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ 𝑚 ∈ 𝐴) → ((𝑗 ≤ 𝑚 → (abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) < 𝑅) → (𝑗 ≤ 𝑚 → ((𝐹‘𝑗) − 𝑅) ≤ (𝐹‘𝑚))))
50	49	ralimdva 3152	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → (∀𝑚 ∈ 𝐴 (𝑗 ≤ 𝑚 → (abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) < 𝑅) → ∀𝑚 ∈ 𝐴 (𝑗 ≤ 𝑚 → ((𝐹‘𝑗) − 𝑅) ≤ (𝐹‘𝑚))))
51	36, 50	mpd 15	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → ∀𝑚 ∈ 𝐴 (𝑗 ≤ 𝑚 → ((𝐹‘𝑗) − 𝑅) ≤ (𝐹‘𝑚)))
52		breq1 5082	. . . . . . . 8 ⊢ (𝑛 = 𝑗 → (𝑛 ≤ 𝑚 ↔ 𝑗 ≤ 𝑚))
53	52	rspceaimv 3573	. . . . . . 7 ⊢ ((𝑗 ∈ ℝ ∧ ∀𝑚 ∈ 𝐴 (𝑗 ≤ 𝑚 → ((𝐹‘𝑗) − 𝑅) ≤ (𝐹‘𝑚))) → ∃𝑛 ∈ ℝ ∀𝑚 ∈ 𝐴 (𝑛 ≤ 𝑚 → ((𝐹‘𝑗) − 𝑅) ≤ (𝐹‘𝑚)))
54	31, 51, 53	syl2anc 590	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → ∃𝑛 ∈ ℝ ∀𝑚 ∈ 𝐴 (𝑛 ≤ 𝑚 → ((𝐹‘𝑗) − 𝑅) ≤ (𝐹‘𝑚)))
55	24, 28, 22, 30, 54	limsupbnd2 15443	. . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → ((𝐹‘𝑗) − 𝑅) ≤ (lim sup‘𝐹))
56	20, 22, 11, 23, 55	xrltletrd 13110	. . . 4 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → -∞ < (lim sup‘𝐹))
57	18	rexrd 11193	. . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → ((𝐹‘𝑗) + 𝑅) ∈ ℝ^*)
58	41	adantrr 723	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) ∈ ℝ)
59	17	adantr 481	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → 𝑅 ∈ ℝ)
60		simprr 778	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → 𝑗 ≤ 𝑚)
61		simplrr 783	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))
62		simprl 776	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → 𝑚 ∈ 𝐴)
63	34, 61, 62	rspcdva 3568	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (𝑗 ≤ 𝑚 → (abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) < 𝑅))
64	60, 63	mpd 15	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) < 𝑅)
65	58, 59, 64	ltled 11292	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) ≤ 𝑅)
66	37	adantrr 723	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (𝐹‘𝑚) ∈ ℝ)
67	14	adantr 481	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (𝐹‘𝑗) ∈ ℝ)
68	66, 67, 59	absdifled 15397	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) ≤ 𝑅 ↔ (((𝐹‘𝑗) − 𝑅) ≤ (𝐹‘𝑚) ∧ (𝐹‘𝑚) ≤ ((𝐹‘𝑗) + 𝑅))))
69	65, 68	mpbid 233	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (((𝐹‘𝑗) − 𝑅) ≤ (𝐹‘𝑚) ∧ (𝐹‘𝑚) ≤ ((𝐹‘𝑗) + 𝑅)))
70	69	simprd 496	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (𝐹‘𝑚) ≤ ((𝐹‘𝑗) + 𝑅))
71	70	expr 457	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ 𝑚 ∈ 𝐴) → (𝑗 ≤ 𝑚 → (𝐹‘𝑚) ≤ ((𝐹‘𝑗) + 𝑅)))
72	71	ralrimiva 3132	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → ∀𝑚 ∈ 𝐴 (𝑗 ≤ 𝑚 → (𝐹‘𝑚) ≤ ((𝐹‘𝑗) + 𝑅)))
73	52	rspceaimv 3573	. . . . . 6 ⊢ ((𝑗 ∈ ℝ ∧ ∀𝑚 ∈ 𝐴 (𝑗 ≤ 𝑚 → (𝐹‘𝑚) ≤ ((𝐹‘𝑗) + 𝑅))) → ∃𝑛 ∈ ℝ ∀𝑚 ∈ 𝐴 (𝑛 ≤ 𝑚 → (𝐹‘𝑚) ≤ ((𝐹‘𝑗) + 𝑅)))
74	31, 72, 73	syl2anc 590	. . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → ∃𝑛 ∈ ℝ ∀𝑚 ∈ 𝐴 (𝑛 ≤ 𝑚 → (𝐹‘𝑚) ≤ ((𝐹‘𝑗) + 𝑅)))
75	24, 28, 57, 74	limsupbnd1 15442	. . . 4 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → (lim sup‘𝐹) ≤ ((𝐹‘𝑗) + 𝑅))
76		xrre 13119	. . . 4 ⊢ ((((lim sup‘𝐹) ∈ ℝ^* ∧ ((𝐹‘𝑗) + 𝑅) ∈ ℝ) ∧ (-∞ < (lim sup‘𝐹) ∧ (lim sup‘𝐹) ≤ ((𝐹‘𝑗) + 𝑅))) → (lim sup‘𝐹) ∈ ℝ)
77	11, 18, 56, 75, 76	syl22anc 844	. . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → (lim sup‘𝐹) ∈ ℝ)
78	77	adantr 481	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (lim sup‘𝐹) ∈ ℝ)
79	66, 78	resubcld 11576	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑚) − (lim sup‘𝐹)) ∈ ℝ)
80	79	recnd 11171	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑚) − (lim sup‘𝐹)) ∈ ℂ)
81	80	abscld 15399	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (abs‘((𝐹‘𝑚) − (lim sup‘𝐹))) ∈ ℝ)
82		2re 12253	. . . . . . . 8 ⊢ 2 ∈ ℝ
83		remulcl 11121	. . . . . . . 8 ⊢ ((2 ∈ ℝ ∧ 𝑅 ∈ ℝ) → (2 · 𝑅) ∈ ℝ)
84	82, 59, 83	sylancr 593	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (2 · 𝑅) ∈ ℝ)
85		3re 12259	. . . . . . . 8 ⊢ 3 ∈ ℝ
86		remulcl 11121	. . . . . . . 8 ⊢ ((3 ∈ ℝ ∧ 𝑅 ∈ ℝ) → (3 · 𝑅) ∈ ℝ)
87	85, 59, 86	sylancr 593	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (3 · 𝑅) ∈ ℝ)
88	66	recnd 11171	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (𝐹‘𝑚) ∈ ℂ)
89	78	recnd 11171	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (lim sup‘𝐹) ∈ ℂ)
90	88, 89	abssubd 15416	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (abs‘((𝐹‘𝑚) − (lim sup‘𝐹))) = (abs‘((lim sup‘𝐹) − (𝐹‘𝑚))))
91	66, 84	resubcld 11576	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑚) − (2 · 𝑅)) ∈ ℝ)
92	21	adantr 481	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑗) − 𝑅) ∈ ℝ)
93	59	recnd 11171	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → 𝑅 ∈ ℂ)
94	93	2timesd 12418	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (2 · 𝑅) = (𝑅 + 𝑅))
95	94	oveq2d 7379	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑚) − (2 · 𝑅)) = ((𝐹‘𝑚) − (𝑅 + 𝑅)))
96	88, 93, 93	subsub4d 11534	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (((𝐹‘𝑚) − 𝑅) − 𝑅) = ((𝐹‘𝑚) − (𝑅 + 𝑅)))
97	95, 96	eqtr4d 2778	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑚) − (2 · 𝑅)) = (((𝐹‘𝑚) − 𝑅) − 𝑅))
98	66, 59	resubcld 11576	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑚) − 𝑅) ∈ ℝ)
99	66, 59, 67	lesubaddd 11745	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (((𝐹‘𝑚) − 𝑅) ≤ (𝐹‘𝑗) ↔ (𝐹‘𝑚) ≤ ((𝐹‘𝑗) + 𝑅)))
100	70, 99	mpbird 258	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑚) − 𝑅) ≤ (𝐹‘𝑗))
101	98, 67, 59, 100	lesub1dd 11764	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (((𝐹‘𝑚) − 𝑅) − 𝑅) ≤ ((𝐹‘𝑗) − 𝑅))
102	97, 101	eqbrtrd 5101	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑚) − (2 · 𝑅)) ≤ ((𝐹‘𝑗) − 𝑅))
103	55	adantr 481	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑗) − 𝑅) ≤ (lim sup‘𝐹))
104	91, 92, 78, 102, 103	letrd 11301	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑚) − (2 · 𝑅)) ≤ (lim sup‘𝐹))
105	18	adantr 481	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑗) + 𝑅) ∈ ℝ)
106	66, 84	readdcld 11172	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑚) + (2 · 𝑅)) ∈ ℝ)
107	75	adantr 481	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (lim sup‘𝐹) ≤ ((𝐹‘𝑗) + 𝑅))
108	66, 59	readdcld 11172	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑚) + 𝑅) ∈ ℝ)
109	69, 47	syl 17	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑗) − 𝑅) ≤ (𝐹‘𝑚))
110	67, 59, 66	lesubaddd 11745	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (((𝐹‘𝑗) − 𝑅) ≤ (𝐹‘𝑚) ↔ (𝐹‘𝑗) ≤ ((𝐹‘𝑚) + 𝑅)))
111	109, 110	mpbid 233	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (𝐹‘𝑗) ≤ ((𝐹‘𝑚) + 𝑅))
112	67, 108, 59, 111	leadd1dd 11762	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑗) + 𝑅) ≤ (((𝐹‘𝑚) + 𝑅) + 𝑅))
113	88, 93, 93	addassd 11165	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (((𝐹‘𝑚) + 𝑅) + 𝑅) = ((𝐹‘𝑚) + (𝑅 + 𝑅)))
114	94	oveq2d 7379	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑚) + (2 · 𝑅)) = ((𝐹‘𝑚) + (𝑅 + 𝑅)))
115	113, 114	eqtr4d 2778	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (((𝐹‘𝑚) + 𝑅) + 𝑅) = ((𝐹‘𝑚) + (2 · 𝑅)))
116	112, 115	breqtrd 5105	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((𝐹‘𝑗) + 𝑅) ≤ ((𝐹‘𝑚) + (2 · 𝑅)))
117	78, 105, 106, 107, 116	letrd 11301	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (lim sup‘𝐹) ≤ ((𝐹‘𝑚) + (2 · 𝑅)))
118	78, 66, 84	absdifled 15397	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → ((abs‘((lim sup‘𝐹) − (𝐹‘𝑚))) ≤ (2 · 𝑅) ↔ (((𝐹‘𝑚) − (2 · 𝑅)) ≤ (lim sup‘𝐹) ∧ (lim sup‘𝐹) ≤ ((𝐹‘𝑚) + (2 · 𝑅)))))
119	104, 117, 118	mpbir2and 719	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (abs‘((lim sup‘𝐹) − (𝐹‘𝑚))) ≤ (2 · 𝑅))
120	90, 119	eqbrtrd 5101	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (abs‘((𝐹‘𝑚) − (lim sup‘𝐹))) ≤ (2 · 𝑅))
121		2lt3 12346	. . . . . . . 8 ⊢ 2 < 3
122	82	a1i 11	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → 2 ∈ ℝ)
123	85	a1i 11	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → 3 ∈ ℝ)
124	15	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → 𝑅 ∈ ℝ⁺)
125	124	adantr 481	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → 𝑅 ∈ ℝ⁺)
126	122, 123, 125	ltmul1d 13025	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (2 < 3 ↔ (2 · 𝑅) < (3 · 𝑅)))
127	121, 126	mpbii 234	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (2 · 𝑅) < (3 · 𝑅))
128	81, 84, 87, 120, 127	lelttrd 11302	. . . . . 6 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑗 ≤ 𝑚)) → (abs‘((𝐹‘𝑚) − (lim sup‘𝐹))) < (3 · 𝑅))
129	128	expr 457	. . . . 5 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) ∧ 𝑚 ∈ 𝐴) → (𝑗 ≤ 𝑚 → (abs‘((𝐹‘𝑚) − (lim sup‘𝐹))) < (3 · 𝑅)))
130	129	ralrimiva 3132	. . . 4 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → ∀𝑚 ∈ 𝐴 (𝑗 ≤ 𝑚 → (abs‘((𝐹‘𝑚) − (lim sup‘𝐹))) < (3 · 𝑅)))
131	33	imbrov2fvoveq 7388	. . . . 5 ⊢ (𝑘 = 𝑚 → ((𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < (3 · 𝑅)) ↔ (𝑗 ≤ 𝑚 → (abs‘((𝐹‘𝑚) − (lim sup‘𝐹))) < (3 · 𝑅))))
132	131	cbvralvw 3218	. . . 4 ⊢ (∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < (3 · 𝑅)) ↔ ∀𝑚 ∈ 𝐴 (𝑗 ≤ 𝑚 → (abs‘((𝐹‘𝑚) − (lim sup‘𝐹))) < (3 · 𝑅)))
133	130, 132	sylibr 235	. . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < (3 · 𝑅)))
134	77, 133	jca 516	. 2 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))) → ((lim sup‘𝐹) ∈ ℝ ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < (3 · 𝑅))))
135		breq2 5083	. . . . 5 ⊢ (𝑥 = 𝑅 → ((abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥 ↔ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))
136	135	imbi2d 341	. . . 4 ⊢ (𝑥 = 𝑅 → ((𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) ↔ (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅)))
137	136	rexralbidv 3206	. . 3 ⊢ (𝑥 = 𝑅 → (∃𝑗 ∈ 𝐴 ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) ↔ ∃𝑗 ∈ 𝐴 ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅)))
138		caurcvgr.4	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝐴 ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥))
139	137, 138, 15	rspcdva 3568	. 2 ⊢ (𝜑 → ∃𝑗 ∈ 𝐴 ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑅))
140	134, 139	reximddv 3156	1 ⊢ (𝜑 → ∃𝑗 ∈ 𝐴 ((lim sup‘𝐹) ∈ ℝ ∧ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < (3 · 𝑅))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∀wral 3054 ∃wrex 3064 Vcvv 3432 ⊆ wss 3890 class class class wbr 5079 ⟶wf 6488 ‘cfv 6492 (class class class)co 7363 supcsup 9350 ℝcr 11035 + caddc 11039 · cmul 11041 +∞cpnf 11174 -∞cmnf 11175 ℝ^*cxr 11176 < clt 11177 ≤ cle 11178 − cmin 11375 2c2 12234 3c3 12235 ℝ⁺crp 12940 abscabs 15194 lim supclsp 15430

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 ax-pre-sup 11114

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-sup 9352 df-inf 9353 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-div 11806 df-nn 12173 df-2 12242 df-3 12243 df-n0 12436 df-z 12523 df-uz 12787 df-rp 12941 df-ico 13302 df-seq 13962 df-exp 14022 df-cj 15059 df-re 15060 df-im 15061 df-sqrt 15195 df-abs 15196 df-limsup 15431

This theorem is referenced by: caurcvgr 15634

W3C validator