| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > xlimpnfxnegmnf2 | Structured version Visualization version GIF version | ||
| Description: A sequence converges to +∞ if and only if its negation converges to -∞. (Contributed by Glauco Siliprandi, 23-Apr-2023.) |
| Ref | Expression |
|---|---|
| xlimpnfxnegmnf2.j | ⊢ Ⅎ𝑗𝐹 |
| xlimpnfxnegmnf2.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| xlimpnfxnegmnf2.z | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| xlimpnfxnegmnf2.f | ⊢ (𝜑 → 𝐹:𝑍⟶ℝ*) |
| Ref | Expression |
|---|---|
| xlimpnfxnegmnf2 | ⊢ (𝜑 → (𝐹~~>*+∞ ↔ (𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))~~>*-∞)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xlimpnfxnegmnf2.j | . . 3 ⊢ Ⅎ𝑗𝐹 | |
| 2 | xlimpnfxnegmnf2.z | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 3 | xlimpnfxnegmnf2.f | . . 3 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ*) | |
| 4 | 1, 2, 3 | xlimpnfxnegmnf 46393 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗) ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)-𝑒(𝐹‘𝑗) ≤ 𝑥)) |
| 5 | xlimpnfxnegmnf2.m | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 6 | 1, 5, 2, 3 | xlimpnf 46421 | . 2 ⊢ (𝜑 → (𝐹~~>*+∞ ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗))) |
| 7 | nfmpt1 5201 | . . . 4 ⊢ Ⅎ𝑗(𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗)) | |
| 8 | 3 | ffvelcdmda 7067 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ*) |
| 9 | 8 | xnegcld 13305 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → -𝑒(𝐹‘𝑘) ∈ ℝ*) |
| 10 | nfcv 2926 | . . . . . 6 ⊢ Ⅎ𝑘-𝑒(𝐹‘𝑗) | |
| 11 | nfcv 2926 | . . . . . . . 8 ⊢ Ⅎ𝑗𝑘 | |
| 12 | 1, 11 | nffv 6879 | . . . . . . 7 ⊢ Ⅎ𝑗(𝐹‘𝑘) |
| 13 | 12 | nfxneg 46040 | . . . . . 6 ⊢ Ⅎ𝑗-𝑒(𝐹‘𝑘) |
| 14 | fveq2 6869 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → (𝐹‘𝑗) = (𝐹‘𝑘)) | |
| 15 | 14 | xnegeqd 46016 | . . . . . 6 ⊢ (𝑗 = 𝑘 → -𝑒(𝐹‘𝑗) = -𝑒(𝐹‘𝑘)) |
| 16 | 10, 13, 15 | cbvmpt 5204 | . . . . 5 ⊢ (𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗)) = (𝑘 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑘)) |
| 17 | 9, 16 | fmptd 7097 | . . . 4 ⊢ (𝜑 → (𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗)):𝑍⟶ℝ*) |
| 18 | 7, 5, 2, 17 | xlimmnf 46420 | . . 3 ⊢ (𝜑 → ((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))~~>*-∞ ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥)) |
| 19 | 2 | uztrn2 12860 | . . . . . . 7 ⊢ ((𝑘 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → 𝑗 ∈ 𝑍) |
| 20 | xnegex 13213 | . . . . . . . . 9 ⊢ -𝑒(𝐹‘𝑗) ∈ V | |
| 21 | fvmpt4 45818 | . . . . . . . . 9 ⊢ ((𝑗 ∈ 𝑍 ∧ -𝑒(𝐹‘𝑗) ∈ V) → ((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) = -𝑒(𝐹‘𝑗)) | |
| 22 | 20, 21 | mpan2 701 | . . . . . . . 8 ⊢ (𝑗 ∈ 𝑍 → ((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) = -𝑒(𝐹‘𝑗)) |
| 23 | 22 | breq1d 5112 | . . . . . . 7 ⊢ (𝑗 ∈ 𝑍 → (((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥 ↔ -𝑒(𝐹‘𝑗) ≤ 𝑥)) |
| 24 | 19, 23 | syl 17 | . . . . . 6 ⊢ ((𝑘 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → (((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥 ↔ -𝑒(𝐹‘𝑗) ≤ 𝑥)) |
| 25 | 24 | ralbidva 3185 | . . . . 5 ⊢ (𝑘 ∈ 𝑍 → (∀𝑗 ∈ (ℤ≥‘𝑘)((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥 ↔ ∀𝑗 ∈ (ℤ≥‘𝑘)-𝑒(𝐹‘𝑗) ≤ 𝑥)) |
| 26 | 25 | rexbiia 3109 | . . . 4 ⊢ (∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥 ↔ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)-𝑒(𝐹‘𝑗) ≤ 𝑥) |
| 27 | 26 | ralbii 3110 | . . 3 ⊢ (∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥 ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)-𝑒(𝐹‘𝑗) ≤ 𝑥) |
| 28 | 18, 27 | bitrdi 289 | . 2 ⊢ (𝜑 → ((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))~~>*-∞ ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)-𝑒(𝐹‘𝑗) ≤ 𝑥)) |
| 29 | 4, 6, 28 | 3bitr4d 313 | 1 ⊢ (𝜑 → (𝐹~~>*+∞ ↔ (𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))~~>*-∞)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1562 ∈ wcel 2144 Ⅎwnfc 2911 ∀wral 3078 ∃wrex 3088 Vcvv 3456 class class class wbr 5102 ↦ cmpt 5183 ⟶wf 6519 ‘cfv 6523 ℝcr 11074 +∞cpnf 11215 -∞cmnf 11216 ℝ*cxr 11217 ≤ cle 11219 ℤcz 12570 ℤ≥cuz 12841 -𝑒cxne 13113 ~~>*clsxlim 46397 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5544 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-we 5604 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-riota 7355 df-ov 7401 df-oprab 7402 df-mpo 7403 df-om 7849 df-1st 7972 df-2nd 7973 df-1o 8439 df-2o 8440 df-er 8680 df-pm 8813 df-en 8930 df-dom 8931 df-sdom 8932 df-fin 8933 df-fi 9359 df-pnf 11220 df-mnf 11221 df-xr 11222 df-ltxr 11223 df-le 11224 df-sub 11418 df-neg 11419 df-z 12571 df-uz 12842 df-xneg 13116 df-ioo 13355 df-ioc 13356 df-ico 13357 df-icc 13358 df-topgen 17474 df-ordt 17533 df-ps 18600 df-tsr 18601 df-top 22956 df-topon 22973 df-bases 23008 df-lm 23291 df-xlim 46398 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |