| 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 11487 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 9888 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 3 | arch 9362 | . . 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 11491 | . 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 4082 ↦ cmpt 4144 ⟶wf 5313 ‘cfv 5317 (class class class)co 6000 ℝcr 7994 + caddc 7998 · cmul 8000 < clt 8177 / cdiv 8815 ℕcn 9106 ℤ≥cuz 9718 ℝ+crp 9845 |
| 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 4201 ax-pow 4257 ax-pr 4292 ax-un 4523 ax-setind 4628 ax-cnex 8086 ax-resscn 8087 ax-1cn 8088 ax-1re 8089 ax-icn 8090 ax-addcl 8091 ax-addrcl 8092 ax-mulcl 8093 ax-mulrcl 8094 ax-addcom 8095 ax-mulcom 8096 ax-addass 8097 ax-mulass 8098 ax-distr 8099 ax-i2m1 8100 ax-0lt1 8101 ax-1rid 8102 ax-0id 8103 ax-rnegex 8104 ax-precex 8105 ax-cnre 8106 ax-pre-ltirr 8107 ax-pre-ltwlin 8108 ax-pre-lttrn 8109 ax-pre-apti 8110 ax-pre-ltadd 8111 ax-pre-mulgt0 8112 ax-pre-mulext 8113 ax-arch 8114 ax-caucvg 8115 |
| 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 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-int 3923 df-br 4083 df-opab 4145 df-mpt 4146 df-id 4383 df-po 4386 df-iso 4387 df-xp 4724 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-rn 4729 df-res 4730 df-ima 4731 df-iota 5277 df-fun 5319 df-fn 5320 df-f 5321 df-fv 5325 df-riota 5953 df-ov 6003 df-oprab 6004 df-mpo 6005 df-pnf 8179 df-mnf 8180 df-xr 8181 df-ltxr 8182 df-le 8183 df-sub 8315 df-neg 8316 df-reap 8718 df-ap 8725 df-div 8816 df-inn 9107 df-2 9165 df-n0 9366 df-z 9443 df-uz 9719 df-rp 9846 |
| This theorem is referenced by: resqrexlemcvg 11525 climrecvg1n 11854 |
| Copyright terms: Public domain | W3C validator |