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

Theorem liminfreuzlem 46259
Description: Given a function on the reals, its inferior limit is real if and only if two condition holds: 1. there is a real number that is greater than or equal to the function, infinitely often; 2. there is a real number that is smaller than or equal to the function. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
Hypotheses
Ref Expression
liminfreuzlem.1 𝑗𝐹
liminfreuzlem.2 (𝜑𝑀 ∈ ℤ)
liminfreuzlem.3 𝑍 = (ℤ𝑀)
liminfreuzlem.4 (𝜑𝐹:𝑍⟶ℝ)
Assertion
Ref Expression
liminfreuzlem (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗))))
Distinct variable groups:   𝑘,𝐹,𝑥   𝑗,𝑀   𝑗,𝑍,𝑘,𝑥   𝜑,𝑗,𝑘,𝑥
Allowed substitution hints:   𝐹(𝑗)   𝑀(𝑥,𝑘)

Proof of Theorem liminfreuzlem
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 nfv 1922 . . . . 5 𝑗𝜑
2 liminfreuzlem.1 . . . . 5 𝑗𝐹
3 liminfreuzlem.2 . . . . 5 (𝜑𝑀 ∈ ℤ)
4 liminfreuzlem.3 . . . . 5 𝑍 = (ℤ𝑀)
5 liminfreuzlem.4 . . . . 5 (𝜑𝐹:𝑍⟶ℝ)
61, 2, 3, 4, 5liminfvaluz4 46256 . . . 4 (𝜑 → (lim inf‘𝐹) = -𝑒(lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))))
76eleq1d 2826 . . 3 (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ -𝑒(lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ))
84fvexi 6845 . . . . . . 7 𝑍 ∈ V
98mptex 7171 . . . . . 6 (𝑗𝑍 ↦ -(𝐹𝑗)) ∈ V
10 limsupcl 15430 . . . . . 6 ((𝑗𝑍 ↦ -(𝐹𝑗)) ∈ V → (lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ*)
119, 10ax-mp 5 . . . . 5 (lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ*
1211a1i 11 . . . 4 (𝜑 → (lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ*)
1312xnegred 45927 . . 3 (𝜑 → ((lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ ↔ -𝑒(lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ))
147, 13bitr4d 284 . 2 (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ))
155ffvelcdmda 7029 . . . . 5 ((𝜑𝑗𝑍) → (𝐹𝑗) ∈ ℝ)
1615renegcld 11572 . . . 4 ((𝜑𝑗𝑍) → -(𝐹𝑗) ∈ ℝ)
171, 3, 4, 16limsupreuzmpt 46196 . . 3 (𝜑 → ((lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ ↔ (∃𝑦 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) ∧ ∃𝑦 ∈ ℝ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦)))
18 renegcl 11452 . . . . . . . 8 (𝑦 ∈ ℝ → -𝑦 ∈ ℝ)
1918ad2antlr 734 . . . . . . 7 (((𝜑𝑦 ∈ ℝ) ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗)) → -𝑦 ∈ ℝ)
20 simpllr 782 . . . . . . . . . . . 12 ((((𝜑𝑦 ∈ ℝ) ∧ 𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → 𝑦 ∈ ℝ)
215ad2antrr 733 . . . . . . . . . . . . . 14 (((𝜑𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → 𝐹:𝑍⟶ℝ)
224uztrn2 12802 . . . . . . . . . . . . . . 15 ((𝑘𝑍𝑗 ∈ (ℤ𝑘)) → 𝑗𝑍)
2322adantll 721 . . . . . . . . . . . . . 14 (((𝜑𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → 𝑗𝑍)
2421, 23ffvelcdmd 7030 . . . . . . . . . . . . 13 (((𝜑𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → (𝐹𝑗) ∈ ℝ)
2524adantllr 726 . . . . . . . . . . . 12 ((((𝜑𝑦 ∈ ℝ) ∧ 𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → (𝐹𝑗) ∈ ℝ)
2620, 25leneg2d 45905 . . . . . . . . . . 11 ((((𝜑𝑦 ∈ ℝ) ∧ 𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → (𝑦 ≤ -(𝐹𝑗) ↔ (𝐹𝑗) ≤ -𝑦))
2726rexbidva 3163 . . . . . . . . . 10 (((𝜑𝑦 ∈ ℝ) ∧ 𝑘𝑍) → (∃𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) ↔ ∃𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ -𝑦))
2827ralbidva 3162 . . . . . . . . 9 ((𝜑𝑦 ∈ ℝ) → (∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) ↔ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ -𝑦))
2928biimpd 231 . . . . . . . 8 ((𝜑𝑦 ∈ ℝ) → (∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) → ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ -𝑦))
3029imp 408 . . . . . . 7 (((𝜑𝑦 ∈ ℝ) ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗)) → ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ -𝑦)
31 breq2 5079 . . . . . . . . . 10 (𝑥 = -𝑦 → ((𝐹𝑗) ≤ 𝑥 ↔ (𝐹𝑗) ≤ -𝑦))
3231rexbidv 3165 . . . . . . . . 9 (𝑥 = -𝑦 → (∃𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ↔ ∃𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ -𝑦))
3332ralbidv 3164 . . . . . . . 8 (𝑥 = -𝑦 → (∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ↔ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ -𝑦))
3433rspcev 3562 . . . . . . 7 ((-𝑦 ∈ ℝ ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ -𝑦) → ∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥)
3519, 30, 34syl2anc 591 . . . . . 6 (((𝜑𝑦 ∈ ℝ) ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗)) → ∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥)
3635rexlimdva2 3144 . . . . 5 (𝜑 → (∃𝑦 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) → ∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥))
37 renegcl 11452 . . . . . . . 8 (𝑥 ∈ ℝ → -𝑥 ∈ ℝ)
3837ad2antlr 734 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥) → -𝑥 ∈ ℝ)
3924adantllr 726 . . . . . . . . . . . 12 ((((𝜑𝑥 ∈ ℝ) ∧ 𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → (𝐹𝑗) ∈ ℝ)
40 simpllr 782 . . . . . . . . . . . 12 ((((𝜑𝑥 ∈ ℝ) ∧ 𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → 𝑥 ∈ ℝ)
4139, 40lenegd 11724 . . . . . . . . . . 11 ((((𝜑𝑥 ∈ ℝ) ∧ 𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → ((𝐹𝑗) ≤ 𝑥 ↔ -𝑥 ≤ -(𝐹𝑗)))
4241rexbidva 3163 . . . . . . . . . 10 (((𝜑𝑥 ∈ ℝ) ∧ 𝑘𝑍) → (∃𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ↔ ∃𝑗 ∈ (ℤ𝑘)-𝑥 ≤ -(𝐹𝑗)))
4342ralbidva 3162 . . . . . . . . 9 ((𝜑𝑥 ∈ ℝ) → (∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ↔ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)-𝑥 ≤ -(𝐹𝑗)))
4443biimpd 231 . . . . . . . 8 ((𝜑𝑥 ∈ ℝ) → (∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 → ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)-𝑥 ≤ -(𝐹𝑗)))
4544imp 408 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥) → ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)-𝑥 ≤ -(𝐹𝑗))
46 breq1 5078 . . . . . . . . . 10 (𝑦 = -𝑥 → (𝑦 ≤ -(𝐹𝑗) ↔ -𝑥 ≤ -(𝐹𝑗)))
4746rexbidv 3165 . . . . . . . . 9 (𝑦 = -𝑥 → (∃𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) ↔ ∃𝑗 ∈ (ℤ𝑘)-𝑥 ≤ -(𝐹𝑗)))
4847ralbidv 3164 . . . . . . . 8 (𝑦 = -𝑥 → (∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) ↔ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)-𝑥 ≤ -(𝐹𝑗)))
4948rspcev 3562 . . . . . . 7 ((-𝑥 ∈ ℝ ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)-𝑥 ≤ -(𝐹𝑗)) → ∃𝑦 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗))
5038, 45, 49syl2anc 591 . . . . . 6 (((𝜑𝑥 ∈ ℝ) ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥) → ∃𝑦 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗))
5150rexlimdva2 3144 . . . . 5 (𝜑 → (∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 → ∃𝑦 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗)))
5236, 51impbid 214 . . . 4 (𝜑 → (∃𝑦 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) ↔ ∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥))
5318ad2antlr 734 . . . . . . 7 (((𝜑𝑦 ∈ ℝ) ∧ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦) → -𝑦 ∈ ℝ)
5415adantlr 722 . . . . . . . . . . 11 (((𝜑𝑦 ∈ ℝ) ∧ 𝑗𝑍) → (𝐹𝑗) ∈ ℝ)
55 simplr 775 . . . . . . . . . . 11 (((𝜑𝑦 ∈ ℝ) ∧ 𝑗𝑍) → 𝑦 ∈ ℝ)
5654, 55leneg3d 45914 . . . . . . . . . 10 (((𝜑𝑦 ∈ ℝ) ∧ 𝑗𝑍) → (-(𝐹𝑗) ≤ 𝑦 ↔ -𝑦 ≤ (𝐹𝑗)))
5756ralbidva 3162 . . . . . . . . 9 ((𝜑𝑦 ∈ ℝ) → (∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦 ↔ ∀𝑗𝑍 -𝑦 ≤ (𝐹𝑗)))
5857biimpd 231 . . . . . . . 8 ((𝜑𝑦 ∈ ℝ) → (∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦 → ∀𝑗𝑍 -𝑦 ≤ (𝐹𝑗)))
5958imp 408 . . . . . . 7 (((𝜑𝑦 ∈ ℝ) ∧ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦) → ∀𝑗𝑍 -𝑦 ≤ (𝐹𝑗))
60 breq1 5078 . . . . . . . . 9 (𝑥 = -𝑦 → (𝑥 ≤ (𝐹𝑗) ↔ -𝑦 ≤ (𝐹𝑗)))
6160ralbidv 3164 . . . . . . . 8 (𝑥 = -𝑦 → (∀𝑗𝑍 𝑥 ≤ (𝐹𝑗) ↔ ∀𝑗𝑍 -𝑦 ≤ (𝐹𝑗)))
6261rspcev 3562 . . . . . . 7 ((-𝑦 ∈ ℝ ∧ ∀𝑗𝑍 -𝑦 ≤ (𝐹𝑗)) → ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗))
6353, 59, 62syl2anc 591 . . . . . 6 (((𝜑𝑦 ∈ ℝ) ∧ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦) → ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗))
6463rexlimdva2 3144 . . . . 5 (𝜑 → (∃𝑦 ∈ ℝ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦 → ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗)))
6537ad2antlr 734 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗)) → -𝑥 ∈ ℝ)
66 simplr 775 . . . . . . . . . . 11 (((𝜑𝑥 ∈ ℝ) ∧ 𝑗𝑍) → 𝑥 ∈ ℝ)
6715adantlr 722 . . . . . . . . . . 11 (((𝜑𝑥 ∈ ℝ) ∧ 𝑗𝑍) → (𝐹𝑗) ∈ ℝ)
6866, 67lenegd 11724 . . . . . . . . . 10 (((𝜑𝑥 ∈ ℝ) ∧ 𝑗𝑍) → (𝑥 ≤ (𝐹𝑗) ↔ -(𝐹𝑗) ≤ -𝑥))
6968ralbidva 3162 . . . . . . . . 9 ((𝜑𝑥 ∈ ℝ) → (∀𝑗𝑍 𝑥 ≤ (𝐹𝑗) ↔ ∀𝑗𝑍 -(𝐹𝑗) ≤ -𝑥))
7069biimpd 231 . . . . . . . 8 ((𝜑𝑥 ∈ ℝ) → (∀𝑗𝑍 𝑥 ≤ (𝐹𝑗) → ∀𝑗𝑍 -(𝐹𝑗) ≤ -𝑥))
7170imp 408 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗)) → ∀𝑗𝑍 -(𝐹𝑗) ≤ -𝑥)
72 brralrspcev 5135 . . . . . . 7 ((-𝑥 ∈ ℝ ∧ ∀𝑗𝑍 -(𝐹𝑗) ≤ -𝑥) → ∃𝑦 ∈ ℝ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦)
7365, 71, 72syl2anc 591 . . . . . 6 (((𝜑𝑥 ∈ ℝ) ∧ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗)) → ∃𝑦 ∈ ℝ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦)
7473rexlimdva2 3144 . . . . 5 (𝜑 → (∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗) → ∃𝑦 ∈ ℝ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦))
7564, 74impbid 214 . . . 4 (𝜑 → (∃𝑦 ∈ ℝ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦 ↔ ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗)))
7652, 75anbi12d 639 . . 3 (𝜑 → ((∃𝑦 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) ∧ ∃𝑦 ∈ ℝ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦) ↔ (∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗))))
7717, 76bitrd 281 . 2 (𝜑 → ((lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗))))
7814, 77bitrd 281 1 (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 397   = wceq 1548  wcel 2121  wnfc 2888  wral 3055  wrex 3065  Vcvv 3433   class class class wbr 5075  cmpt 5156  wf 6485  cfv 6489  cr 11032  *cxr 11173  cle 11175  -cneg 11373  cz 12519  cuz 12783  -𝑒cxne 13055  lim supclsp 15427  lim infclsi 46208
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5202  ax-sep 5221  ax-nul 5231  ax-pow 5297  ax-pr 5365  ax-un 7682  ax-cnex 11089  ax-resscn 11090  ax-1cn 11091  ax-icn 11092  ax-addcl 11093  ax-addrcl 11094  ax-mulcl 11095  ax-mulrcl 11096  ax-mulcom 11097  ax-addass 11098  ax-mulass 11099  ax-distr 11100  ax-i2m1 11101  ax-1ne0 11102  ax-1rid 11103  ax-rnegex 11104  ax-rrecex 11105  ax-cnre 11106  ax-pre-lttri 11107  ax-pre-lttrn 11108  ax-pre-ltadd 11109  ax-pre-mulgt0 11110  ax-pre-sup 11111
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-nel 3041  df-ral 3056  df-rex 3066  df-rmo 3346  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-pss 3905  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-tr 5183  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-isom 6498  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-1o 8399  df-er 8637  df-en 8888  df-dom 8889  df-sdom 8890  df-fin 8891  df-sup 9349  df-inf 9350  df-pnf 11176  df-mnf 11177  df-xr 11178  df-ltxr 11179  df-le 11180  df-sub 11374  df-neg 11375  df-div 11803  df-nn 12170  df-n0 12433  df-z 12520  df-uz 12784  df-q 12894  df-xneg 13058  df-ico 13299  df-fz 13457  df-fzo 13604  df-fl 13746  df-ceil 13747  df-limsup 15428  df-liminf 46209
This theorem is referenced by:  liminfreuz  46260
  Copyright terms: Public domain W3C validator