| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cvg1n | GIF version | ||
| Description: Convergence of real
sequences.
This is a version of caucvgre 11532 with a constant multiplier 𝐶 on the rate of convergence. That is, all terms after the nth term must be within 𝐶 / 𝑛 of the nth term. (Contributed by Jim Kingdon, 1-Aug-2021.) |
| Ref | Expression |
|---|---|
| cvg1n.f | ⊢ (𝜑 → 𝐹:ℕ⟶ℝ) |
| cvg1n.c | ⊢ (𝜑 → 𝐶 ∈ ℝ+) |
| cvg1n.cau | ⊢ (𝜑 → ∀𝑛 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑛)((𝐹‘𝑛) < ((𝐹‘𝑘) + (𝐶 / 𝑛)) ∧ (𝐹‘𝑘) < ((𝐹‘𝑛) + (𝐶 / 𝑛)))) |
| Ref | Expression |
|---|---|
| cvg1n | ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℕ ∀𝑖 ∈ (ℤ≥‘𝑗)((𝐹‘𝑖) < (𝑦 + 𝑥) ∧ 𝑦 < ((𝐹‘𝑖) + 𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cvg1n.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℝ+) | |
| 2 | 1 | rpred 9921 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 3 | arch 9389 | . . 3 ⊢ (𝐶 ∈ ℝ → ∃𝑧 ∈ ℕ 𝐶 < 𝑧) | |
| 4 | 2, 3 | syl 14 | . 2 ⊢ (𝜑 → ∃𝑧 ∈ ℕ 𝐶 < 𝑧) |
| 5 | cvg1n.f | . . . 4 ⊢ (𝜑 → 𝐹:ℕ⟶ℝ) | |
| 6 | 5 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ ℕ ∧ 𝐶 < 𝑧)) → 𝐹:ℕ⟶ℝ) |
| 7 | 1 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ ℕ ∧ 𝐶 < 𝑧)) → 𝐶 ∈ ℝ+) |
| 8 | cvg1n.cau | . . . 4 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑛)((𝐹‘𝑛) < ((𝐹‘𝑘) + (𝐶 / 𝑛)) ∧ (𝐹‘𝑘) < ((𝐹‘𝑛) + (𝐶 / 𝑛)))) | |
| 9 | 8 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ ℕ ∧ 𝐶 < 𝑧)) → ∀𝑛 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑛)((𝐹‘𝑛) < ((𝐹‘𝑘) + (𝐶 / 𝑛)) ∧ (𝐹‘𝑘) < ((𝐹‘𝑛) + (𝐶 / 𝑛)))) |
| 10 | eqid 2229 | . . 3 ⊢ (𝑗 ∈ ℕ ↦ (𝐹‘(𝑗 · 𝑧))) = (𝑗 ∈ ℕ ↦ (𝐹‘(𝑗 · 𝑧))) | |
| 11 | simprl 529 | . . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ ℕ ∧ 𝐶 < 𝑧)) → 𝑧 ∈ ℕ) | |
| 12 | simprr 531 | . . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ ℕ ∧ 𝐶 < 𝑧)) → 𝐶 < 𝑧) | |
| 13 | 6, 7, 9, 10, 11, 12 | cvg1nlemres 11536 | . 2 ⊢ ((𝜑 ∧ (𝑧 ∈ ℕ ∧ 𝐶 < 𝑧)) → ∃𝑦 ∈ ℝ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℕ ∀𝑖 ∈ (ℤ≥‘𝑗)((𝐹‘𝑖) < (𝑦 + 𝑥) ∧ 𝑦 < ((𝐹‘𝑖) + 𝑥))) |
| 14 | 4, 13 | rexlimddv 2653 | 1 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℕ ∀𝑖 ∈ (ℤ≥‘𝑗)((𝐹‘𝑖) < (𝑦 + 𝑥) ∧ 𝑦 < ((𝐹‘𝑖) + 𝑥))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2200 ∀wral 2508 ∃wrex 2509 class class class wbr 4086 ↦ cmpt 4148 ⟶wf 5320 ‘cfv 5324 (class class class)co 6013 ℝcr 8021 + caddc 8025 · cmul 8027 < clt 8204 / cdiv 8842 ℕcn 9133 ℤ≥cuz 9745 ℝ+crp 9878 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-mulrcl 8121 ax-addcom 8122 ax-mulcom 8123 ax-addass 8124 ax-mulass 8125 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-1rid 8129 ax-0id 8130 ax-rnegex 8131 ax-precex 8132 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-apti 8137 ax-pre-ltadd 8138 ax-pre-mulgt0 8139 ax-pre-mulext 8140 ax-arch 8141 ax-caucvg 8142 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-po 4391 df-iso 4392 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-reap 8745 df-ap 8752 df-div 8843 df-inn 9134 df-2 9192 df-n0 9393 df-z 9470 df-uz 9746 df-rp 9879 |
| This theorem is referenced by: resqrexlemcvg 11570 climrecvg1n 11899 |
| Copyright terms: Public domain | W3C validator |