liminflelimsuplem - Mathbox for Glauco Siliprandi

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

Theorem liminflelimsuplem 45730

Description: The superior limit is greater than or equal to the inferior limit. (Contributed by Glauco Siliprandi, 2-Jan-2022.)

**Hypotheses**
Ref	Expression
liminflelimsuplem.1	⊢ (𝜑 → 𝐹 ∈ 𝑉)
liminflelimsuplem.2	⊢ (𝜑 → ∀𝑘 ∈ ℝ ∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^*) ≠ ∅)

**Assertion**
Ref	Expression
liminflelimsuplem	⊢ (𝜑 → (lim inf‘𝐹) ≤ (lim sup‘𝐹))

Distinct variable groups: 𝑗,𝐹,𝑘 𝜑,𝑗 Allowed substitution hints: 𝜑(𝑘) 𝑉(𝑗,𝑘)

Proof of Theorem liminflelimsuplem Dummy variables 𝑖 𝑙 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 484	. . . . . . . . . . . 12 ⊢ ((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) → 𝑙 ∈ ℝ)
2		simpl 482	. . . . . . . . . . . 12 ⊢ ((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) → 𝑖 ∈ ℝ)
3	1, 2	ifcld 4576	. . . . . . . . . . 11 ⊢ ((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) → if(𝑖 ≤ 𝑙, 𝑙, 𝑖) ∈ ℝ)
4	3	adantll 714	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑖 ∈ ℝ) ∧ 𝑙 ∈ ℝ) → if(𝑖 ≤ 𝑙, 𝑙, 𝑖) ∈ ℝ)
5		liminflelimsuplem.2	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑘 ∈ ℝ ∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^*) ≠ ∅)
6	5	ad2antrr 726	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑖 ∈ ℝ) ∧ 𝑙 ∈ ℝ) → ∀𝑘 ∈ ℝ ∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^*) ≠ ∅)
7		oveq1 7437	. . . . . . . . . . . 12 ⊢ (𝑘 = if(𝑖 ≤ 𝑙, 𝑙, 𝑖) → (𝑘[,)+∞) = (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞))
8	7	rexeqdv 3324	. . . . . . . . . . 11 ⊢ (𝑘 = if(𝑖 ≤ 𝑙, 𝑙, 𝑖) → (∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅ ↔ ∃𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅))
9	8	rspcva 3619	. . . . . . . . . 10 ⊢ ((if(𝑖 ≤ 𝑙, 𝑙, 𝑖) ∈ ℝ ∧ ∀𝑘 ∈ ℝ ∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅) → ∃𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅)
10	4, 6, 9	syl2anc 584	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑖 ∈ ℝ) ∧ 𝑙 ∈ ℝ) → ∃𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^*) ≠ ∅)
11		inss2 4245	. . . . . . . . . . . . . 14 ⊢ ((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^) ⊆ ℝ^
12		infxrcl 13371	. . . . . . . . . . . . . 14 ⊢ (((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^) ⊆ ℝ^ → inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^*)
13	11, 12	ax-mp 5	. . . . . . . . . . . . 13 ⊢ inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^*
14	13	a1i 11	. . . . . . . . . . . 12 ⊢ ((((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) ∧ ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅) → inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^)
15		inss2 4245	. . . . . . . . . . . . . 14 ⊢ ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ⊆ ℝ^
16		infxrcl 13371	. . . . . . . . . . . . . 14 ⊢ (((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ⊆ ℝ^ → inf(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^*)
17	15, 16	ax-mp 5	. . . . . . . . . . . . 13 ⊢ inf(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^*
18	17	a1i 11	. . . . . . . . . . . 12 ⊢ ((((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) ∧ ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅) → inf(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^)
19		inss2 4245	. . . . . . . . . . . . . 14 ⊢ ((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^) ⊆ ℝ^
20		supxrcl 13353	. . . . . . . . . . . . . 14 ⊢ (((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^) ⊆ ℝ^ → sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^*)
21	19, 20	ax-mp 5	. . . . . . . . . . . . 13 ⊢ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^*
22	21	a1i 11	. . . . . . . . . . . 12 ⊢ ((((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) ∧ ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅) → sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^)
23		rexr 11304	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑖 ∈ ℝ → 𝑖 ∈ ℝ^*)
24	23	ad2antrr 726	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → 𝑖 ∈ ℝ^*)
25		pnfxr 11312	. . . . . . . . . . . . . . . . . 18 ⊢ +∞ ∈ ℝ^*
26	25	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → +∞ ∈ ℝ^*)
27	3	rexrd 11308	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) → if(𝑖 ≤ 𝑙, 𝑙, 𝑖) ∈ ℝ^*)
28	27	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → if(𝑖 ≤ 𝑙, 𝑙, 𝑖) ∈ ℝ^*)
29		icossxr 13468	. . . . . . . . . . . . . . . . . . . 20 ⊢ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞) ⊆ ℝ^*
30		id 22	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞) → 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞))
31	29, 30	sselid 3992	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞) → 𝑗 ∈ ℝ^*)
32	31	adantl 481	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → 𝑗 ∈ ℝ^*)
33		max1 13223	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) → 𝑖 ≤ if(𝑖 ≤ 𝑙, 𝑙, 𝑖))
34	33	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → 𝑖 ≤ if(𝑖 ≤ 𝑙, 𝑙, 𝑖))
35		simpr 484	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞))
36	28, 26, 35	icogelbd 45510	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → if(𝑖 ≤ 𝑙, 𝑙, 𝑖) ≤ 𝑗)
37	24, 28, 32, 34, 36	xrletrd 13200	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → 𝑖 ≤ 𝑗)
38	24, 26, 37	icossico2 45516	. . . . . . . . . . . . . . . 16 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → (𝑗[,)+∞) ⊆ (𝑖[,)+∞))
39	38	imass2d 45206	. . . . . . . . . . . . . . 15 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → (𝐹 “ (𝑗[,)+∞)) ⊆ (𝐹 “ (𝑖[,)+∞)))
40	39	ssrind 4251	. . . . . . . . . . . . . 14 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ⊆ ((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^))
41	11	a1i 11	. . . . . . . . . . . . . 14 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → ((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^) ⊆ ℝ^)
42		infxrss 13377	. . . . . . . . . . . . . 14 ⊢ ((((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ⊆ ((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^) ∧ ((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^) ⊆ ℝ^) → inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ inf(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^), ℝ^, < ))
43	40, 41, 42	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ inf(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^), ℝ^, < ))
44	43	adantr 480	. . . . . . . . . . . 12 ⊢ ((((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) ∧ ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅) → inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ inf(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^), ℝ^*, < ))
45		supxrcl 13353	. . . . . . . . . . . . . . 15 ⊢ (((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ⊆ ℝ^ → sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^*)
46	15, 45	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^*
47	46	a1i 11	. . . . . . . . . . . . 13 ⊢ ((((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) ∧ ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅) → sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^)
48	15	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) ∧ ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅) → ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ⊆ ℝ^*)
49		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) ∧ ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅) → ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅)
50	48, 49	infxrlesupxr 45385	. . . . . . . . . . . . 13 ⊢ ((((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) ∧ ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅) → inf(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^), ℝ^*, < ))
51		rexr 11304	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑙 ∈ ℝ → 𝑙 ∈ ℝ^*)
52	51	ad2antlr 727	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → 𝑙 ∈ ℝ^*)
53		max2 13225	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) → 𝑙 ≤ if(𝑖 ≤ 𝑙, 𝑙, 𝑖))
54	53	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → 𝑙 ≤ if(𝑖 ≤ 𝑙, 𝑙, 𝑖))
55	52, 28, 32, 54, 36	xrletrd 13200	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → 𝑙 ≤ 𝑗)
56	52, 26, 55	icossico2 45516	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → (𝑗[,)+∞) ⊆ (𝑙[,)+∞))
57	56	imass2d 45206	. . . . . . . . . . . . . . . 16 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → (𝐹 “ (𝑗[,)+∞)) ⊆ (𝐹 “ (𝑙[,)+∞)))
58	57	ssrind 4251	. . . . . . . . . . . . . . 15 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ⊆ ((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^))
59	19	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → ((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^) ⊆ ℝ^)
60		supxrss 13370	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ⊆ ((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^) ∧ ((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^) ⊆ ℝ^) → sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ))
61	58, 59, 60	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ (((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) → sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ))
62	61	adantr 480	. . . . . . . . . . . . 13 ⊢ ((((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) ∧ ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅) → sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^*, < ))
63	18, 47, 22, 50, 62	xrletrd 13200	. . . . . . . . . . . 12 ⊢ ((((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) ∧ ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅) → inf(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^*, < ))
64	14, 18, 22, 44, 63	xrletrd 13200	. . . . . . . . . . 11 ⊢ ((((𝑖 ∈ ℝ ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) ∧ ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅) → inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^*, < ))
65	64	ad5ant2345 1369	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑖 ∈ ℝ) ∧ 𝑙 ∈ ℝ) ∧ 𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)) ∧ ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅) → inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^*, < ))
66	65	rexlimdva2 3154	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑖 ∈ ℝ) ∧ 𝑙 ∈ ℝ) → (∃𝑗 ∈ (if(𝑖 ≤ 𝑙, 𝑙, 𝑖)[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ^) ≠ ∅ → inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^*, < )))
67	10, 66	mpd 15	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑖 ∈ ℝ) ∧ 𝑙 ∈ ℝ) → inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ))
68	67	ralrimiva 3143	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → ∀𝑙 ∈ ℝ inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ))
69		nfv 1911	. . . . . . . . 9 ⊢ Ⅎ𝑙𝜑
70		xrltso 13179	. . . . . . . . . . 11 ⊢ < Or ℝ^*
71	70	supex 9500	. . . . . . . . . 10 ⊢ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ V
72	71	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑙 ∈ ℝ) → sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ V)
73		breq2 5151	. . . . . . . . 9 ⊢ (𝑦 = sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ) → (inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ 𝑦 ↔ inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < )))
74	69, 72, 73	ralrnmpt3 45203	. . . . . . . 8 ⊢ (𝜑 → (∀𝑦 ∈ ran (𝑙 ∈ ℝ ↦ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ))inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ 𝑦 ↔ ∀𝑙 ∈ ℝ inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < )))
75	74	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → (∀𝑦 ∈ ran (𝑙 ∈ ℝ ↦ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ))inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ 𝑦 ↔ ∀𝑙 ∈ ℝ inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < )))
76	68, 75	mpbird 257	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → ∀𝑦 ∈ ran (𝑙 ∈ ℝ ↦ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ))inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ 𝑦)
77		oveq1 7437	. . . . . . . . . . . . 13 ⊢ (𝑙 = 𝑖 → (𝑙[,)+∞) = (𝑖[,)+∞))
78	77	imaeq2d 6079	. . . . . . . . . . . 12 ⊢ (𝑙 = 𝑖 → (𝐹 “ (𝑙[,)+∞)) = (𝐹 “ (𝑖[,)+∞)))
79	78	ineq1d 4226	. . . . . . . . . . 11 ⊢ (𝑙 = 𝑖 → ((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^) = ((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^))
80	79	supeq1d 9483	. . . . . . . . . 10 ⊢ (𝑙 = 𝑖 → sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ) = sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ))
81	80	cbvmptv 5260	. . . . . . . . 9 ⊢ (𝑙 ∈ ℝ ↦ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < )) = (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ))
82	81	rneqi 5950	. . . . . . . 8 ⊢ ran (𝑙 ∈ ℝ ↦ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < )) = ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ))
83	82	raleqi 3321	. . . . . . 7 ⊢ (∀𝑦 ∈ ran (𝑙 ∈ ℝ ↦ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ))inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ 𝑦 ↔ ∀𝑦 ∈ ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ))inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ 𝑦)
84	83	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → (∀𝑦 ∈ ran (𝑙 ∈ ℝ ↦ sup(((𝐹 “ (𝑙[,)+∞)) ∩ ℝ^), ℝ^, < ))inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ 𝑦 ↔ ∀𝑦 ∈ ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ))inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ 𝑦))
85	76, 84	mpbid 232	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → ∀𝑦 ∈ ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ))inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ 𝑦)
86		supxrcl 13353	. . . . . . . . . 10 ⊢ (((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^) ⊆ ℝ^ → sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^*)
87	11, 86	ax-mp 5	. . . . . . . . 9 ⊢ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^*
88	87	rgenw 3062	. . . . . . . 8 ⊢ ∀𝑖 ∈ ℝ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^*
89		eqid 2734	. . . . . . . . 9 ⊢ (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) = (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ))
90	89	rnmptss 7142	. . . . . . . 8 ⊢ (∀𝑖 ∈ ℝ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^* → ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) ⊆ ℝ^*)
91	88, 90	ax-mp 5	. . . . . . 7 ⊢ ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) ⊆ ℝ^*
92	91	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) ⊆ ℝ^*)
93	13	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^*)
94		infxrgelb 13373	. . . . . 6 ⊢ ((ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) ⊆ ℝ^* ∧ inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ∈ ℝ^) → (inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ inf(ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^, < ) ↔ ∀𝑦 ∈ ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ))inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ 𝑦))
95	92, 93, 94	syl2anc 584	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → (inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ inf(ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^, < ) ↔ ∀𝑦 ∈ ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ))inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^*, < ) ≤ 𝑦))
96	85, 95	mpbird 257	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ inf(ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^*, < ))
97	96	ralrimiva 3143	. . 3 ⊢ (𝜑 → ∀𝑖 ∈ ℝ inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ inf(ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^*, < ))
98		nfv 1911	. . . 4 ⊢ Ⅎ𝑖𝜑
99		nfcv 2902	. . . 4 ⊢ Ⅎ𝑖ℝ
100		nfmpt1 5255	. . . . . 6 ⊢ Ⅎ𝑖(𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ))
101	100	nfrn 5965	. . . . 5 ⊢ Ⅎ𝑖ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ))
102		nfcv 2902	. . . . 5 ⊢ Ⅎ𝑖ℝ^*
103		nfcv 2902	. . . . 5 ⊢ Ⅎ𝑖 <
104	101, 102, 103	nfinf 9519	. . . 4 ⊢ Ⅎ𝑖inf(ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^*, < )
105		infxrcl 13371	. . . . . 6 ⊢ (ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) ⊆ ℝ^* → inf(ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^, < ) ∈ ℝ^)
106	91, 105	ax-mp 5	. . . . 5 ⊢ inf(ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^, < ) ∈ ℝ^
107	106	a1i 11	. . . 4 ⊢ (𝜑 → inf(ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^, < ) ∈ ℝ^)
108	98, 99, 104, 93, 107	supxrleubrnmptf 45400	. . 3 ⊢ (𝜑 → (sup(ran (𝑖 ∈ ℝ ↦ inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^, < ) ≤ inf(ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^, < ) ↔ ∀𝑖 ∈ ℝ inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) ≤ inf(ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^*, < )))
109	97, 108	mpbird 257	. 2 ⊢ (𝜑 → sup(ran (𝑖 ∈ ℝ ↦ inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^, < ) ≤ inf(ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^, < ))
110		liminflelimsuplem.1	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑉)
111		eqid 2734	. . . 4 ⊢ (𝑖 ∈ ℝ ↦ inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) = (𝑖 ∈ ℝ ↦ inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ))
112	110, 111	liminfvald 45719	. . 3 ⊢ (𝜑 → (lim inf‘𝐹) = sup(ran (𝑖 ∈ ℝ ↦ inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^*, < ))
113	110, 89	limsupvald 45710	. . 3 ⊢ (𝜑 → (lim sup‘𝐹) = inf(ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^*, < ))
114	112, 113	breq12d 5160	. 2 ⊢ (𝜑 → ((lim inf‘𝐹) ≤ (lim sup‘𝐹) ↔ sup(ran (𝑖 ∈ ℝ ↦ inf(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^, < ) ≤ inf(ran (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )), ℝ^, < )))
115	109, 114	mpbird 257	1 ⊢ (𝜑 → (lim inf‘𝐹) ≤ (lim sup‘𝐹))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1536 ∈ wcel 2105 ≠ wne 2937 ∀wral 3058 ∃wrex 3067 Vcvv 3477 ∩ cin 3961 ⊆ wss 3962 ∅c0 4338 ifcif 4530 class class class wbr 5147 ↦ cmpt 5230 ran crn 5689 “ cima 5691 ‘cfv 6562 (class class class)co 7430 supcsup 9477 infcinf 9478 ℝcr 11151 +∞cpnf 11289 ℝ^*cxr 11291 < clt 11292 ≤ cle 11293 [,)cico 13385 lim supclsp 15502 lim infclsi 45706

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 ax-cnex 11208 ax-resscn 11209 ax-1cn 11210 ax-icn 11211 ax-addcl 11212 ax-addrcl 11213 ax-mulcl 11214 ax-mulrcl 11215 ax-mulcom 11216 ax-addass 11217 ax-mulass 11218 ax-distr 11219 ax-i2m1 11220 ax-1ne0 11221 ax-1rid 11222 ax-rnegex 11223 ax-rrecex 11224 ax-cnre 11225 ax-pre-lttri 11226 ax-pre-lttrn 11227 ax-pre-ltadd 11228 ax-pre-mulgt0 11229 ax-pre-sup 11230

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3377 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-iun 4997 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5582 df-po 5596 df-so 5597 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-1st 8012 df-2nd 8013 df-er 8743 df-en 8984 df-dom 8985 df-sdom 8986 df-sup 9479 df-inf 9480 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11491 df-neg 11492 df-ico 13389 df-limsup 15503 df-liminf 45707

This theorem is referenced by: liminflelimsup 45731

W3C validator