caubnd - Metamath Proof Explorer

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

Theorem caubnd 15397

Description: A Cauchy sequence of complex numbers is bounded. (Contributed by NM, 4-Apr-2005.) (Revised by Mario Carneiro, 14-Feb-2014.)

**Hypothesis**
Ref	Expression
cau3.1	⊢ 𝑍 = (ℤ_≥‘𝑀)

**Assertion**
Ref	Expression
caubnd	⊢ ((∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦)

Distinct variable groups: 𝑗,𝑘,𝑥,𝑦,𝐹 𝑗,𝑀,𝑘,𝑥 𝑗,𝑍,𝑘,𝑥,𝑦 Allowed substitution hint: 𝑀(𝑦)

Proof of Theorem caubnd Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		abscl 15317	. . . 4 ⊢ ((𝐹‘𝑘) ∈ ℂ → (abs‘(𝐹‘𝑘)) ∈ ℝ)
2	1	ralimi 3083	. . 3 ⊢ (∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℂ → ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) ∈ ℝ)
3		cau3.1	. . . . . . 7 ⊢ 𝑍 = (ℤ_≥‘𝑀)
4	3	r19.29uz 15389	. . . . . 6 ⊢ ((∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℂ ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥))
5	4	ex 412	. . . . 5 ⊢ (∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℂ → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥)))
6	5	ralimdv 3169	. . . 4 ⊢ (∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℂ → (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥)))
7	3	caubnd2 15396	. . . 4 ⊢ (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → ∃𝑧 ∈ ℝ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧)
8	6, 7	syl6 35	. . 3 ⊢ (∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℂ → (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥 → ∃𝑧 ∈ ℝ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧))
9		fzssuz 13605	. . . . . . . 8 ⊢ (𝑀...𝑗) ⊆ (ℤ_≥‘𝑀)
10	9, 3	sseqtrri 4033	. . . . . . 7 ⊢ (𝑀...𝑗) ⊆ 𝑍
11		ssralv 4052	. . . . . . 7 ⊢ ((𝑀...𝑗) ⊆ 𝑍 → (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) ∈ ℝ → ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ∈ ℝ))
12	10, 11	ax-mp 5	. . . . . 6 ⊢ (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) ∈ ℝ → ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ∈ ℝ)
13		fzfi 14013	. . . . . . . 8 ⊢ (𝑀...𝑗) ∈ Fin
14		fimaxre3 12214	. . . . . . . 8 ⊢ (((𝑀...𝑗) ∈ Fin ∧ ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ∈ ℝ) → ∃𝑥 ∈ ℝ ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ≤ 𝑥)
15	13, 14	mpan 690	. . . . . . 7 ⊢ (∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ∈ ℝ → ∃𝑥 ∈ ℝ ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ≤ 𝑥)
16		peano2re 11434	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → (𝑥 + 1) ∈ ℝ)
17	16	adantl 481	. . . . . . . . 9 ⊢ ((∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝑥 + 1) ∈ ℝ)
18		ltp1 12107	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ℝ → 𝑥 < (𝑥 + 1))
19	18	adantl 481	. . . . . . . . . . . . . 14 ⊢ (((abs‘(𝐹‘𝑘)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → 𝑥 < (𝑥 + 1))
20	16	adantl 481	. . . . . . . . . . . . . . 15 ⊢ (((abs‘(𝐹‘𝑘)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝑥 + 1) ∈ ℝ)
21		lelttr 11351	. . . . . . . . . . . . . . 15 ⊢ (((abs‘(𝐹‘𝑘)) ∈ ℝ ∧ 𝑥 ∈ ℝ ∧ (𝑥 + 1) ∈ ℝ) → (((abs‘(𝐹‘𝑘)) ≤ 𝑥 ∧ 𝑥 < (𝑥 + 1)) → (abs‘(𝐹‘𝑘)) < (𝑥 + 1)))
22	20, 21	mpd3an3 1464	. . . . . . . . . . . . . 14 ⊢ (((abs‘(𝐹‘𝑘)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (((abs‘(𝐹‘𝑘)) ≤ 𝑥 ∧ 𝑥 < (𝑥 + 1)) → (abs‘(𝐹‘𝑘)) < (𝑥 + 1)))
23	19, 22	mpan2d 694	. . . . . . . . . . . . 13 ⊢ (((abs‘(𝐹‘𝑘)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑘)) ≤ 𝑥 → (abs‘(𝐹‘𝑘)) < (𝑥 + 1)))
24	23	expcom 413	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℝ → ((abs‘(𝐹‘𝑘)) ∈ ℝ → ((abs‘(𝐹‘𝑘)) ≤ 𝑥 → (abs‘(𝐹‘𝑘)) < (𝑥 + 1))))
25	24	ralimdv 3169	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ℝ → (∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ∈ ℝ → ∀𝑘 ∈ (𝑀...𝑗)((abs‘(𝐹‘𝑘)) ≤ 𝑥 → (abs‘(𝐹‘𝑘)) < (𝑥 + 1))))
26	25	impcom 407	. . . . . . . . . 10 ⊢ ((∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ∀𝑘 ∈ (𝑀...𝑗)((abs‘(𝐹‘𝑘)) ≤ 𝑥 → (abs‘(𝐹‘𝑘)) < (𝑥 + 1)))
27		ralim 3086	. . . . . . . . . 10 ⊢ (∀𝑘 ∈ (𝑀...𝑗)((abs‘(𝐹‘𝑘)) ≤ 𝑥 → (abs‘(𝐹‘𝑘)) < (𝑥 + 1)) → (∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ≤ 𝑥 → ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < (𝑥 + 1)))
28	26, 27	syl 17	. . . . . . . . 9 ⊢ ((∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ≤ 𝑥 → ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < (𝑥 + 1)))
29		brralrspcev 5203	. . . . . . . . 9 ⊢ (((𝑥 + 1) ∈ ℝ ∧ ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < (𝑥 + 1)) → ∃𝑤 ∈ ℝ ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤)
30	17, 28, 29	syl6an 684	. . . . . . . 8 ⊢ ((∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ≤ 𝑥 → ∃𝑤 ∈ ℝ ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤))
31	30	rexlimdva 3155	. . . . . . 7 ⊢ (∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ∈ ℝ → (∃𝑥 ∈ ℝ ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ≤ 𝑥 → ∃𝑤 ∈ ℝ ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤))
32	15, 31	mpd 15	. . . . . 6 ⊢ (∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) ∈ ℝ → ∃𝑤 ∈ ℝ ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤)
33	12, 32	syl 17	. . . . 5 ⊢ (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) ∈ ℝ → ∃𝑤 ∈ ℝ ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤)
34		max1 13227	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ) → 𝑤 ≤ if(𝑤 ≤ 𝑧, 𝑧, 𝑤))
35	34	3adant3 1133	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ (abs‘(𝐹‘𝑘)) ∈ ℝ) → 𝑤 ≤ if(𝑤 ≤ 𝑧, 𝑧, 𝑤))
36		simp3 1139	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ (abs‘(𝐹‘𝑘)) ∈ ℝ) → (abs‘(𝐹‘𝑘)) ∈ ℝ)
37		simp1 1137	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ (abs‘(𝐹‘𝑘)) ∈ ℝ) → 𝑤 ∈ ℝ)
38		ifcl 4571	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑧 ∈ ℝ ∧ 𝑤 ∈ ℝ) → if(𝑤 ≤ 𝑧, 𝑧, 𝑤) ∈ ℝ)
39	38	ancoms 458	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ) → if(𝑤 ≤ 𝑧, 𝑧, 𝑤) ∈ ℝ)
40	39	3adant3 1133	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ (abs‘(𝐹‘𝑘)) ∈ ℝ) → if(𝑤 ≤ 𝑧, 𝑧, 𝑤) ∈ ℝ)
41		ltletr 11353	. . . . . . . . . . . . . . . . . 18 ⊢ (((abs‘(𝐹‘𝑘)) ∈ ℝ ∧ 𝑤 ∈ ℝ ∧ if(𝑤 ≤ 𝑧, 𝑧, 𝑤) ∈ ℝ) → (((abs‘(𝐹‘𝑘)) < 𝑤 ∧ 𝑤 ≤ if(𝑤 ≤ 𝑧, 𝑧, 𝑤)) → (abs‘(𝐹‘𝑘)) < if(𝑤 ≤ 𝑧, 𝑧, 𝑤)))
42	36, 37, 40, 41	syl3anc 1373	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ (abs‘(𝐹‘𝑘)) ∈ ℝ) → (((abs‘(𝐹‘𝑘)) < 𝑤 ∧ 𝑤 ≤ if(𝑤 ≤ 𝑧, 𝑧, 𝑤)) → (abs‘(𝐹‘𝑘)) < if(𝑤 ≤ 𝑧, 𝑧, 𝑤)))
43	35, 42	mpan2d 694	. . . . . . . . . . . . . . . 16 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ (abs‘(𝐹‘𝑘)) ∈ ℝ) → ((abs‘(𝐹‘𝑘)) < 𝑤 → (abs‘(𝐹‘𝑘)) < if(𝑤 ≤ 𝑧, 𝑧, 𝑤)))
44		max2 13229	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ) → 𝑧 ≤ if(𝑤 ≤ 𝑧, 𝑧, 𝑤))
45	44	3adant3 1133	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ (abs‘(𝐹‘𝑘)) ∈ ℝ) → 𝑧 ≤ if(𝑤 ≤ 𝑧, 𝑧, 𝑤))
46		simp2 1138	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ (abs‘(𝐹‘𝑘)) ∈ ℝ) → 𝑧 ∈ ℝ)
47		ltletr 11353	. . . . . . . . . . . . . . . . . 18 ⊢ (((abs‘(𝐹‘𝑘)) ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ if(𝑤 ≤ 𝑧, 𝑧, 𝑤) ∈ ℝ) → (((abs‘(𝐹‘𝑘)) < 𝑧 ∧ 𝑧 ≤ if(𝑤 ≤ 𝑧, 𝑧, 𝑤)) → (abs‘(𝐹‘𝑘)) < if(𝑤 ≤ 𝑧, 𝑧, 𝑤)))
48	36, 46, 40, 47	syl3anc 1373	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ (abs‘(𝐹‘𝑘)) ∈ ℝ) → (((abs‘(𝐹‘𝑘)) < 𝑧 ∧ 𝑧 ≤ if(𝑤 ≤ 𝑧, 𝑧, 𝑤)) → (abs‘(𝐹‘𝑘)) < if(𝑤 ≤ 𝑧, 𝑧, 𝑤)))
49	45, 48	mpan2d 694	. . . . . . . . . . . . . . . 16 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ (abs‘(𝐹‘𝑘)) ∈ ℝ) → ((abs‘(𝐹‘𝑘)) < 𝑧 → (abs‘(𝐹‘𝑘)) < if(𝑤 ≤ 𝑧, 𝑧, 𝑤)))
50	43, 49	jaod 860	. . . . . . . . . . . . . . 15 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ (abs‘(𝐹‘𝑘)) ∈ ℝ) → (((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧) → (abs‘(𝐹‘𝑘)) < if(𝑤 ≤ 𝑧, 𝑧, 𝑤)))
51	50	3expia 1122	. . . . . . . . . . . . . 14 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ) → ((abs‘(𝐹‘𝑘)) ∈ ℝ → (((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧) → (abs‘(𝐹‘𝑘)) < if(𝑤 ≤ 𝑧, 𝑧, 𝑤))))
52	51	ralimdv 3169	. . . . . . . . . . . . 13 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) ∈ ℝ → ∀𝑘 ∈ 𝑍 (((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧) → (abs‘(𝐹‘𝑘)) < if(𝑤 ≤ 𝑧, 𝑧, 𝑤))))
53		ralim 3086	. . . . . . . . . . . . 13 ⊢ (∀𝑘 ∈ 𝑍 (((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧) → (abs‘(𝐹‘𝑘)) < if(𝑤 ≤ 𝑧, 𝑧, 𝑤)) → (∀𝑘 ∈ 𝑍 ((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧) → ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < if(𝑤 ≤ 𝑧, 𝑧, 𝑤)))
54	52, 53	syl6 35	. . . . . . . . . . . 12 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) ∈ ℝ → (∀𝑘 ∈ 𝑍 ((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧) → ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < if(𝑤 ≤ 𝑧, 𝑧, 𝑤))))
55		brralrspcev 5203	. . . . . . . . . . . . . 14 ⊢ ((if(𝑤 ≤ 𝑧, 𝑧, 𝑤) ∈ ℝ ∧ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < if(𝑤 ≤ 𝑧, 𝑧, 𝑤)) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦)
56	55	ex 412	. . . . . . . . . . . . 13 ⊢ (if(𝑤 ≤ 𝑧, 𝑧, 𝑤) ∈ ℝ → (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < if(𝑤 ≤ 𝑧, 𝑧, 𝑤) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦))
57	39, 56	syl 17	. . . . . . . . . . . 12 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < if(𝑤 ≤ 𝑧, 𝑧, 𝑤) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦))
58	54, 57	syl6d 75	. . . . . . . . . . 11 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) ∈ ℝ → (∀𝑘 ∈ 𝑍 ((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦)))
59		uzssz 12899	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (ℤ_≥‘𝑀) ⊆ ℤ
60	3, 59	eqsstri 4030	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 𝑍 ⊆ ℤ
61	60	sseli 3979	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ 𝑍 → 𝑘 ∈ ℤ)
62	60	sseli 3979	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑗 ∈ 𝑍 → 𝑗 ∈ ℤ)
63		uztric 12902	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑘 ∈ ℤ ∧ 𝑗 ∈ ℤ) → (𝑗 ∈ (ℤ_≥‘𝑘) ∨ 𝑘 ∈ (ℤ_≥‘𝑗)))
64	61, 62, 63	syl2anr 597	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ 𝑍) → (𝑗 ∈ (ℤ_≥‘𝑘) ∨ 𝑘 ∈ (ℤ_≥‘𝑗)))
65		simpr 484	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ 𝑍) → 𝑘 ∈ 𝑍)
66	65, 3	eleqtrdi 2851	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ 𝑍) → 𝑘 ∈ (ℤ_≥‘𝑀))
67		elfzuzb 13558	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑘 ∈ (𝑀...𝑗) ↔ (𝑘 ∈ (ℤ_≥‘𝑀) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)))
68	67	baib 535	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑘 ∈ (ℤ_≥‘𝑀) → (𝑘 ∈ (𝑀...𝑗) ↔ 𝑗 ∈ (ℤ_≥‘𝑘)))
69	66, 68	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ 𝑍) → (𝑘 ∈ (𝑀...𝑗) ↔ 𝑗 ∈ (ℤ_≥‘𝑘)))
70	69	orbi1d 917	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ 𝑍) → ((𝑘 ∈ (𝑀...𝑗) ∨ 𝑘 ∈ (ℤ_≥‘𝑗)) ↔ (𝑗 ∈ (ℤ_≥‘𝑘) ∨ 𝑘 ∈ (ℤ_≥‘𝑗))))
71	64, 70	mpbird 257	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ 𝑍) → (𝑘 ∈ (𝑀...𝑗) ∨ 𝑘 ∈ (ℤ_≥‘𝑗)))
72	71	ex 412	. . . . . . . . . . . . . . . . 17 ⊢ (𝑗 ∈ 𝑍 → (𝑘 ∈ 𝑍 → (𝑘 ∈ (𝑀...𝑗) ∨ 𝑘 ∈ (ℤ_≥‘𝑗))))
73		pm3.48 966	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑘 ∈ (𝑀...𝑗) → (abs‘(𝐹‘𝑘)) < 𝑤) ∧ (𝑘 ∈ (ℤ_≥‘𝑗) → (abs‘(𝐹‘𝑘)) < 𝑧)) → ((𝑘 ∈ (𝑀...𝑗) ∨ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧)))
74	72, 73	syl9 77	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 ∈ 𝑍 → (((𝑘 ∈ (𝑀...𝑗) → (abs‘(𝐹‘𝑘)) < 𝑤) ∧ (𝑘 ∈ (ℤ_≥‘𝑗) → (abs‘(𝐹‘𝑘)) < 𝑧)) → (𝑘 ∈ 𝑍 → ((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧))))
75	74	alimdv 1916	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ 𝑍 → (∀𝑘((𝑘 ∈ (𝑀...𝑗) → (abs‘(𝐹‘𝑘)) < 𝑤) ∧ (𝑘 ∈ (ℤ_≥‘𝑗) → (abs‘(𝐹‘𝑘)) < 𝑧)) → ∀𝑘(𝑘 ∈ 𝑍 → ((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧))))
76		df-ral 3062	. . . . . . . . . . . . . . . . 17 ⊢ (∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤 ↔ ∀𝑘(𝑘 ∈ (𝑀...𝑗) → (abs‘(𝐹‘𝑘)) < 𝑤))
77		df-ral 3062	. . . . . . . . . . . . . . . . 17 ⊢ (∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧 ↔ ∀𝑘(𝑘 ∈ (ℤ_≥‘𝑗) → (abs‘(𝐹‘𝑘)) < 𝑧))
78	76, 77	anbi12i 628	. . . . . . . . . . . . . . . 16 ⊢ ((∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧) ↔ (∀𝑘(𝑘 ∈ (𝑀...𝑗) → (abs‘(𝐹‘𝑘)) < 𝑤) ∧ ∀𝑘(𝑘 ∈ (ℤ_≥‘𝑗) → (abs‘(𝐹‘𝑘)) < 𝑧)))
79		19.26 1870	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑘((𝑘 ∈ (𝑀...𝑗) → (abs‘(𝐹‘𝑘)) < 𝑤) ∧ (𝑘 ∈ (ℤ_≥‘𝑗) → (abs‘(𝐹‘𝑘)) < 𝑧)) ↔ (∀𝑘(𝑘 ∈ (𝑀...𝑗) → (abs‘(𝐹‘𝑘)) < 𝑤) ∧ ∀𝑘(𝑘 ∈ (ℤ_≥‘𝑗) → (abs‘(𝐹‘𝑘)) < 𝑧)))
80	78, 79	bitr4i 278	. . . . . . . . . . . . . . 15 ⊢ ((∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧) ↔ ∀𝑘((𝑘 ∈ (𝑀...𝑗) → (abs‘(𝐹‘𝑘)) < 𝑤) ∧ (𝑘 ∈ (ℤ_≥‘𝑗) → (abs‘(𝐹‘𝑘)) < 𝑧)))
81		df-ral 3062	. . . . . . . . . . . . . . 15 ⊢ (∀𝑘 ∈ 𝑍 ((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧) ↔ ∀𝑘(𝑘 ∈ 𝑍 → ((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧)))
82	75, 80, 81	3imtr4g 296	. . . . . . . . . . . . . 14 ⊢ (𝑗 ∈ 𝑍 → ((∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧) → ∀𝑘 ∈ 𝑍 ((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧)))
83	82	3impib 1117	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧) → ∀𝑘 ∈ 𝑍 ((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧))
84	83	imim1i 63	. . . . . . . . . . . 12 ⊢ ((∀𝑘 ∈ 𝑍 ((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦) → ((𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦))
85	84	3expd 1354	. . . . . . . . . . 11 ⊢ ((∀𝑘 ∈ 𝑍 ((abs‘(𝐹‘𝑘)) < 𝑤 ∨ (abs‘(𝐹‘𝑘)) < 𝑧) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦) → (𝑗 ∈ 𝑍 → (∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤 → (∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧 → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦))))
86	58, 85	syl6 35	. . . . . . . . . 10 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) ∈ ℝ → (𝑗 ∈ 𝑍 → (∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤 → (∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧 → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦)))))
87	86	com23 86	. . . . . . . . 9 ⊢ ((𝑤 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (𝑗 ∈ 𝑍 → (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) ∈ ℝ → (∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤 → (∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧 → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦)))))
88	87	expimpd 453	. . . . . . . 8 ⊢ (𝑤 ∈ ℝ → ((𝑧 ∈ ℝ ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) ∈ ℝ → (∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤 → (∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧 → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦)))))
89	88	com3r 87	. . . . . . 7 ⊢ (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) ∈ ℝ → (𝑤 ∈ ℝ → ((𝑧 ∈ ℝ ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤 → (∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧 → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦)))))
90	89	com34 91	. . . . . 6 ⊢ (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) ∈ ℝ → (𝑤 ∈ ℝ → (∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤 → ((𝑧 ∈ ℝ ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧 → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦)))))
91	90	rexlimdv 3153	. . . . 5 ⊢ (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) ∈ ℝ → (∃𝑤 ∈ ℝ ∀𝑘 ∈ (𝑀...𝑗)(abs‘(𝐹‘𝑘)) < 𝑤 → ((𝑧 ∈ ℝ ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧 → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦))))
92	33, 91	mpd 15	. . . 4 ⊢ (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) ∈ ℝ → ((𝑧 ∈ ℝ ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧 → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦)))
93	92	rexlimdvv 3212	. . 3 ⊢ (∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) ∈ ℝ → (∃𝑧 ∈ ℝ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑧 → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦))
94	2, 8, 93	sylsyld 61	. 2 ⊢ (∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℂ → (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥 → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦))
95	94	imp 406	1 ⊢ ((∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (abs‘(𝐹‘𝑘)) < 𝑦)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 848 ∧ w3a 1087 ∀wal 1538 = wceq 1540 ∈ wcel 2108 ∀wral 3061 ∃wrex 3070 ⊆ wss 3951 ifcif 4525 class class class wbr 5143 ‘cfv 6561 (class class class)co 7431 Fincfn 8985 ℂcc 11153 ℝcr 11154 1c1 11156 + caddc 11158 < clt 11295 ≤ cle 11296 − cmin 11492 ℤcz 12613 ℤ_≥cuz 12878 ℝ⁺crp 13034 ...cfz 13547 abscabs 15273

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232 ax-pre-sup 11233

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8014 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-1o 8506 df-er 8745 df-en 8986 df-dom 8987 df-sdom 8988 df-fin 8989 df-sup 9482 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-div 11921 df-nn 12267 df-2 12329 df-3 12330 df-n0 12527 df-z 12614 df-uz 12879 df-rp 13035 df-fz 13548 df-seq 14043 df-exp 14103 df-cj 15138 df-re 15139 df-im 15140 df-sqrt 15274 df-abs 15275

This theorem is referenced by: climbdd 15708

W3C validator