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 45715

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 45708	. 2 ⊢ lim inf = (𝑥 ∈ V ↦ sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^*, < ))
2		imaeq1 6075	. . . . . . . 8 ⊢ (𝑥 = 𝐹 → (𝑥 “ (𝑘[,)+∞)) = (𝐹 “ (𝑘[,)+∞)))
3	2	ineq1d 4227	. . . . . . 7 ⊢ (𝑥 = 𝐹 → ((𝑥 “ (𝑘[,)+∞)) ∩ ℝ^) = ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ^))
4	3	infeq1d 9515	. . . . . 6 ⊢ (𝑥 = 𝐹 → inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < ) = inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < ))
5	4	mpteq2dv 5250	. . . . 5 ⊢ (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < )) = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < )))
6		liminfval.1	. . . . . 6 ⊢ 𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < ))
7	6	a1i 11	. . . . 5 ⊢ (𝑥 = 𝐹 → 𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < )))
8	5, 7	eqtr4d 2778	. . . 4 ⊢ (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < )) = 𝐺)
9	8	rneqd 5952	. . 3 ⊢ (𝑥 = 𝐹 → ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < )) = ran 𝐺)
10	9	supeq1d 9484	. 2 ⊢ (𝑥 = 𝐹 → sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^, < ) = sup(ran 𝐺, ℝ^, < ))
11		elex 3499	. 2 ⊢ (𝐹 ∈ 𝑉 → 𝐹 ∈ V)
12		xrltso 13180	. . . 4 ⊢ < Or ℝ^*
13	12	supex 9501	. . 3 ⊢ sup(ran 𝐺, ℝ^*, < ) ∈ V
14	13	a1i 11	. 2 ⊢ (𝐹 ∈ 𝑉 → sup(ran 𝐺, ℝ^*, < ) ∈ V)
15	1, 10, 11, 14	fvmptd3 7039	1 ⊢ (𝐹 ∈ 𝑉 → (lim inf‘𝐹) = sup(ran 𝐺, ℝ^*, < ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2106 Vcvv 3478 ∩ cin 3962 ↦ cmpt 5231 ran crn 5690 “ cima 5692 ‘cfv 6563 (class class class)co 7431 supcsup 9478 infcinf 9479 ℝcr 11152 +∞cpnf 11290 ℝ^*cxr 11292 < clt 11293 [,)cico 13386 lim infclsi 45707

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-pre-lttri 11227 ax-pre-lttrn 11228

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-po 5597 df-so 5598 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-sup 9480 df-inf 9481 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-liminf 45708

This theorem is referenced by: liminfcl 45719 liminfvald 45720 liminfval5 45721 liminfresxr 45723 liminfval2 45724 liminfvalxr 45739

W3C validator