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 45800
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 1914 . . . . 5 𝑗𝜑
2 liminfreuzlem.1 . . . . 5 𝑗𝐹
3 liminfreuzlem.2 . . . . 5 (𝜑𝑀 ∈ ℤ)
4 liminfreuzlem.3 . . . . 5 𝑍 = (ℤ𝑀)
5 liminfreuzlem.4 . . . . 5 (𝜑𝐹:𝑍⟶ℝ)
61, 2, 3, 4, 5liminfvaluz4 45797 . . . 4 (𝜑 → (lim inf‘𝐹) = -𝑒(lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))))
76eleq1d 2813 . . 3 (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ -𝑒(lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ))
84fvexi 6872 . . . . . . 7 𝑍 ∈ V
98mptex 7197 . . . . . 6 (𝑗𝑍 ↦ -(𝐹𝑗)) ∈ V
10 limsupcl 15439 . . . . . 6 ((𝑗𝑍 ↦ -(𝐹𝑗)) ∈ V → (lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ*)
119, 10ax-mp 5 . . . . 5 (lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ*
1211a1i 11 . . . 4 (𝜑 → (lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ*)
1312xnegred 45466 . . 3 (𝜑 → ((lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ ↔ -𝑒(lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ))
147, 13bitr4d 282 . 2 (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ))
155ffvelcdmda 7056 . . . . 5 ((𝜑𝑗𝑍) → (𝐹𝑗) ∈ ℝ)
1615renegcld 11605 . . . 4 ((𝜑𝑗𝑍) → -(𝐹𝑗) ∈ ℝ)
171, 3, 4, 16limsupreuzmpt 45737 . . 3 (𝜑 → ((lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ ↔ (∃𝑦 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) ∧ ∃𝑦 ∈ ℝ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦)))
18 renegcl 11485 . . . . . . . 8 (𝑦 ∈ ℝ → -𝑦 ∈ ℝ)
1918ad2antlr 727 . . . . . . 7 (((𝜑𝑦 ∈ ℝ) ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗)) → -𝑦 ∈ ℝ)
20 simpllr 775 . . . . . . . . . . . 12 ((((𝜑𝑦 ∈ ℝ) ∧ 𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → 𝑦 ∈ ℝ)
215ad2antrr 726 . . . . . . . . . . . . . 14 (((𝜑𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → 𝐹:𝑍⟶ℝ)
224uztrn2 12812 . . . . . . . . . . . . . . 15 ((𝑘𝑍𝑗 ∈ (ℤ𝑘)) → 𝑗𝑍)
2322adantll 714 . . . . . . . . . . . . . 14 (((𝜑𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → 𝑗𝑍)
2421, 23ffvelcdmd 7057 . . . . . . . . . . . . 13 (((𝜑𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → (𝐹𝑗) ∈ ℝ)
2524adantllr 719 . . . . . . . . . . . 12 ((((𝜑𝑦 ∈ ℝ) ∧ 𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → (𝐹𝑗) ∈ ℝ)
2620, 25leneg2d 45444 . . . . . . . . . . 11 ((((𝜑𝑦 ∈ ℝ) ∧ 𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → (𝑦 ≤ -(𝐹𝑗) ↔ (𝐹𝑗) ≤ -𝑦))
2726rexbidva 3155 . . . . . . . . . 10 (((𝜑𝑦 ∈ ℝ) ∧ 𝑘𝑍) → (∃𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) ↔ ∃𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ -𝑦))
2827ralbidva 3154 . . . . . . . . 9 ((𝜑𝑦 ∈ ℝ) → (∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) ↔ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ -𝑦))
2928biimpd 229 . . . . . . . 8 ((𝜑𝑦 ∈ ℝ) → (∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) → ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ -𝑦))
3029imp 406 . . . . . . 7 (((𝜑𝑦 ∈ ℝ) ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗)) → ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ -𝑦)
31 breq2 5111 . . . . . . . . . 10 (𝑥 = -𝑦 → ((𝐹𝑗) ≤ 𝑥 ↔ (𝐹𝑗) ≤ -𝑦))
3231rexbidv 3157 . . . . . . . . 9 (𝑥 = -𝑦 → (∃𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ↔ ∃𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ -𝑦))
3332ralbidv 3156 . . . . . . . 8 (𝑥 = -𝑦 → (∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ↔ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ -𝑦))
3433rspcev 3588 . . . . . . 7 ((-𝑦 ∈ ℝ ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ -𝑦) → ∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥)
3519, 30, 34syl2anc 584 . . . . . 6 (((𝜑𝑦 ∈ ℝ) ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗)) → ∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥)
3635rexlimdva2 3136 . . . . 5 (𝜑 → (∃𝑦 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) → ∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥))
37 renegcl 11485 . . . . . . . 8 (𝑥 ∈ ℝ → -𝑥 ∈ ℝ)
3837ad2antlr 727 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥) → -𝑥 ∈ ℝ)
3924adantllr 719 . . . . . . . . . . . 12 ((((𝜑𝑥 ∈ ℝ) ∧ 𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → (𝐹𝑗) ∈ ℝ)
40 simpllr 775 . . . . . . . . . . . 12 ((((𝜑𝑥 ∈ ℝ) ∧ 𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → 𝑥 ∈ ℝ)
4139, 40lenegd 11757 . . . . . . . . . . 11 ((((𝜑𝑥 ∈ ℝ) ∧ 𝑘𝑍) ∧ 𝑗 ∈ (ℤ𝑘)) → ((𝐹𝑗) ≤ 𝑥 ↔ -𝑥 ≤ -(𝐹𝑗)))
4241rexbidva 3155 . . . . . . . . . 10 (((𝜑𝑥 ∈ ℝ) ∧ 𝑘𝑍) → (∃𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ↔ ∃𝑗 ∈ (ℤ𝑘)-𝑥 ≤ -(𝐹𝑗)))
4342ralbidva 3154 . . . . . . . . 9 ((𝜑𝑥 ∈ ℝ) → (∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ↔ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)-𝑥 ≤ -(𝐹𝑗)))
4443biimpd 229 . . . . . . . 8 ((𝜑𝑥 ∈ ℝ) → (∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 → ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)-𝑥 ≤ -(𝐹𝑗)))
4544imp 406 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥) → ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)-𝑥 ≤ -(𝐹𝑗))
46 breq1 5110 . . . . . . . . . 10 (𝑦 = -𝑥 → (𝑦 ≤ -(𝐹𝑗) ↔ -𝑥 ≤ -(𝐹𝑗)))
4746rexbidv 3157 . . . . . . . . 9 (𝑦 = -𝑥 → (∃𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) ↔ ∃𝑗 ∈ (ℤ𝑘)-𝑥 ≤ -(𝐹𝑗)))
4847ralbidv 3156 . . . . . . . 8 (𝑦 = -𝑥 → (∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) ↔ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)-𝑥 ≤ -(𝐹𝑗)))
4948rspcev 3588 . . . . . . 7 ((-𝑥 ∈ ℝ ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)-𝑥 ≤ -(𝐹𝑗)) → ∃𝑦 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗))
5038, 45, 49syl2anc 584 . . . . . 6 (((𝜑𝑥 ∈ ℝ) ∧ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥) → ∃𝑦 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗))
5150rexlimdva2 3136 . . . . 5 (𝜑 → (∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 → ∃𝑦 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗)))
5236, 51impbid 212 . . . 4 (𝜑 → (∃𝑦 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) ↔ ∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥))
5318ad2antlr 727 . . . . . . 7 (((𝜑𝑦 ∈ ℝ) ∧ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦) → -𝑦 ∈ ℝ)
5415adantlr 715 . . . . . . . . . . 11 (((𝜑𝑦 ∈ ℝ) ∧ 𝑗𝑍) → (𝐹𝑗) ∈ ℝ)
55 simplr 768 . . . . . . . . . . 11 (((𝜑𝑦 ∈ ℝ) ∧ 𝑗𝑍) → 𝑦 ∈ ℝ)
5654, 55leneg3d 45453 . . . . . . . . . 10 (((𝜑𝑦 ∈ ℝ) ∧ 𝑗𝑍) → (-(𝐹𝑗) ≤ 𝑦 ↔ -𝑦 ≤ (𝐹𝑗)))
5756ralbidva 3154 . . . . . . . . 9 ((𝜑𝑦 ∈ ℝ) → (∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦 ↔ ∀𝑗𝑍 -𝑦 ≤ (𝐹𝑗)))
5857biimpd 229 . . . . . . . 8 ((𝜑𝑦 ∈ ℝ) → (∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦 → ∀𝑗𝑍 -𝑦 ≤ (𝐹𝑗)))
5958imp 406 . . . . . . 7 (((𝜑𝑦 ∈ ℝ) ∧ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦) → ∀𝑗𝑍 -𝑦 ≤ (𝐹𝑗))
60 breq1 5110 . . . . . . . . 9 (𝑥 = -𝑦 → (𝑥 ≤ (𝐹𝑗) ↔ -𝑦 ≤ (𝐹𝑗)))
6160ralbidv 3156 . . . . . . . 8 (𝑥 = -𝑦 → (∀𝑗𝑍 𝑥 ≤ (𝐹𝑗) ↔ ∀𝑗𝑍 -𝑦 ≤ (𝐹𝑗)))
6261rspcev 3588 . . . . . . 7 ((-𝑦 ∈ ℝ ∧ ∀𝑗𝑍 -𝑦 ≤ (𝐹𝑗)) → ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗))
6353, 59, 62syl2anc 584 . . . . . 6 (((𝜑𝑦 ∈ ℝ) ∧ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦) → ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗))
6463rexlimdva2 3136 . . . . 5 (𝜑 → (∃𝑦 ∈ ℝ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦 → ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗)))
6537ad2antlr 727 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗)) → -𝑥 ∈ ℝ)
66 simplr 768 . . . . . . . . . . 11 (((𝜑𝑥 ∈ ℝ) ∧ 𝑗𝑍) → 𝑥 ∈ ℝ)
6715adantlr 715 . . . . . . . . . . 11 (((𝜑𝑥 ∈ ℝ) ∧ 𝑗𝑍) → (𝐹𝑗) ∈ ℝ)
6866, 67lenegd 11757 . . . . . . . . . 10 (((𝜑𝑥 ∈ ℝ) ∧ 𝑗𝑍) → (𝑥 ≤ (𝐹𝑗) ↔ -(𝐹𝑗) ≤ -𝑥))
6968ralbidva 3154 . . . . . . . . 9 ((𝜑𝑥 ∈ ℝ) → (∀𝑗𝑍 𝑥 ≤ (𝐹𝑗) ↔ ∀𝑗𝑍 -(𝐹𝑗) ≤ -𝑥))
7069biimpd 229 . . . . . . . 8 ((𝜑𝑥 ∈ ℝ) → (∀𝑗𝑍 𝑥 ≤ (𝐹𝑗) → ∀𝑗𝑍 -(𝐹𝑗) ≤ -𝑥))
7170imp 406 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗)) → ∀𝑗𝑍 -(𝐹𝑗) ≤ -𝑥)
72 brralrspcev 5167 . . . . . . 7 ((-𝑥 ∈ ℝ ∧ ∀𝑗𝑍 -(𝐹𝑗) ≤ -𝑥) → ∃𝑦 ∈ ℝ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦)
7365, 71, 72syl2anc 584 . . . . . 6 (((𝜑𝑥 ∈ ℝ) ∧ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗)) → ∃𝑦 ∈ ℝ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦)
7473rexlimdva2 3136 . . . . 5 (𝜑 → (∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗) → ∃𝑦 ∈ ℝ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦))
7564, 74impbid 212 . . . 4 (𝜑 → (∃𝑦 ∈ ℝ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦 ↔ ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗)))
7652, 75anbi12d 632 . . 3 (𝜑 → ((∃𝑦 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)𝑦 ≤ -(𝐹𝑗) ∧ ∃𝑦 ∈ ℝ ∀𝑗𝑍 -(𝐹𝑗) ≤ 𝑦) ↔ (∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗))))
7717, 76bitrd 279 . 2 (𝜑 → ((lim sup‘(𝑗𝑍 ↦ -(𝐹𝑗))) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗))))
7814, 77bitrd 279 1 (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  wnfc 2876  wral 3044  wrex 3053  Vcvv 3447   class class class wbr 5107  cmpt 5188  wf 6507  cfv 6511  cr 11067  *cxr 11207  cle 11209  -cneg 11406  cz 12529  cuz 12793  -𝑒cxne 13069  lim supclsp 15436  lim infclsi 45749
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-cnex 11124  ax-resscn 11125  ax-1cn 11126  ax-icn 11127  ax-addcl 11128  ax-addrcl 11129  ax-mulcl 11130  ax-mulrcl 11131  ax-mulcom 11132  ax-addass 11133  ax-mulass 11134  ax-distr 11135  ax-i2m1 11136  ax-1ne0 11137  ax-1rid 11138  ax-rnegex 11139  ax-rrecex 11140  ax-cnre 11141  ax-pre-lttri 11142  ax-pre-lttrn 11143  ax-pre-ltadd 11144  ax-pre-mulgt0 11145  ax-pre-sup 11146
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-isom 6520  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-1o 8434  df-er 8671  df-en 8919  df-dom 8920  df-sdom 8921  df-fin 8922  df-sup 9393  df-inf 9394  df-pnf 11210  df-mnf 11211  df-xr 11212  df-ltxr 11213  df-le 11214  df-sub 11407  df-neg 11408  df-div 11836  df-nn 12187  df-n0 12443  df-z 12530  df-uz 12794  df-q 12908  df-xneg 13072  df-ico 13312  df-fz 13469  df-fzo 13616  df-fl 13754  df-ceil 13755  df-limsup 15437  df-liminf 45750
This theorem is referenced by:  liminfreuz  45801
  Copyright terms: Public domain W3C validator