Metamath Proof Explorer


Theorem xlimmnfvlem1

Description: Lemma for xlimmnfv : the "only if" part of the biconditional. (Contributed by Glauco Siliprandi, 5-Feb-2022)

Ref Expression
Hypotheses xlimmnfvlem1.m ⊢ φ → M ∈ ℤ
xlimmnfvlem1.z ⊢ Z = ℤ ≥ M
xlimmnfvlem1.f ⊢ φ → F : Z ⟶ ℝ *
xlimmnfvlem1.c ⊢ φ → F ⇝* −∞
xlimmnfvlem1.x ⊢ φ → X ∈ ℝ
Assertion xlimmnfvlem1 ⊢ φ → ∃ j ∈ Z ∀ k ∈ ℤ ≥ j F ⁡ k ≤ X

Proof

Step Hyp Ref Expression
1 xlimmnfvlem1.m ⊢ φ → M ∈ ℤ
2 xlimmnfvlem1.z ⊢ Z = ℤ ≥ M
3 xlimmnfvlem1.f ⊢ φ → F : Z ⟶ ℝ *
4 xlimmnfvlem1.c ⊢ φ → F ⇝* −∞
5 xlimmnfvlem1.x ⊢ φ → X ∈ ℝ
6 icomnfordt ⊢ −∞ X ∈ ordTop ⁡ ≤
7 6 a1i ⊢ φ → −∞ X ∈ ordTop ⁡ ≤
8 df-xlim ⊢ ⇝* = ⇝t ⁡ ordTop ⁡ ≤
9 8 breqi ⊢ F ⇝* −∞ ↔ F ⇝t ⁡ ordTop ⁡ ≤ −∞
10 4 9 sylib ⊢ φ → F ⇝t ⁡ ordTop ⁡ ≤ −∞
11 nfcv ⊢ Ⅎ _ k F
12 letopon ⊢ ordTop ⁡ ≤ ∈ TopOn ⁡ ℝ *
13 12 a1i ⊢ φ → ordTop ⁡ ≤ ∈ TopOn ⁡ ℝ *
14 11 13 lmbr3 ⊢ φ → F ⇝t ⁡ ordTop ⁡ ≤ −∞ ↔ F ∈ ℝ * ↑ 𝑝𝑚 ℂ ∧ −∞ ∈ ℝ * ∧ ∀ u ∈ ordTop ⁡ ≤ −∞ ∈ u → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ u
15 10 14 mpbid ⊢ φ → F ∈ ℝ * ↑ 𝑝𝑚 ℂ ∧ −∞ ∈ ℝ * ∧ ∀ u ∈ ordTop ⁡ ≤ −∞ ∈ u → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ u
16 15 simp3d ⊢ φ → ∀ u ∈ ordTop ⁡ ≤ −∞ ∈ u → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ u
17 7 16 jca ⊢ φ → −∞ X ∈ ordTop ⁡ ≤ ∧ ∀ u ∈ ordTop ⁡ ≤ −∞ ∈ u → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ u
18 15 simp2d ⊢ φ → −∞ ∈ ℝ *
19 5 rexrd ⊢ φ → X ∈ ℝ *
20 5 mnfltd ⊢ φ → −∞ < X
21 lbico1 ⊢ −∞ ∈ ℝ * ∧ X ∈ ℝ * ∧ −∞ < X → −∞ ∈ −∞ X
22 18 19 20 21 syl3anc ⊢ φ → −∞ ∈ −∞ X
23 eleq2 ⊢ u = −∞ X → −∞ ∈ u ↔ −∞ ∈ −∞ X
24 eleq2 ⊢ u = −∞ X → F ⁡ k ∈ u ↔ F ⁡ k ∈ −∞ X
25 24 anbi2d ⊢ u = −∞ X → k ∈ dom ⁡ F ∧ F ⁡ k ∈ u ↔ k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X
26 25 ralbidv ⊢ u = −∞ X → ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ u ↔ ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X
27 26 rexbidv ⊢ u = −∞ X → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ u ↔ ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X
28 23 27 imbi12d ⊢ u = −∞ X → −∞ ∈ u → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ u ↔ −∞ ∈ −∞ X → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X
29 28 rspcva ⊢ −∞ X ∈ ordTop ⁡ ≤ ∧ ∀ u ∈ ordTop ⁡ ≤ −∞ ∈ u → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ u → −∞ ∈ −∞ X → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X
30 17 22 29 sylc ⊢ φ → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X
31 nfv ⊢ Ⅎ j φ
32 nfv ⊢ Ⅎ k φ
33 3 ffdmd ⊢ φ → F : dom ⁡ F ⟶ ℝ *
34 33 ffvelcdmda ⊢ φ ∧ k ∈ dom ⁡ F → F ⁡ k ∈ ℝ *
35 34 adantrr ⊢ φ ∧ k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X → F ⁡ k ∈ ℝ *
36 19 adantr ⊢ φ ∧ k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X → X ∈ ℝ *
37 18 adantr ⊢ φ ∧ k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X → −∞ ∈ ℝ *
38 simprr ⊢ φ ∧ k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X → F ⁡ k ∈ −∞ X
39 37 36 38 icoltubd ⊢ φ ∧ k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X → F ⁡ k < X
40 35 36 39 xrltled ⊢ φ ∧ k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X → F ⁡ k ≤ X
41 40 ex ⊢ φ → k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X → F ⁡ k ≤ X
42 41 adantr ⊢ φ ∧ k ∈ ℤ ≥ j → k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X → F ⁡ k ≤ X
43 32 42 ralimdaa ⊢ φ → ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X → ∀ k ∈ ℤ ≥ j F ⁡ k ≤ X
44 43 a1d ⊢ φ → j ∈ ℤ → ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X → ∀ k ∈ ℤ ≥ j F ⁡ k ≤ X
45 31 44 reximdai ⊢ φ → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ −∞ X → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j F ⁡ k ≤ X
46 30 45 mpd ⊢ φ → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j F ⁡ k ≤ X
47 2 rexuz3 ⊢ M ∈ ℤ → ∃ j ∈ Z ∀ k ∈ ℤ ≥ j F ⁡ k ≤ X ↔ ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j F ⁡ k ≤ X
48 1 47 syl ⊢ φ → ∃ j ∈ Z ∀ k ∈ ℤ ≥ j F ⁡ k ≤ X ↔ ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j F ⁡ k ≤ X
49 46 48 mpbird ⊢ φ → ∃ j ∈ Z ∀ k ∈ ℤ ≥ j F ⁡ k ≤ X