Theorem climinf2lem 44720

Description: A convergent, nonincreasing sequence, converges to the infimum of its range. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
climinf2lem.1	⊢ 𝑍 = (ℤ≥‘𝑀)
climinf2lem.2	⊢ (𝜑 → 𝑀 ∈ ℤ)
climinf2lem.3	⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
climinf2lem.4	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘(𝑘 + 1)) ≤ (𝐹‘𝑘))
climinf2lem.5	⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘))

Assertion

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

Distinct variable groups:   𝑘,𝐹,𝑥   𝑘,𝑍,𝑥   𝜑,𝑘,𝑥

Allowed substitution hints:   𝑀(𝑥,𝑘)

Proof of Theorem climinf2lem

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		climinf2lem.1	. . 3 ⊢ 𝑍 = (ℤ≥‘𝑀)
2		climinf2lem.2	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ)
3		climinf2lem.3	. . 3 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
4		climinf2lem.4	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘(𝑘 + 1)) ≤ (𝐹‘𝑘))
5		climinf2lem.5	. . 3 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘))
6	1, 2, 3, 4, 5	climinf 44620	. 2 ⊢ (𝜑 → 𝐹 ⇝ inf(ran 𝐹, ℝ, < ))
7	3	frnd 6724	. . 3 ⊢ (𝜑 → ran 𝐹 ⊆ ℝ)
8	3	ffnd 6717	. . . . 5 ⊢ (𝜑 → 𝐹 Fn 𝑍)
9	2, 1	uzidd2 44424	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ 𝑍)
10		fnfvelrn 7081	. . . . 5 ⊢ ((𝐹 Fn 𝑍 ∧ 𝑀 ∈ 𝑍) → (𝐹‘𝑀) ∈ ran 𝐹)
11	8, 9, 10	syl2anc 582	. . . 4 ⊢ (𝜑 → (𝐹‘𝑀) ∈ ran 𝐹)
12	11	ne0d 4334	. . 3 ⊢ (𝜑 → ran 𝐹 ≠ ∅)
13		simpr 483	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ ran 𝐹) → 𝑦 ∈ ran 𝐹)
14		fvelrnb 6951	. . . . . . . . . . . . 13 ⊢ (𝐹 Fn 𝑍 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑘 ∈ 𝑍 (𝐹‘𝑘) = 𝑦))
15	8, 14	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑘 ∈ 𝑍 (𝐹‘𝑘) = 𝑦))
16	15	adantr 479	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ ran 𝐹) → (𝑦 ∈ ran 𝐹 ↔ ∃𝑘 ∈ 𝑍 (𝐹‘𝑘) = 𝑦))
17	13, 16	mpbid 231	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ ran 𝐹) → ∃𝑘 ∈ 𝑍 (𝐹‘𝑘) = 𝑦)
18	17	adantlr 711	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘)) ∧ 𝑦 ∈ ran 𝐹) → ∃𝑘 ∈ 𝑍 (𝐹‘𝑘) = 𝑦)
19		nfv 1915	. . . . . . . . . . . 12 ⊢ Ⅎ𝑘𝜑
20		nfra1 3279	. . . . . . . . . . . 12 ⊢ Ⅎ𝑘∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘)
21	19, 20	nfan 1900	. . . . . . . . . . 11 ⊢ Ⅎ𝑘(𝜑 ∧ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘))
22		nfv 1915	. . . . . . . . . . 11 ⊢ Ⅎ𝑘 𝑥 ≤ 𝑦
23		rspa 3243	. . . . . . . . . . . . . 14 ⊢ ((∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘) ∧ 𝑘 ∈ 𝑍) → 𝑥 ≤ (𝐹‘𝑘))
24		simpl 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ≤ (𝐹‘𝑘) ∧ (𝐹‘𝑘) = 𝑦) → 𝑥 ≤ (𝐹‘𝑘))
25		simpr 483	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ≤ (𝐹‘𝑘) ∧ (𝐹‘𝑘) = 𝑦) → (𝐹‘𝑘) = 𝑦)
26	24, 25	breqtrd 5173	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ≤ (𝐹‘𝑘) ∧ (𝐹‘𝑘) = 𝑦) → 𝑥 ≤ 𝑦)
27	26	ex 411	. . . . . . . . . . . . . 14 ⊢ (𝑥 ≤ (𝐹‘𝑘) → ((𝐹‘𝑘) = 𝑦 → 𝑥 ≤ 𝑦))
28	23, 27	syl 17	. . . . . . . . . . . . 13 ⊢ ((∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘) ∧ 𝑘 ∈ 𝑍) → ((𝐹‘𝑘) = 𝑦 → 𝑥 ≤ 𝑦))
29	28	ex 411	. . . . . . . . . . . 12 ⊢ (∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘) → (𝑘 ∈ 𝑍 → ((𝐹‘𝑘) = 𝑦 → 𝑥 ≤ 𝑦)))
30	29	adantl 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘)) → (𝑘 ∈ 𝑍 → ((𝐹‘𝑘) = 𝑦 → 𝑥 ≤ 𝑦)))
31	21, 22, 30	rexlimd 3261	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘)) → (∃𝑘 ∈ 𝑍 (𝐹‘𝑘) = 𝑦 → 𝑥 ≤ 𝑦))
32	31	adantr 479	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘)) ∧ 𝑦 ∈ ran 𝐹) → (∃𝑘 ∈ 𝑍 (𝐹‘𝑘) = 𝑦 → 𝑥 ≤ 𝑦))
33	18, 32	mpd 15	. . . . . . . 8 ⊢ (((𝜑 ∧ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘)) ∧ 𝑦 ∈ ran 𝐹) → 𝑥 ≤ 𝑦)
34	33	ralrimiva 3144	. . . . . . 7 ⊢ ((𝜑 ∧ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘)) → ∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦)
35	34	adantlr 711	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘)) → ∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦)
36	35	ex 411	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘) → ∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦))
37	36	reximdva 3166	. . . 4 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑘) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦))
38	5, 37	mpd 15	. . 3 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦)
39		infxrre 13319	. . 3 ⊢ ((ran 𝐹 ⊆ ℝ ∧ ran 𝐹 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran 𝐹 𝑥 ≤ 𝑦) → inf(ran 𝐹, ℝ*, < ) = inf(ran 𝐹, ℝ, < ))
40	7, 12, 38, 39	syl3anc 1369	. 2 ⊢ (𝜑 → inf(ran 𝐹, ℝ*, < ) = inf(ran 𝐹, ℝ, < ))
41	6, 40	breqtrrd 5175	1 ⊢ (𝜑 → 𝐹 ⇝ inf(ran 𝐹, ℝ*, < ))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1539   ∈ wcel 2104   ≠ wne 2938  ∀wral 3059  ∃wrex 3068   ⊆ wss 3947  ∅c0 4321   class class class wbr 5147  ran crn 5676   Fn wfn 6537  ⟶wf 6538  ‘cfv 6542  (class class class)co 7411  infcinf 9438  ℝcr 11111  1c1 11113   + caddc 11115  ℝ^*cxr 11251   < clt 11252   ≤ cle 11253  ℤcz 12562  ℤ_≥cuz 12826   ⇝ cli 15432

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 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7727  ax-cnex 11168  ax-resscn 11169  ax-1cn 11170  ax-icn 11171  ax-addcl 11172  ax-addrcl 11173  ax-mulcl 11174  ax-mulrcl 11175  ax-mulcom 11176  ax-addass 11177  ax-mulass 11178  ax-distr 11179  ax-i2m1 11180  ax-1ne0 11181  ax-1rid 11182  ax-rnegex 11183  ax-rrecex 11184  ax-cnre 11185  ax-pre-lttri 11186  ax-pre-lttrn 11187  ax-pre-ltadd 11188  ax-pre-mulgt0 11189  ax-pre-sup 11190

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3374  df-reu 3375  df-rab 3431  df-v 3474  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 6299  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-riota 7367  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7858  df-1st 7977  df-2nd 7978  df-frecs 8268  df-wrecs 8299  df-recs 8373  df-rdg 8412  df-er 8705  df-en 8942  df-dom 8943  df-sdom 8944  df-sup 9439  df-inf 9440  df-pnf 11254  df-mnf 11255  df-xr 11256  df-ltxr 11257  df-le 11258  df-sub 11450  df-neg 11451  df-div 11876  df-nn 12217  df-2 12279  df-3 12280  df-n0 12477  df-z 12563  df-uz 12827  df-rp 12979  df-fz 13489  df-seq 13971  df-exp 14032  df-cj 15050  df-re 15051  df-im 15052  df-sqrt 15186  df-abs 15187  df-clim 15436

This theorem is referenced by:  climinf2  44721