| 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 45805 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗) ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)-𝑒(𝐹‘𝑗) ≤ 𝑥)) |
| 5 | xlimpnfxnegmnf2.m | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 6 | 1, 5, 2, 3 | xlimpnf 45833 | . 2 ⊢ (𝜑 → (𝐹~~>*+∞ ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗))) |
| 7 | nfmpt1 5201 | . . . 4 ⊢ Ⅎ𝑗(𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗)) | |
| 8 | 3 | ffvelcdmda 7038 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ*) |
| 9 | 8 | xnegcld 13236 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → -𝑒(𝐹‘𝑘) ∈ ℝ*) |
| 10 | nfcv 2891 | . . . . . 6 ⊢ Ⅎ𝑘-𝑒(𝐹‘𝑗) | |
| 11 | nfcv 2891 | . . . . . . . 8 ⊢ Ⅎ𝑗𝑘 | |
| 12 | 1, 11 | nffv 6850 | . . . . . . 7 ⊢ Ⅎ𝑗(𝐹‘𝑘) |
| 13 | 12 | nfxneg 45450 | . . . . . 6 ⊢ Ⅎ𝑗-𝑒(𝐹‘𝑘) |
| 14 | fveq2 6840 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → (𝐹‘𝑗) = (𝐹‘𝑘)) | |
| 15 | 14 | xnegeqd 45426 | . . . . . 6 ⊢ (𝑗 = 𝑘 → -𝑒(𝐹‘𝑗) = -𝑒(𝐹‘𝑘)) |
| 16 | 10, 13, 15 | cbvmpt 5204 | . . . . 5 ⊢ (𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗)) = (𝑘 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑘)) |
| 17 | 9, 16 | fmptd 7068 | . . . 4 ⊢ (𝜑 → (𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗)):𝑍⟶ℝ*) |
| 18 | 7, 5, 2, 17 | xlimmnf 45832 | . . 3 ⊢ (𝜑 → ((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))~~>*-∞ ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥)) |
| 19 | 2 | uztrn2 12788 | . . . . . . 7 ⊢ ((𝑘 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → 𝑗 ∈ 𝑍) |
| 20 | xnegex 13144 | . . . . . . . . 9 ⊢ -𝑒(𝐹‘𝑗) ∈ V | |
| 21 | fvmpt4 45225 | . . . . . . . . 9 ⊢ ((𝑗 ∈ 𝑍 ∧ -𝑒(𝐹‘𝑗) ∈ V) → ((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) = -𝑒(𝐹‘𝑗)) | |
| 22 | 20, 21 | mpan2 691 | . . . . . . . 8 ⊢ (𝑗 ∈ 𝑍 → ((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) = -𝑒(𝐹‘𝑗)) |
| 23 | 22 | breq1d 5112 | . . . . . . 7 ⊢ (𝑗 ∈ 𝑍 → (((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥 ↔ -𝑒(𝐹‘𝑗) ≤ 𝑥)) |
| 24 | 19, 23 | syl 17 | . . . . . 6 ⊢ ((𝑘 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → (((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥 ↔ -𝑒(𝐹‘𝑗) ≤ 𝑥)) |
| 25 | 24 | ralbidva 3154 | . . . . 5 ⊢ (𝑘 ∈ 𝑍 → (∀𝑗 ∈ (ℤ≥‘𝑘)((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥 ↔ ∀𝑗 ∈ (ℤ≥‘𝑘)-𝑒(𝐹‘𝑗) ≤ 𝑥)) |
| 26 | 25 | rexbiia 3074 | . . . 4 ⊢ (∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥 ↔ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)-𝑒(𝐹‘𝑗) ≤ 𝑥) |
| 27 | 26 | ralbii 3075 | . . 3 ⊢ (∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥 ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)-𝑒(𝐹‘𝑗) ≤ 𝑥) |
| 28 | 18, 27 | bitrdi 287 | . 2 ⊢ (𝜑 → ((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))~~>*-∞ ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)-𝑒(𝐹‘𝑗) ≤ 𝑥)) |
| 29 | 4, 6, 28 | 3bitr4d 311 | 1 ⊢ (𝜑 → (𝐹~~>*+∞ ↔ (𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))~~>*-∞)) |
| 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 3444 class class class wbr 5102 ↦ cmpt 5183 ⟶wf 6495 ‘cfv 6499 ℝcr 11043 +∞cpnf 11181 -∞cmnf 11182 ℝ*cxr 11183 ≤ cle 11185 ℤcz 12505 ℤ≥cuz 12769 -𝑒cxne 13045 ~~>*clsxlim 45809 |
| 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-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 |
| 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-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-1o 8411 df-2o 8412 df-er 8648 df-pm 8779 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-fi 9338 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-z 12506 df-uz 12770 df-xneg 13048 df-ioo 13286 df-ioc 13287 df-ico 13288 df-icc 13289 df-topgen 17382 df-ordt 17440 df-ps 18507 df-tsr 18508 df-top 22814 df-topon 22831 df-bases 22866 df-lm 23149 df-xlim 45810 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |