liminfval - Mathbox for Glauco Siliprandi

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

Theorem liminfval 39991

Description: The inferior limit of a set 𝐹. (Contributed by Glauco Siliprandi, 2-Jan-2022.)

**Hypothesis**
Ref	Expression
liminfval.1	⊢ 𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < ))

**Assertion**
Ref	Expression
liminfval	⊢ (𝐹 ∈ 𝑉 → (lim inf‘𝐹) = sup(ran 𝐺, ℝ^*, < ))

Distinct variable group: 𝑘,𝐹 Allowed substitution hints: 𝐺(𝑘) 𝑉(𝑘)

Proof of Theorem liminfval Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-liminf 39984	. 2 ⊢ lim inf = (𝑥 ∈ V ↦ sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^*, < ))
2		imaeq1 5461	. . . . . . . . 9 ⊢ (𝑥 = 𝐹 → (𝑥 “ (𝑘[,)+∞)) = (𝐹 “ (𝑘[,)+∞)))
3	2	ineq1d 3813	. . . . . . . 8 ⊢ (𝑥 = 𝐹 → ((𝑥 “ (𝑘[,)+∞)) ∩ ℝ^) = ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ^))
4	3	infeq1d 8383	. . . . . . 7 ⊢ (𝑥 = 𝐹 → inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < ) = inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < ))
5	4	mpteq2dv 4745	. . . . . 6 ⊢ (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < )) = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < )))
6		liminfval.1	. . . . . . 7 ⊢ 𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < ))
7	6	a1i 11	. . . . . 6 ⊢ (𝑥 = 𝐹 → 𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < )))
8	5, 7	eqtr4d 2659	. . . . 5 ⊢ (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < )) = 𝐺)
9	8	rneqd 5353	. . . 4 ⊢ (𝑥 = 𝐹 → ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < )) = ran 𝐺)
10	9	supeq1d 8352	. . 3 ⊢ (𝑥 = 𝐹 → sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^, < ) = sup(ran 𝐺, ℝ^, < ))
11	10	adantl 482	. 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑥 = 𝐹) → sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^, < ) = sup(ran 𝐺, ℝ^, < ))
12		elex 3212	. 2 ⊢ (𝐹 ∈ 𝑉 → 𝐹 ∈ V)
13		xrltso 11974	. . . 4 ⊢ < Or ℝ^*
14	13	supex 8369	. . 3 ⊢ sup(ran 𝐺, ℝ^*, < ) ∈ V
15	14	a1i 11	. 2 ⊢ (𝐹 ∈ 𝑉 → sup(ran 𝐺, ℝ^*, < ) ∈ V)
16	1, 11, 12, 15	fvmptd2 39445	1 ⊢ (𝐹 ∈ 𝑉 → (lim inf‘𝐹) = sup(ran 𝐺, ℝ^*, < ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1483 ∈ wcel 1990 Vcvv 3200 ∩ cin 3573 ↦ cmpt 4729 ran crn 5115 “ cima 5117 ‘cfv 5888 (class class class)co 6650 supcsup 8346 infcinf 8347 ℝcr 9935 +∞cpnf 10071 ℝ^*cxr 10073 < clt 10074 [,)cico 12177 lim infclsi 39983

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-pre-lttri 10010 ax-pre-lttrn 10011

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-po 5035 df-so 5036 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-sup 8348 df-inf 8349 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-liminf 39984

This theorem is referenced by: liminfcl 39995 liminfvald 39996 liminfval5 39997 liminfresxr 39999 liminfval2 40000 liminfvalxr 40015

W3C validator