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

Theorem limsupvaluz2 46953
Description: The superior limit, when the domain of a real-valued function is a set of upper integers, and the superior limit is real. (Contributed by Glauco Siliprandi, 23-Oct-2021.)
Hypotheses
Ref Expression
limsupvaluz2.m (𝜑 → 𝑀 ∈ ℤ)
limsupvaluz2.z 𝑍 = (ℤ≥‘𝑀)
limsupvaluz2.f (𝜑 → 𝐹:𝑍⟶ℝ)
limsupvaluz2.r (𝜑 → (lim sup‘𝐹) ∈ ℝ)
Assertion
Ref Expression
limsupvaluz2 (𝜑 → (lim sup‘𝐹) = inf(ran (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑘)), ℝ*, < )), ℝ, < ))
Distinct variable groups:   𝑘,𝐹   𝑘,𝑍
Allowed substitution hints:   𝜑(𝑘)   𝑀(𝑘)

Proof of Theorem limsupvaluz2
Dummy variables 𝑖 𝑗 𝑥 𝑛 𝑚 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 limsupvaluz2.m . . 3 (𝜑 → 𝑀 ∈ ℤ)
2 limsupvaluz2.z . . 3 𝑍 = (ℤ≥‘𝑀)
3 limsupvaluz2.f . . . 4 (𝜑 → 𝐹:𝑍⟶ℝ)
43frexr 46601 . . 3 (𝜑 → 𝐹:𝑍⟶ℝ*)
51, 2, 4limsupvaluz 46923 . 2 (𝜑 → (lim sup‘𝐹) = inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )), ℝ*, < ))
63adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝐹:𝑍⟶ℝ)
72uzssd3 46641 . . . . . . . . . 10 (𝑛 ∈ 𝑍 → (ℤ≥‘𝑛) ⊆ 𝑍)
87adantl 487 . . . . . . . . 9 ((𝜑 ∧ 𝑛 ∈ 𝑍) → (ℤ≥‘𝑛) ⊆ 𝑍)
96, 8feqresmpt 6977 . . . . . . . 8 ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹 ↾ (ℤ≥‘𝑛)) = (𝑚 ∈ (ℤ≥‘𝑛) ↦ (𝐹‘𝑚)))
109rneqd 5927 . . . . . . 7 ((𝜑 ∧ 𝑛 ∈ 𝑍) → ran (𝐹 ↾ (ℤ≥‘𝑛)) = ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ (𝐹‘𝑚)))
1110supeq1d 9465 . . . . . 6 ((𝜑 ∧ 𝑛 ∈ 𝑍) → sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ) = sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ (𝐹‘𝑚)), ℝ*, < ))
12 nfcv 2926 . . . . . . . . . 10 Ⅎ𝑚𝐹
13 limsupvaluz2.r . . . . . . . . . . 11 (𝜑 → (lim sup‘𝐹) ∈ ℝ)
1413renepnfd 11387 . . . . . . . . . 10 (𝜑 → (lim sup‘𝐹) ≠ +∞)
1512, 2, 3, 14limsupubuz 46928 . . . . . . . . 9 (𝜑 → ∃𝑥 ∈ ℝ ∀𝑚 ∈ 𝑍 (𝐹‘𝑚) ≤ 𝑥)
1615adantr 486 . . . . . . . 8 ((𝜑 ∧ 𝑛 ∈ 𝑍) → ∃𝑥 ∈ ℝ ∀𝑚 ∈ 𝑍 (𝐹‘𝑚) ≤ 𝑥)
17 ssralv 3982 . . . . . . . . . . 11 ((ℤ≥‘𝑛) ⊆ 𝑍 → (∀𝑚 ∈ 𝑍 (𝐹‘𝑚) ≤ 𝑥 → ∀𝑚 ∈ (ℤ≥‘𝑛)(𝐹‘𝑚) ≤ 𝑥))
187, 17syl 18 . . . . . . . . . 10 (𝑛 ∈ 𝑍 → (∀𝑚 ∈ 𝑍 (𝐹‘𝑚) ≤ 𝑥 → ∀𝑚 ∈ (ℤ≥‘𝑛)(𝐹‘𝑚) ≤ 𝑥))
1918adantl 487 . . . . . . . . 9 ((𝜑 ∧ 𝑛 ∈ 𝑍) → (∀𝑚 ∈ 𝑍 (𝐹‘𝑚) ≤ 𝑥 → ∀𝑚 ∈ (ℤ≥‘𝑛)(𝐹‘𝑚) ≤ 𝑥))
2019reximdv 3181 . . . . . . . 8 ((𝜑 ∧ 𝑛 ∈ 𝑍) → (∃𝑥 ∈ ℝ ∀𝑚 ∈ 𝑍 (𝐹‘𝑚) ≤ 𝑥 → ∃𝑥 ∈ ℝ ∀𝑚 ∈ (ℤ≥‘𝑛)(𝐹‘𝑚) ≤ 𝑥))
2116, 20mpd 16 . . . . . . 7 ((𝜑 ∧ 𝑛 ∈ 𝑍) → ∃𝑥 ∈ ℝ ∀𝑚 ∈ (ℤ≥‘𝑛)(𝐹‘𝑚) ≤ 𝑥)
22 nfv 1949 . . . . . . . 8 Ⅎ𝑚(𝜑 ∧ 𝑛 ∈ 𝑍)
232eluzelz2 46618 . . . . . . . . . 10 (𝑛 ∈ 𝑍 → 𝑛 ∈ ℤ)
24 uzid 13007 . . . . . . . . . 10 (𝑛 ∈ ℤ → 𝑛 ∈ (ℤ≥‘𝑛))
25 ne0i 4290 . . . . . . . . . 10 (𝑛 ∈ (ℤ≥‘𝑛) → (ℤ≥‘𝑛) ≠ ∅)
2623, 24, 253syl 19 . . . . . . . . 9 (𝑛 ∈ 𝑍 → (ℤ≥‘𝑛) ≠ ∅)
2726adantl 487 . . . . . . . 8 ((𝜑 ∧ 𝑛 ∈ 𝑍) → (ℤ≥‘𝑛) ≠ ∅)
286adantr 486 . . . . . . . . 9 (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ≥‘𝑛)) → 𝐹:𝑍⟶ℝ)
298sselda 3913 . . . . . . . . 9 (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ≥‘𝑛)) → 𝑚 ∈ 𝑍)
3028, 29ffvelcdmd 7109 . . . . . . . 8 (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ≥‘𝑛)) → (𝐹‘𝑚) ∈ ℝ)
3122, 27, 30supxrre3rnmpt 46644 . . . . . . 7 ((𝜑 ∧ 𝑛 ∈ 𝑍) → (sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ (𝐹‘𝑚)), ℝ*, < ) ∈ ℝ ↔ ∃𝑥 ∈ ℝ ∀𝑚 ∈ (ℤ≥‘𝑛)(𝐹‘𝑚) ≤ 𝑥))
3221, 31mpbird 260 . . . . . 6 ((𝜑 ∧ 𝑛 ∈ 𝑍) → sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ (𝐹‘𝑚)), ℝ*, < ) ∈ ℝ)
3311, 32eqeltrd 2864 . . . . 5 ((𝜑 ∧ 𝑛 ∈ 𝑍) → sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ) ∈ ℝ)
3433fmpttd 7139 . . . 4 (𝜑 → (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )):𝑍⟶ℝ)
3534frnd 6740 . . 3 (𝜑 → ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )) ⊆ ℝ)
36 nfv 1949 . . . 4 Ⅎ𝑛𝜑
37 eqid 2763 . . . 4 (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )) = (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))
381, 2uzn0d 46640 . . . 4 (𝜑 → 𝑍 ≠ ∅)
3936, 33, 37, 38rnmptn0 6258 . . 3 (𝜑 → ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )) ≠ ∅)
40 nfcv 2926 . . . . . . . . 9 Ⅎ𝑗𝐹
4140, 1, 2, 4limsupre3uz 46951 . . . . . . . 8 (𝜑 → ((lim sup‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑗) ∧ ∃𝑥 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)(𝐹‘𝑗) ≤ 𝑥)))
4213, 41mpbid 235 . . . . . . 7 (𝜑 → (∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑗) ∧ ∃𝑥 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)(𝐹‘𝑗) ≤ 𝑥))
4342simpld 500 . . . . . 6 (𝜑 → ∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑗))
44 simp-4r 796 . . . . . . . . . . 11 (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) ∧ 𝑥 ≤ (𝐹‘𝑗)) → 𝑥 ∈ ℝ)
4544rexrd 11386 . . . . . . . . . 10 (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) ∧ 𝑥 ≤ (𝐹‘𝑗)) → 𝑥 ∈ ℝ*)
4643ad2ant1 1151 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → 𝐹:𝑍⟶ℝ*)
472uztrn2 13011 . . . . . . . . . . . . 13 ((𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → 𝑗 ∈ 𝑍)
48473adant1 1148 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → 𝑗 ∈ 𝑍)
4946, 48ffvelcdmd 7109 . . . . . . . . . . 11 ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → (𝐹‘𝑗) ∈ ℝ*)
5049ad5ant134 1393 . . . . . . . . . 10 (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) ∧ 𝑥 ≤ (𝐹‘𝑗)) → (𝐹‘𝑗) ∈ ℝ*)
51 rnresss 6018 . . . . . . . . . . . . . 14 ran (𝐹 ↾ (ℤ≥‘𝑖)) ⊆ ran 𝐹
523frnd 6740 . . . . . . . . . . . . . . 15 (𝜑 → ran 𝐹 ⊆ ℝ)
5352adantr 486 . . . . . . . . . . . . . 14 ((𝜑 ∧ 𝑖 ∈ 𝑍) → ran 𝐹 ⊆ ℝ)
5451, 53sstrid 3924 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑖 ∈ 𝑍) → ran (𝐹 ↾ (ℤ≥‘𝑖)) ⊆ ℝ)
5554ssrexr 46647 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑖 ∈ 𝑍) → ran (𝐹 ↾ (ℤ≥‘𝑖)) ⊆ ℝ*)
5655supxrcld 46327 . . . . . . . . . . 11 ((𝜑 ∧ 𝑖 ∈ 𝑍) → sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) ∈ ℝ*)
5756ad5ant13 769 . . . . . . . . . 10 (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) ∧ 𝑥 ≤ (𝐹‘𝑗)) → sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) ∈ ℝ*)
58 simpr 490 . . . . . . . . . 10 (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) ∧ 𝑥 ≤ (𝐹‘𝑗)) → 𝑥 ≤ (𝐹‘𝑗))
59553adant3 1150 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → ran (𝐹 ↾ (ℤ≥‘𝑖)) ⊆ ℝ*)
60 fvres 6927 . . . . . . . . . . . . . . 15 (𝑗 ∈ (ℤ≥‘𝑖) → ((𝐹 ↾ (ℤ≥‘𝑖))‘𝑗) = (𝐹‘𝑗))
6160eqcomd 2769 . . . . . . . . . . . . . 14 (𝑗 ∈ (ℤ≥‘𝑖) → (𝐹‘𝑗) = ((𝐹 ↾ (ℤ≥‘𝑖))‘𝑗))
62613ad2ant3 1153 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → (𝐹‘𝑗) = ((𝐹 ↾ (ℤ≥‘𝑖))‘𝑗))
633ffnd 6732 . . . . . . . . . . . . . . 15 (𝜑 → 𝐹 Fn 𝑍)
642uzssd3 46641 . . . . . . . . . . . . . . 15 (𝑖 ∈ 𝑍 → (ℤ≥‘𝑖) ⊆ 𝑍)
65 fnssres 6684 . . . . . . . . . . . . . . 15 ((𝐹 Fn 𝑍 ∧ (ℤ≥‘𝑖) ⊆ 𝑍) → (𝐹 ↾ (ℤ≥‘𝑖)) Fn (ℤ≥‘𝑖))
6663, 64, 65syl2an 608 . . . . . . . . . . . . . 14 ((𝜑 ∧ 𝑖 ∈ 𝑍) → (𝐹 ↾ (ℤ≥‘𝑖)) Fn (ℤ≥‘𝑖))
67 fnfvelrn 7104 . . . . . . . . . . . . . 14 (((𝐹 ↾ (ℤ≥‘𝑖)) Fn (ℤ≥‘𝑖) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → ((𝐹 ↾ (ℤ≥‘𝑖))‘𝑗) ∈ ran (𝐹 ↾ (ℤ≥‘𝑖)))
6866, 67stoic3 1809 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → ((𝐹 ↾ (ℤ≥‘𝑖))‘𝑗) ∈ ran (𝐹 ↾ (ℤ≥‘𝑖)))
6962, 68eqeltrd 2864 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → (𝐹‘𝑗) ∈ ran (𝐹 ↾ (ℤ≥‘𝑖)))
70 eqid 2763 . . . . . . . . . . . 12 sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) = sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < )
7159, 69, 70supxrubd 46333 . . . . . . . . . . 11 ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → (𝐹‘𝑗) ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ))
7271ad5ant134 1393 . . . . . . . . . 10 (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) ∧ 𝑥 ≤ (𝐹‘𝑗)) → (𝐹‘𝑗) ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ))
7345, 50, 57, 58, 72xrletrd 13318 . . . . . . . . 9 (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) ∧ 𝑥 ≤ (𝐹‘𝑗)) → 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ))
7473rexlimdva2 3169 . . . . . . . 8 (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) → (∃𝑗 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑗) → 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < )))
7574ralimdva 3178 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑖 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑗) → ∀𝑖 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < )))
7675reximdva 3179 . . . . . 6 (𝜑 → (∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑗) → ∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < )))
7743, 76mpd 16 . . . . 5 (𝜑 → ∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ))
78 fveq2 6908 . . . . . . . . . . . 12 (𝑛 = 𝑖 → (ℤ≥‘𝑛) = (ℤ≥‘𝑖))
7978reseq2d 5981 . . . . . . . . . . 11 (𝑛 = 𝑖 → (𝐹 ↾ (ℤ≥‘𝑛)) = (𝐹 ↾ (ℤ≥‘𝑖)))
8079rneqd 5927 . . . . . . . . . 10 (𝑛 = 𝑖 → ran (𝐹 ↾ (ℤ≥‘𝑛)) = ran (𝐹 ↾ (ℤ≥‘𝑖)))
8180supeq1d 9465 . . . . . . . . 9 (𝑛 = 𝑖 → sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ) = sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ))
82 eqcom 2770 . . . . . . . . 9 (𝑛 = 𝑖 ↔ 𝑖 = 𝑛)
83 eqcom 2770 . . . . . . . . 9 (sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ) = sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) ↔ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) = sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))
8481, 82, 833imtr3i 294 . . . . . . . 8 (𝑖 = 𝑛 → sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) = sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))
8584breq2d 5118 . . . . . . 7 (𝑖 = 𝑛 → (𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) ↔ 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )))
8685cbvralvw 3244 . . . . . 6 (∀𝑖 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) ↔ ∀𝑛 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))
8786rexbii 3113 . . . . 5 (∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) ↔ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))
8877, 87sylib 221 . . . 4 (𝜑 → ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))
8936, 33rnmptbd2 46466 . . . 4 (𝜑 → (∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ) ↔ ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))𝑥 ≤ 𝑦))
9088, 89mpbid 235 . . 3 (𝜑 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))𝑥 ≤ 𝑦)
91 infxrre 13494 . . 3 ((ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )) ⊆ ℝ ∧ ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )) ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))𝑥 ≤ 𝑦) → inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )), ℝ*, < ) = inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )), ℝ, < ))
9235, 39, 90, 91syl3anc 1399 . 2 (𝜑 → inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )), ℝ*, < ) = inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )), ℝ, < ))
93 fveq2 6908 . . . . . . . . 9 (𝑛 = 𝑘 → (ℤ≥‘𝑛) = (ℤ≥‘𝑘))
9493reseq2d 5981 . . . . . . . 8 (𝑛 = 𝑘 → (𝐹 ↾ (ℤ≥‘𝑛)) = (𝐹 ↾ (ℤ≥‘𝑘)))
9594rneqd 5927 . . . . . . 7 (𝑛 = 𝑘 → ran (𝐹 ↾ (ℤ≥‘𝑛)) = ran (𝐹 ↾ (ℤ≥‘𝑘)))
9695supeq1d 9465 . . . . . 6 (𝑛 = 𝑘 → sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ) = sup(ran (𝐹 ↾ (ℤ≥‘𝑘)), ℝ*, < ))
9796cbvmptv 5212 . . . . 5 (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )) = (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑘)), ℝ*, < ))
9897rneqi 5926 . . . 4 ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )) = ran (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑘)), ℝ*, < ))
9998infeq1i 9498 . . 3 inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )), ℝ, < ) = inf(ran (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑘)), ℝ*, < )), ℝ, < )
10099a1i 11 . 2 (𝜑 → inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )), ℝ, < ) = inf(ran (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑘)), ℝ*, < )), ℝ, < ))
1015, 92, 1003eqtrd 2802 1 (𝜑 → (lim sup‘𝐹) = inf(ran (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑘)), ℝ*, < )), ℝ, < ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900  ∅c0 4281   class class class wbr 5106   ↦ cmpt 5189  ran crn 5656   ↾ cres 5657   Fn wfn 6553  ⟶wf 6554  ‘cfv 6558  supcsup 9459  infcinf 9460  ℝcr 11226  ℝ*cxr 11369   < clt 11370   ≤ cle 11371  ℤcz 12720  ℤ≥cuz 12992  lim supclsp 15666
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-cnex 11283  ax-resscn 11284  ax-1cn 11285  ax-icn 11286  ax-addcl 11287  ax-addrcl 11288  ax-mulcl 11289  ax-mulrcl 11290  ax-mulcom 11291  ax-addass 11292  ax-mulass 11293  ax-distr 11294  ax-i2m1 11295  ax-1ne0 11296  ax-1rid 11297  ax-rnegex 11298  ax-rrecex 11299  ax-cnre 11300  ax-pre-lttri 11301  ax-pre-lttrn 11302  ax-pre-ltadd 11303  ax-pre-mulgt0 11304  ax-pre-sup 11305
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-1o 8504  df-er 8745  df-en 9002  df-dom 9003  df-sdom 9004  df-fin 9005  df-sup 9461  df-inf 9462  df-pnf 11372  df-mnf 11373  df-xr 11374  df-ltxr 11375  df-le 11376  df-sub 11570  df-neg 11571  df-nn 12363  df-n0 12634  df-z 12721  df-uz 12993  df-ico 13509  df-fz 13667  df-fl 13959  df-ceil 13960  df-limsup 15667
This theorem is used by:  supcnvlimsup  46955
  Copyright terms: Public domain W3C validator