| 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 46201 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗) ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)-𝑒(𝐹‘𝑗) ≤ 𝑥)) |
| 5 | xlimpnfxnegmnf2.m | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 6 | 1, 5, 2, 3 | xlimpnf 46229 | . 2 ⊢ (𝜑 → (𝐹~~>*+∞ ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗))) |
| 7 | nfmpt1 5199 | . . . 4 ⊢ Ⅎ𝑗(𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗)) | |
| 8 | 3 | ffvelcdmda 7040 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ*) |
| 9 | 8 | xnegcld 13229 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → -𝑒(𝐹‘𝑘) ∈ ℝ*) |
| 10 | nfcv 2899 | . . . . . 6 ⊢ Ⅎ𝑘-𝑒(𝐹‘𝑗) | |
| 11 | nfcv 2899 | . . . . . . . 8 ⊢ Ⅎ𝑗𝑘 | |
| 12 | 1, 11 | nffv 6854 | . . . . . . 7 ⊢ Ⅎ𝑗(𝐹‘𝑘) |
| 13 | 12 | nfxneg 45848 | . . . . . 6 ⊢ Ⅎ𝑗-𝑒(𝐹‘𝑘) |
| 14 | fveq2 6844 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → (𝐹‘𝑗) = (𝐹‘𝑘)) | |
| 15 | 14 | xnegeqd 45824 | . . . . . 6 ⊢ (𝑗 = 𝑘 → -𝑒(𝐹‘𝑗) = -𝑒(𝐹‘𝑘)) |
| 16 | 10, 13, 15 | cbvmpt 5202 | . . . . 5 ⊢ (𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗)) = (𝑘 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑘)) |
| 17 | 9, 16 | fmptd 7070 | . . . 4 ⊢ (𝜑 → (𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗)):𝑍⟶ℝ*) |
| 18 | 7, 5, 2, 17 | xlimmnf 46228 | . . 3 ⊢ (𝜑 → ((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))~~>*-∞ ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥)) |
| 19 | 2 | uztrn2 12784 | . . . . . . 7 ⊢ ((𝑘 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → 𝑗 ∈ 𝑍) |
| 20 | xnegex 13137 | . . . . . . . . 9 ⊢ -𝑒(𝐹‘𝑗) ∈ V | |
| 21 | fvmpt4 45625 | . . . . . . . . 9 ⊢ ((𝑗 ∈ 𝑍 ∧ -𝑒(𝐹‘𝑗) ∈ V) → ((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) = -𝑒(𝐹‘𝑗)) | |
| 22 | 20, 21 | mpan2 692 | . . . . . . . 8 ⊢ (𝑗 ∈ 𝑍 → ((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) = -𝑒(𝐹‘𝑗)) |
| 23 | 22 | breq1d 5110 | . . . . . . 7 ⊢ (𝑗 ∈ 𝑍 → (((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥 ↔ -𝑒(𝐹‘𝑗) ≤ 𝑥)) |
| 24 | 19, 23 | syl 17 | . . . . . 6 ⊢ ((𝑘 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → (((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥 ↔ -𝑒(𝐹‘𝑗) ≤ 𝑥)) |
| 25 | 24 | ralbidva 3159 | . . . . 5 ⊢ (𝑘 ∈ 𝑍 → (∀𝑗 ∈ (ℤ≥‘𝑘)((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥 ↔ ∀𝑗 ∈ (ℤ≥‘𝑘)-𝑒(𝐹‘𝑗) ≤ 𝑥)) |
| 26 | 25 | rexbiia 3083 | . . . 4 ⊢ (∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)((𝑗 ∈ 𝑍 ↦ -𝑒(𝐹‘𝑗))‘𝑗) ≤ 𝑥 ↔ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)-𝑒(𝐹‘𝑗) ≤ 𝑥) |
| 27 | 26 | ralbii 3084 | . . 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 1542 ∈ wcel 2114 Ⅎwnfc 2884 ∀wral 3052 ∃wrex 3062 Vcvv 3442 class class class wbr 5100 ↦ cmpt 5181 ⟶wf 6498 ‘cfv 6502 ℝcr 11039 +∞cpnf 11177 -∞cmnf 11178 ℝ*cxr 11179 ≤ cle 11181 ℤcz 12502 ℤ≥cuz 12765 -𝑒cxne 13037 ~~>*clsxlim 46205 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-1st 7945 df-2nd 7946 df-1o 8409 df-2o 8410 df-er 8647 df-pm 8780 df-en 8898 df-dom 8899 df-sdom 8900 df-fin 8901 df-fi 9328 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-z 12503 df-uz 12766 df-xneg 13040 df-ioo 13279 df-ioc 13280 df-ico 13281 df-icc 13282 df-topgen 17377 df-ordt 17436 df-ps 18503 df-tsr 18504 df-top 22855 df-topon 22872 df-bases 22907 df-lm 23190 df-xlim 46206 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |