caurcvg2 - Metamath Proof Explorer

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

Theorem caurcvg2 15629

Description: A Cauchy sequence of real numbers converges, existence version. (Contributed by NM, 4-Apr-2005.) (Revised by Mario Carneiro, 7-Sep-2014.)

**Hypotheses**
Ref	Expression
caucvg.1	⊢ 𝑍 = (ℤ_≥‘𝑀)
caurcvg2.2	⊢ (𝜑 → 𝐹 ∈ 𝑉)
caurcvg2.3	⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥))

**Assertion**
Ref	Expression
caurcvg2	⊢ (𝜑 → 𝐹 ∈ dom ⇝ )

Distinct variable groups: 𝑗,𝑘,𝑥,𝐹 𝑗,𝑀,𝑘,𝑥 𝜑,𝑗,𝑘,𝑥 𝑗,𝑍,𝑘,𝑥 Allowed substitution hints: 𝑉(𝑥,𝑗,𝑘)

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

Step	Hyp	Ref	Expression
1		1rp 12983	. . . 4 ⊢ 1 ∈ ℝ⁺
2	1	ne0ii 4337	. . 3 ⊢ ℝ⁺ ≠ ∅
3		caurcvg2.3	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥))
4		r19.2z 4494	. . 3 ⊢ ((ℝ⁺ ≠ ∅ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥)) → ∃𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥))
5	2, 3, 4	sylancr 586	. 2 ⊢ (𝜑 → ∃𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥))
6		simpl 482	. . . . . 6 ⊢ (((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → (𝐹‘𝑘) ∈ ℝ)
7	6	ralimi 3082	. . . . 5 ⊢ (∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ)
8		eqid 2731	. . . . . . . . 9 ⊢ (ℤ_≥‘𝑗) = (ℤ_≥‘𝑗)
9		simprr 770	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ)) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ)
10		fveq2 6891	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑛 → (𝐹‘𝑘) = (𝐹‘𝑛))
11	10	eleq1d 2817	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑛 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑛) ∈ ℝ))
12	11	rspccva 3611	. . . . . . . . . . 11 ⊢ ((∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑛) ∈ ℝ)
13	9, 12	sylan 579	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ)) ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑛) ∈ ℝ)
14	13	fmpttd 7116	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ)) → (𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛)):(ℤ_≥‘𝑗)⟶ℝ)
15		fveq2 6891	. . . . . . . . . . . . . . . . 17 ⊢ (𝑗 = 𝑚 → (ℤ_≥‘𝑗) = (ℤ_≥‘𝑚))
16		fveq2 6891	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑗 = 𝑚 → (𝐹‘𝑗) = (𝐹‘𝑚))
17	16	oveq2d 7428	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑗 = 𝑚 → ((𝐹‘𝑘) − (𝐹‘𝑗)) = ((𝐹‘𝑘) − (𝐹‘𝑚)))
18	17	fveq2d 6895	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑗 = 𝑚 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) = (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))))
19	18	breq1d 5158	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑗 = 𝑚 → ((abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥 ↔ (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥))
20	19	anbi2d 628	. . . . . . . . . . . . . . . . 17 ⊢ (𝑗 = 𝑚 → (((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) ↔ ((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥)))
21	15, 20	raleqbidv 3341	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 = 𝑚 → (∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) ↔ ∀𝑘 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥)))
22	21	cbvrexvw 3234	. . . . . . . . . . . . . . 15 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) ↔ ∃𝑚 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥))
23		fveq2 6891	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 = 𝑖 → (𝐹‘𝑘) = (𝐹‘𝑖))
24	23	eleq1d 2817	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 = 𝑖 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑖) ∈ ℝ))
25	23	fvoveq1d 7434	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 = 𝑖 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) = (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))))
26	25	breq1d 5158	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 = 𝑖 → ((abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥 ↔ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥))
27	24, 26	anbi12d 630	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 = 𝑖 → (((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥) ↔ ((𝐹‘𝑖) ∈ ℝ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥)))
28	27	cbvralvw 3233	. . . . . . . . . . . . . . . . 17 ⊢ (∀𝑘 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥) ↔ ∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℝ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥))
29		recn 11203	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹‘𝑖) ∈ ℝ → (𝐹‘𝑖) ∈ ℂ)
30	29	anim1i 614	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹‘𝑖) ∈ ℝ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥) → ((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥))
31	30	ralimi 3082	. . . . . . . . . . . . . . . . 17 ⊢ (∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℝ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥) → ∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥))
32	28, 31	sylbi 216	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑘 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥) → ∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥))
33	32	reximi 3083	. . . . . . . . . . . . . . 15 ⊢ (∃𝑚 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥) → ∃𝑚 ∈ 𝑍 ∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥))
34	22, 33	sylbi 216	. . . . . . . . . . . . . 14 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → ∃𝑚 ∈ 𝑍 ∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥))
35	34	ralimi 3082	. . . . . . . . . . . . 13 ⊢ (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥))
36	3, 35	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥))
37	36	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ)) → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥))
38		caucvg.1	. . . . . . . . . . . . 13 ⊢ 𝑍 = (ℤ_≥‘𝑀)
39	38, 8	cau4 15308	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ 𝑍 → (∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥) ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥)))
40	39	ad2antrl 725	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ)) → (∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥) ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥)))
41	37, 40	mpbid 231	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ)) → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥))
42		simpr 484	. . . . . . . . . . . . . 14 ⊢ (((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥) → (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥)
43	8	uztrn2 12846	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑚 ∈ (ℤ_≥‘𝑗) ∧ 𝑖 ∈ (ℤ_≥‘𝑚)) → 𝑖 ∈ (ℤ_≥‘𝑗))
44		fveq2 6891	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = 𝑖 → (𝐹‘𝑛) = (𝐹‘𝑖))
45		eqid 2731	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛)) = (𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))
46		fvex 6904	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐹‘𝑖) ∈ V
47	44, 45, 46	fvmpt 6998	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑖 ∈ (ℤ_≥‘𝑗) → ((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑖) = (𝐹‘𝑖))
48	43, 47	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑚 ∈ (ℤ_≥‘𝑗) ∧ 𝑖 ∈ (ℤ_≥‘𝑚)) → ((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑖) = (𝐹‘𝑖))
49		fveq2 6891	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = 𝑚 → (𝐹‘𝑛) = (𝐹‘𝑚))
50		fvex 6904	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐹‘𝑚) ∈ V
51	49, 45, 50	fvmpt 6998	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑚 ∈ (ℤ_≥‘𝑗) → ((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑚) = (𝐹‘𝑚))
52	51	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑚 ∈ (ℤ_≥‘𝑗) ∧ 𝑖 ∈ (ℤ_≥‘𝑚)) → ((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑚) = (𝐹‘𝑚))
53	48, 52	oveq12d 7430	. . . . . . . . . . . . . . . 16 ⊢ ((𝑚 ∈ (ℤ_≥‘𝑗) ∧ 𝑖 ∈ (ℤ_≥‘𝑚)) → (((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑖) − ((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑚)) = ((𝐹‘𝑖) − (𝐹‘𝑚)))
54	53	fveq2d 6895	. . . . . . . . . . . . . . 15 ⊢ ((𝑚 ∈ (ℤ_≥‘𝑗) ∧ 𝑖 ∈ (ℤ_≥‘𝑚)) → (abs‘(((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑖) − ((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑚))) = (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))))
55	54	breq1d 5158	. . . . . . . . . . . . . 14 ⊢ ((𝑚 ∈ (ℤ_≥‘𝑗) ∧ 𝑖 ∈ (ℤ_≥‘𝑚)) → ((abs‘(((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑖) − ((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑚))) < 𝑥 ↔ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥))
56	42, 55	imbitrrid 245	. . . . . . . . . . . . 13 ⊢ ((𝑚 ∈ (ℤ_≥‘𝑗) ∧ 𝑖 ∈ (ℤ_≥‘𝑚)) → (((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥) → (abs‘(((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑖) − ((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑚))) < 𝑥))
57	56	ralimdva 3166	. . . . . . . . . . . 12 ⊢ (𝑚 ∈ (ℤ_≥‘𝑗) → (∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥) → ∀𝑖 ∈ (ℤ_≥‘𝑚)(abs‘(((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑖) − ((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑚))) < 𝑥))
58	57	reximia 3080	. . . . . . . . . . 11 ⊢ (∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥) → ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑖 ∈ (ℤ_≥‘𝑚)(abs‘(((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑖) − ((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑚))) < 𝑥)
59	58	ralimi 3082	. . . . . . . . . 10 ⊢ (∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑖 ∈ (ℤ_≥‘𝑚)((𝐹‘𝑖) ∈ ℂ ∧ (abs‘((𝐹‘𝑖) − (𝐹‘𝑚))) < 𝑥) → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑖 ∈ (ℤ_≥‘𝑚)(abs‘(((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑖) − ((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑚))) < 𝑥)
60	41, 59	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ)) → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑖 ∈ (ℤ_≥‘𝑚)(abs‘(((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑖) − ((𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))‘𝑚))) < 𝑥)
61	8, 14, 60	caurcvg 15628	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ)) → (𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛)) ⇝ (lim sup‘(𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))))
62		eluzelz 12837	. . . . . . . . . . 11 ⊢ (𝑗 ∈ (ℤ_≥‘𝑀) → 𝑗 ∈ ℤ)
63	62, 38	eleq2s 2850	. . . . . . . . . 10 ⊢ (𝑗 ∈ 𝑍 → 𝑗 ∈ ℤ)
64	63	ad2antrl 725	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ)) → 𝑗 ∈ ℤ)
65		caurcvg2.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹 ∈ 𝑉)
66	65	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ)) → 𝐹 ∈ 𝑉)
67		fveq2 6891	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑘 → (𝐹‘𝑛) = (𝐹‘𝑘))
68	67	cbvmptv 5261	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛)) = (𝑘 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑘))
69	8, 68	climmpt 15520	. . . . . . . . 9 ⊢ ((𝑗 ∈ ℤ ∧ 𝐹 ∈ 𝑉) → (𝐹 ⇝ (lim sup‘(𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))) ↔ (𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛)) ⇝ (lim sup‘(𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛)))))
70	64, 66, 69	syl2anc 583	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ)) → (𝐹 ⇝ (lim sup‘(𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))) ↔ (𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛)) ⇝ (lim sup‘(𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛)))))
71	61, 70	mpbird 257	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ)) → 𝐹 ⇝ (lim sup‘(𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))))
72		climrel 15441	. . . . . . . 8 ⊢ Rel ⇝
73	72	releldmi 5947	. . . . . . 7 ⊢ (𝐹 ⇝ (lim sup‘(𝑛 ∈ (ℤ_≥‘𝑗) ↦ (𝐹‘𝑛))) → 𝐹 ∈ dom ⇝ )
74	71, 73	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ)) → 𝐹 ∈ dom ⇝ )
75	74	expr 456	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℝ → 𝐹 ∈ dom ⇝ ))
76	7, 75	syl5 34	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → 𝐹 ∈ dom ⇝ ))
77	76	rexlimdva 3154	. . 3 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → 𝐹 ∈ dom ⇝ ))
78	77	rexlimdvw 3159	. 2 ⊢ (𝜑 → (∃𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℝ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → 𝐹 ∈ dom ⇝ ))
79	5, 78	mpd 15	1 ⊢ (𝜑 → 𝐹 ∈ dom ⇝ )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1540 ∈ wcel 2105 ≠ wne 2939 ∀wral 3060 ∃wrex 3069 ∅c0 4322 class class class wbr 5148 ↦ cmpt 5231 dom cdm 5676 ‘cfv 6543 (class class class)co 7412 ℂcc 11111 ℝcr 11112 1c1 11114 < clt 11253 − cmin 11449 ℤcz 12563 ℤ_≥cuz 12827 ℝ⁺crp 12979 abscabs 15186 lim supclsp 15419 ⇝ cli 15433

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7728 ax-cnex 11169 ax-resscn 11170 ax-1cn 11171 ax-icn 11172 ax-addcl 11173 ax-addrcl 11174 ax-mulcl 11175 ax-mulrcl 11176 ax-mulcom 11177 ax-addass 11178 ax-mulass 11179 ax-distr 11180 ax-i2m1 11181 ax-1ne0 11182 ax-1rid 11183 ax-rnegex 11184 ax-rrecex 11185 ax-cnre 11186 ax-pre-lttri 11187 ax-pre-lttrn 11188 ax-pre-ltadd 11189 ax-pre-mulgt0 11190 ax-pre-sup 11191

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3375 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7368 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7859 df-2nd 7979 df-frecs 8269 df-wrecs 8300 df-recs 8374 df-rdg 8413 df-er 8706 df-pm 8826 df-en 8943 df-dom 8944 df-sdom 8945 df-sup 9440 df-inf 9441 df-pnf 11255 df-mnf 11256 df-xr 11257 df-ltxr 11258 df-le 11259 df-sub 11451 df-neg 11452 df-div 11877 df-nn 12218 df-2 12280 df-3 12281 df-n0 12478 df-z 12564 df-uz 12828 df-rp 12980 df-ico 13335 df-fl 13762 df-seq 13972 df-exp 14033 df-cj 15051 df-re 15052 df-im 15053 df-sqrt 15187 df-abs 15188 df-limsup 15420 df-clim 15437 df-rlim 15438

This theorem is referenced by: iseralt 15636 cvgcmp 15767

W3C validator