climinf - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > climinf		Structured version Visualization version GIF version

Theorem climinf 44308

Description: A bounded monotonic nonincreasing sequence converges to the infimum of its range. (Contributed by Glauco Siliprandi, 29-Jun-2017.) (Revised by AV, 15-Sep-2020.)

**Hypotheses**
Ref	Expression
climinf.3	⊢ 𝑍 = (ℤ_≥‘𝑀)
climinf.4	⊢ (𝜑 → 𝑀 ∈ ℤ)
climinf.5	⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
climinf.6	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘(𝑘 + 1)) ≤ (𝐹‘𝑘))
climinf.7	⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘))

**Assertion**
Ref	Expression
climinf	⊢ (𝜑 → 𝐹 ⇝ inf(ran 𝐹, ℝ, < ))

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

Proof of Theorem climinf Dummy variables 𝑗 𝑛 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		climinf.5	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
2	1	frnd 6722	. . . . . . . . . . 11 ⊢ (𝜑 → ran 𝐹 ⊆ ℝ)
3	1	ffnd 6715	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐹 Fn 𝑍)
4		climinf.4	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑀 ∈ ℤ)
5		uzid 12833	. . . . . . . . . . . . . . 15 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ_≥‘𝑀))
6	4, 5	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘𝑀))
7		climinf.3	. . . . . . . . . . . . . 14 ⊢ 𝑍 = (ℤ_≥‘𝑀)
8	6, 7	eleqtrrdi 2844	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑀 ∈ 𝑍)
9		fnfvelrn 7079	. . . . . . . . . . . . 13 ⊢ ((𝐹 Fn 𝑍 ∧ 𝑀 ∈ 𝑍) → (𝐹‘𝑀) ∈ ran 𝐹)
10	3, 8, 9	syl2anc 584	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐹‘𝑀) ∈ ran 𝐹)
11	10	ne0d 4334	. . . . . . . . . . 11 ⊢ (𝜑 → ran 𝐹 ≠ ∅)
12		climinf.7	. . . . . . . . . . . 12 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘))
13		breq2 5151	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = (𝐹‘𝑘) → (𝑥 ≤ 𝑦 ↔ 𝑥 ≤ (𝐹‘𝑘)))
14	13	ralrn 7086	. . . . . . . . . . . . . 14 ⊢ (𝐹 Fn 𝑍 → (∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦 ↔ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘)))
15	14	rexbidv 3178	. . . . . . . . . . . . 13 ⊢ (𝐹 Fn 𝑍 → (∃𝑥 ∈ ℝ ∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦 ↔ ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘)))
16	3, 15	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦 ↔ ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘)))
17	12, 16	mpbird 256	. . . . . . . . . . 11 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦)
18	2, 11, 17	3jca 1128	. . . . . . . . . 10 ⊢ (𝜑 → (ran 𝐹 ⊆ ℝ ∧ ran 𝐹 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦))
19	18	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → (ran 𝐹 ⊆ ℝ ∧ ran 𝐹 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦))
20		infrecl 12192	. . . . . . . . 9 ⊢ ((ran 𝐹 ⊆ ℝ ∧ ran 𝐹 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦) → inf(ran 𝐹, ℝ, < ) ∈ ℝ)
21	19, 20	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → inf(ran 𝐹, ℝ, < ) ∈ ℝ)
22		simpr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → 𝑦 ∈ ℝ⁺)
23	21, 22	ltaddrpd 13045	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → inf(ran 𝐹, ℝ, < ) < (inf(ran 𝐹, ℝ, < ) + 𝑦))
24		rpre 12978	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℝ⁺ → 𝑦 ∈ ℝ)
25	24	adantl 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → 𝑦 ∈ ℝ)
26	21, 25	readdcld 11239	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → (inf(ran 𝐹, ℝ, < ) + 𝑦) ∈ ℝ)
27		infrglb 44292	. . . . . . . 8 ⊢ (((ran 𝐹 ⊆ ℝ ∧ ran 𝐹 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦) ∧ (inf(ran 𝐹, ℝ, < ) + 𝑦) ∈ ℝ) → (inf(ran 𝐹, ℝ, < ) < (inf(ran 𝐹, ℝ, < ) + 𝑦) ↔ ∃𝑘 ∈ ran 𝐹 𝑘 < (inf(ran 𝐹, ℝ, < ) + 𝑦)))
28	19, 26, 27	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → (inf(ran 𝐹, ℝ, < ) < (inf(ran 𝐹, ℝ, < ) + 𝑦) ↔ ∃𝑘 ∈ ran 𝐹 𝑘 < (inf(ran 𝐹, ℝ, < ) + 𝑦)))
29	23, 28	mpbid 231	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → ∃𝑘 ∈ ran 𝐹 𝑘 < (inf(ran 𝐹, ℝ, < ) + 𝑦))
30	2	sselda 3981	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ran 𝐹) → 𝑘 ∈ ℝ)
31	30	adantlr 713	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ 𝑘 ∈ ran 𝐹) → 𝑘 ∈ ℝ)
32	21	adantr 481	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ 𝑘 ∈ ran 𝐹) → inf(ran 𝐹, ℝ, < ) ∈ ℝ)
33	24	ad2antlr 725	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ 𝑘 ∈ ran 𝐹) → 𝑦 ∈ ℝ)
34	32, 33	readdcld 11239	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ 𝑘 ∈ ran 𝐹) → (inf(ran 𝐹, ℝ, < ) + 𝑦) ∈ ℝ)
35	31, 34, 33	ltsub1d 11819	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ 𝑘 ∈ ran 𝐹) → (𝑘 < (inf(ran 𝐹, ℝ, < ) + 𝑦) ↔ (𝑘 − 𝑦) < ((inf(ran 𝐹, ℝ, < ) + 𝑦) − 𝑦)))
36	2, 11, 17, 20	syl3anc 1371	. . . . . . . . . . . . 13 ⊢ (𝜑 → inf(ran 𝐹, ℝ, < ) ∈ ℝ)
37	36	recnd 11238	. . . . . . . . . . . 12 ⊢ (𝜑 → inf(ran 𝐹, ℝ, < ) ∈ ℂ)
38	37	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ 𝑘 ∈ ran 𝐹) → inf(ran 𝐹, ℝ, < ) ∈ ℂ)
39	33	recnd 11238	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ 𝑘 ∈ ran 𝐹) → 𝑦 ∈ ℂ)
40	38, 39	pncand 11568	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ 𝑘 ∈ ran 𝐹) → ((inf(ran 𝐹, ℝ, < ) + 𝑦) − 𝑦) = inf(ran 𝐹, ℝ, < ))
41	40	breq2d 5159	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ 𝑘 ∈ ran 𝐹) → ((𝑘 − 𝑦) < ((inf(ran 𝐹, ℝ, < ) + 𝑦) − 𝑦) ↔ (𝑘 − 𝑦) < inf(ran 𝐹, ℝ, < )))
42	35, 41	bitrd 278	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ 𝑘 ∈ ran 𝐹) → (𝑘 < (inf(ran 𝐹, ℝ, < ) + 𝑦) ↔ (𝑘 − 𝑦) < inf(ran 𝐹, ℝ, < )))
43	42	biimpd 228	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ 𝑘 ∈ ran 𝐹) → (𝑘 < (inf(ran 𝐹, ℝ, < ) + 𝑦) → (𝑘 − 𝑦) < inf(ran 𝐹, ℝ, < )))
44	43	reximdva 3168	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → (∃𝑘 ∈ ran 𝐹 𝑘 < (inf(ran 𝐹, ℝ, < ) + 𝑦) → ∃𝑘 ∈ ran 𝐹(𝑘 − 𝑦) < inf(ran 𝐹, ℝ, < )))
45	29, 44	mpd 15	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → ∃𝑘 ∈ ran 𝐹(𝑘 − 𝑦) < inf(ran 𝐹, ℝ, < ))
46		oveq1 7412	. . . . . . . . 9 ⊢ (𝑘 = (𝐹‘𝑗) → (𝑘 − 𝑦) = ((𝐹‘𝑗) − 𝑦))
47	46	breq1d 5157	. . . . . . . 8 ⊢ (𝑘 = (𝐹‘𝑗) → ((𝑘 − 𝑦) < inf(ran 𝐹, ℝ, < ) ↔ ((𝐹‘𝑗) − 𝑦) < inf(ran 𝐹, ℝ, < )))
48	47	rexrn 7085	. . . . . . 7 ⊢ (𝐹 Fn 𝑍 → (∃𝑘 ∈ ran 𝐹(𝑘 − 𝑦) < inf(ran 𝐹, ℝ, < ) ↔ ∃𝑗 ∈ 𝑍 ((𝐹‘𝑗) − 𝑦) < inf(ran 𝐹, ℝ, < )))
49	3, 48	syl 17	. . . . . 6 ⊢ (𝜑 → (∃𝑘 ∈ ran 𝐹(𝑘 − 𝑦) < inf(ran 𝐹, ℝ, < ) ↔ ∃𝑗 ∈ 𝑍 ((𝐹‘𝑗) − 𝑦) < inf(ran 𝐹, ℝ, < )))
50	49	biimpa 477	. . . . 5 ⊢ ((𝜑 ∧ ∃𝑘 ∈ ran 𝐹(𝑘 − 𝑦) < inf(ran 𝐹, ℝ, < )) → ∃𝑗 ∈ 𝑍 ((𝐹‘𝑗) − 𝑦) < inf(ran 𝐹, ℝ, < ))
51	45, 50	syldan 591	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → ∃𝑗 ∈ 𝑍 ((𝐹‘𝑗) − 𝑦) < inf(ran 𝐹, ℝ, < ))
52	1	adantr 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → 𝐹:𝑍⟶ℝ)
53	7	uztrn2 12837	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
54		ffvelcdm 7080	. . . . . . . . . . 11 ⊢ ((𝐹:𝑍⟶ℝ ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ)
55	52, 53, 54	syl2an 596	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑘) ∈ ℝ)
56		simpl 483	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑗 ∈ 𝑍)
57		ffvelcdm 7080	. . . . . . . . . . 11 ⊢ ((𝐹:𝑍⟶ℝ ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ ℝ)
58	52, 56, 57	syl2an 596	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑗) ∈ ℝ)
59	36	ad2antrr 724	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → inf(ran 𝐹, ℝ, < ) ∈ ℝ)
60		simprr 771	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝑘 ∈ (ℤ_≥‘𝑗))
61		fzssuz 13538	. . . . . . . . . . . . . 14 ⊢ (𝑗...𝑘) ⊆ (ℤ_≥‘𝑗)
62		uzss 12841	. . . . . . . . . . . . . . . . 17 ⊢ (𝑗 ∈ (ℤ_≥‘𝑀) → (ℤ_≥‘𝑗) ⊆ (ℤ_≥‘𝑀))
63	62, 7	sseqtrrdi 4032	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 ∈ (ℤ_≥‘𝑀) → (ℤ_≥‘𝑗) ⊆ 𝑍)
64	63, 7	eleq2s 2851	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ 𝑍 → (ℤ_≥‘𝑗) ⊆ 𝑍)
65	64	ad2antrl 726	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (ℤ_≥‘𝑗) ⊆ 𝑍)
66	61, 65	sstrid 3992	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝑗...𝑘) ⊆ 𝑍)
67		ffvelcdm 7080	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹:𝑍⟶ℝ ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛) ∈ ℝ)
68	67	ralrimiva 3146	. . . . . . . . . . . . . . 15 ⊢ (𝐹:𝑍⟶ℝ → ∀𝑛 ∈ 𝑍 (𝐹‘𝑛) ∈ ℝ)
69	1, 68	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑛 ∈ 𝑍 (𝐹‘𝑛) ∈ ℝ)
70	69	ad2antrr 724	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ∀𝑛 ∈ 𝑍 (𝐹‘𝑛) ∈ ℝ)
71		ssralv 4049	. . . . . . . . . . . . 13 ⊢ ((𝑗...𝑘) ⊆ 𝑍 → (∀𝑛 ∈ 𝑍 (𝐹‘𝑛) ∈ ℝ → ∀𝑛 ∈ (𝑗...𝑘)(𝐹‘𝑛) ∈ ℝ))
72	66, 70, 71	sylc 65	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ∀𝑛 ∈ (𝑗...𝑘)(𝐹‘𝑛) ∈ ℝ)
73	72	r19.21bi 3248	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) ∧ 𝑛 ∈ (𝑗...𝑘)) → (𝐹‘𝑛) ∈ ℝ)
74		fzssuz 13538	. . . . . . . . . . . . . 14 ⊢ (𝑗...(𝑘 − 1)) ⊆ (ℤ_≥‘𝑗)
75	74, 65	sstrid 3992	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝑗...(𝑘 − 1)) ⊆ 𝑍)
76	75	sselda 3981	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) ∧ 𝑛 ∈ (𝑗...(𝑘 − 1))) → 𝑛 ∈ 𝑍)
77		climinf.6	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘(𝑘 + 1)) ≤ (𝐹‘𝑘))
78	77	ralrimiva 3146	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑘 ∈ 𝑍 (𝐹‘(𝑘 + 1)) ≤ (𝐹‘𝑘))
79	78	ad2antrr 724	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ∀𝑘 ∈ 𝑍 (𝐹‘(𝑘 + 1)) ≤ (𝐹‘𝑘))
80		fvoveq1 7428	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑛 → (𝐹‘(𝑘 + 1)) = (𝐹‘(𝑛 + 1)))
81		fveq2 6888	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑛 → (𝐹‘𝑘) = (𝐹‘𝑛))
82	80, 81	breq12d 5160	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑛 → ((𝐹‘(𝑘 + 1)) ≤ (𝐹‘𝑘) ↔ (𝐹‘(𝑛 + 1)) ≤ (𝐹‘𝑛)))
83	82	rspccva 3611	. . . . . . . . . . . . 13 ⊢ ((∀𝑘 ∈ 𝑍 (𝐹‘(𝑘 + 1)) ≤ (𝐹‘𝑘) ∧ 𝑛 ∈ 𝑍) → (𝐹‘(𝑛 + 1)) ≤ (𝐹‘𝑛))
84	79, 83	sylan 580	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) ∧ 𝑛 ∈ 𝑍) → (𝐹‘(𝑛 + 1)) ≤ (𝐹‘𝑛))
85	76, 84	syldan 591	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) ∧ 𝑛 ∈ (𝑗...(𝑘 − 1))) → (𝐹‘(𝑛 + 1)) ≤ (𝐹‘𝑛))
86	60, 73, 85	monoord2 13995	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑘) ≤ (𝐹‘𝑗))
87	55, 58, 59, 86	lesub1dd 11826	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < )) ≤ ((𝐹‘𝑗) − inf(ran 𝐹, ℝ, < )))
88	55, 59	resubcld 11638	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < )) ∈ ℝ)
89	58, 59	resubcld 11638	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((𝐹‘𝑗) − inf(ran 𝐹, ℝ, < )) ∈ ℝ)
90	24	ad2antlr 725	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝑦 ∈ ℝ)
91		lelttr 11300	. . . . . . . . . 10 ⊢ ((((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < )) ∈ ℝ ∧ ((𝐹‘𝑗) − inf(ran 𝐹, ℝ, < )) ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < )) ≤ ((𝐹‘𝑗) − inf(ran 𝐹, ℝ, < )) ∧ ((𝐹‘𝑗) − inf(ran 𝐹, ℝ, < )) < 𝑦) → ((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < )) < 𝑦))
92	88, 89, 90, 91	syl3anc 1371	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < )) ≤ ((𝐹‘𝑗) − inf(ran 𝐹, ℝ, < )) ∧ ((𝐹‘𝑗) − inf(ran 𝐹, ℝ, < )) < 𝑦) → ((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < )) < 𝑦))
93	87, 92	mpand 693	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (((𝐹‘𝑗) − inf(ran 𝐹, ℝ, < )) < 𝑦 → ((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < )) < 𝑦))
94		ltsub23 11690	. . . . . . . . 9 ⊢ (((𝐹‘𝑗) ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ inf(ran 𝐹, ℝ, < ) ∈ ℝ) → (((𝐹‘𝑗) − 𝑦) < inf(ran 𝐹, ℝ, < ) ↔ ((𝐹‘𝑗) − inf(ran 𝐹, ℝ, < )) < 𝑦))
95	58, 90, 59, 94	syl3anc 1371	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (((𝐹‘𝑗) − 𝑦) < inf(ran 𝐹, ℝ, < ) ↔ ((𝐹‘𝑗) − inf(ran 𝐹, ℝ, < )) < 𝑦))
96	2	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ran 𝐹 ⊆ ℝ)
97	3	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → 𝐹 Fn 𝑍)
98		fnfvelrn 7079	. . . . . . . . . . . 12 ⊢ ((𝐹 Fn 𝑍 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ran 𝐹)
99	97, 53, 98	syl2an 596	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑘) ∈ ran 𝐹)
100	96, 99	sseldd 3982	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑘) ∈ ℝ)
101	17	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦)
102		infrelb 12195	. . . . . . . . . . 11 ⊢ ((ran 𝐹 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦 ∧ (𝐹‘𝑘) ∈ ran 𝐹) → inf(ran 𝐹, ℝ, < ) ≤ (𝐹‘𝑘))
103	96, 101, 99, 102	syl3anc 1371	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → inf(ran 𝐹, ℝ, < ) ≤ (𝐹‘𝑘))
104	59, 100, 103	abssubge0d 15374	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (abs‘((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < ))) = ((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < )))
105	104	breq1d 5157	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((abs‘((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < ))) < 𝑦 ↔ ((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < )) < 𝑦))
106	93, 95, 105	3imtr4d 293	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (((𝐹‘𝑗) − 𝑦) < inf(ran 𝐹, ℝ, < ) → (abs‘((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < ))) < 𝑦))
107	106	anassrs 468	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (((𝐹‘𝑗) − 𝑦) < inf(ran 𝐹, ℝ, < ) → (abs‘((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < ))) < 𝑦))
108	107	ralrimdva 3154	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) → (((𝐹‘𝑗) − 𝑦) < inf(ran 𝐹, ℝ, < ) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < ))) < 𝑦))
109	108	reximdva 3168	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → (∃𝑗 ∈ 𝑍 ((𝐹‘𝑗) − 𝑦) < inf(ran 𝐹, ℝ, < ) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < ))) < 𝑦))
110	51, 109	mpd 15	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < ))) < 𝑦)
111	110	ralrimiva 3146	. 2 ⊢ (𝜑 → ∀𝑦 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < ))) < 𝑦)
112	7	fvexi 6902	. . . 4 ⊢ 𝑍 ∈ V
113		fex 7224	. . . 4 ⊢ ((𝐹:𝑍⟶ℝ ∧ 𝑍 ∈ V) → 𝐹 ∈ V)
114	1, 112, 113	sylancl 586	. . 3 ⊢ (𝜑 → 𝐹 ∈ V)
115		eqidd 2733	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = (𝐹‘𝑘))
116	1	ffvelcdmda 7083	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ)
117	116	recnd 11238	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ)
118	7, 4, 114, 115, 37, 117	clim2c 15445	. 2 ⊢ (𝜑 → (𝐹 ⇝ inf(ran 𝐹, ℝ, < ) ↔ ∀𝑦 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − inf(ran 𝐹, ℝ, < ))) < 𝑦))
119	111, 118	mpbird 256	1 ⊢ (𝜑 → 𝐹 ⇝ inf(ran 𝐹, ℝ, < ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∀wral 3061 ∃wrex 3070 Vcvv 3474 ⊆ wss 3947 ∅c0 4321 class class class wbr 5147 ran crn 5676 Fn wfn 6535 ⟶wf 6536 ‘cfv 6540 (class class class)co 7405 infcinf 9432 ℂcc 11104 ℝcr 11105 1c1 11107 + caddc 11109 < clt 11244 ≤ cle 11245 − cmin 11440 ℤcz 12554 ℤ_≥cuz 12818 ℝ⁺crp 12970 ...cfz 13480 abscabs 15177 ⇝ cli 15424

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-sup 9433 df-inf 9434 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-div 11868 df-nn 12209 df-2 12271 df-3 12272 df-n0 12469 df-z 12555 df-uz 12819 df-rp 12971 df-fz 13481 df-seq 13963 df-exp 14024 df-cj 15042 df-re 15043 df-im 15044 df-sqrt 15178 df-abs 15179 df-clim 15428

This theorem is referenced by: climinff 44313 climinf2lem 44408 supcnvlimsup 44442 stirlinglem13 44788

W3C validator