![]() |
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 10410 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 9171 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
3 | arch 8668 | . . 3 ⊢ (𝐶 ∈ ℝ → ∃𝑧 ∈ ℕ 𝐶 < 𝑧) | |
4 | 2, 3 | syl 14 | . 2 ⊢ (𝜑 → ∃𝑧 ∈ ℕ 𝐶 < 𝑧) |
5 | cvg1n.f | . . . 4 ⊢ (𝜑 → 𝐹:ℕ⟶ℝ) | |
6 | 5 | adantr 270 | . . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ ℕ ∧ 𝐶 < 𝑧)) → 𝐹:ℕ⟶ℝ) |
7 | 1 | adantr 270 | . . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ ℕ ∧ 𝐶 < 𝑧)) → 𝐶 ∈ ℝ+) |
8 | cvg1n.cau | . . . 4 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑛)((𝐹‘𝑛) < ((𝐹‘𝑘) + (𝐶 / 𝑛)) ∧ (𝐹‘𝑘) < ((𝐹‘𝑛) + (𝐶 / 𝑛)))) | |
9 | 8 | adantr 270 | . . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ ℕ ∧ 𝐶 < 𝑧)) → ∀𝑛 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑛)((𝐹‘𝑛) < ((𝐹‘𝑘) + (𝐶 / 𝑛)) ∧ (𝐹‘𝑘) < ((𝐹‘𝑛) + (𝐶 / 𝑛)))) |
10 | eqid 2088 | . . 3 ⊢ (𝑗 ∈ ℕ ↦ (𝐹‘(𝑗 · 𝑧))) = (𝑗 ∈ ℕ ↦ (𝐹‘(𝑗 · 𝑧))) | |
11 | simprl 498 | . . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ ℕ ∧ 𝐶 < 𝑧)) → 𝑧 ∈ ℕ) | |
12 | simprr 499 | . . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ ℕ ∧ 𝐶 < 𝑧)) → 𝐶 < 𝑧) | |
13 | 6, 7, 9, 10, 11, 12 | cvg1nlemres 10414 | . 2 ⊢ ((𝜑 ∧ (𝑧 ∈ ℕ ∧ 𝐶 < 𝑧)) → ∃𝑦 ∈ ℝ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℕ ∀𝑖 ∈ (ℤ≥‘𝑗)((𝐹‘𝑖) < (𝑦 + 𝑥) ∧ 𝑦 < ((𝐹‘𝑖) + 𝑥))) |
14 | 4, 13 | rexlimddv 2493 | 1 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℕ ∀𝑖 ∈ (ℤ≥‘𝑗)((𝐹‘𝑖) < (𝑦 + 𝑥) ∧ 𝑦 < ((𝐹‘𝑖) + 𝑥))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ∈ wcel 1438 ∀wral 2359 ∃wrex 2360 class class class wbr 3845 ↦ cmpt 3899 ⟶wf 5011 ‘cfv 5015 (class class class)co 5652 ℝcr 7347 + caddc 7351 · cmul 7353 < clt 7520 / cdiv 8137 ℕcn 8420 ℤ≥cuz 9017 ℝ+crp 9132 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 579 ax-in2 580 ax-io 665 ax-5 1381 ax-7 1382 ax-gen 1383 ax-ie1 1427 ax-ie2 1428 ax-8 1440 ax-10 1441 ax-11 1442 ax-i12 1443 ax-bndl 1444 ax-4 1445 ax-13 1449 ax-14 1450 ax-17 1464 ax-i9 1468 ax-ial 1472 ax-i5r 1473 ax-ext 2070 ax-sep 3957 ax-pow 4009 ax-pr 4036 ax-un 4260 ax-setind 4353 ax-cnex 7434 ax-resscn 7435 ax-1cn 7436 ax-1re 7437 ax-icn 7438 ax-addcl 7439 ax-addrcl 7440 ax-mulcl 7441 ax-mulrcl 7442 ax-addcom 7443 ax-mulcom 7444 ax-addass 7445 ax-mulass 7446 ax-distr 7447 ax-i2m1 7448 ax-0lt1 7449 ax-1rid 7450 ax-0id 7451 ax-rnegex 7452 ax-precex 7453 ax-cnre 7454 ax-pre-ltirr 7455 ax-pre-ltwlin 7456 ax-pre-lttrn 7457 ax-pre-apti 7458 ax-pre-ltadd 7459 ax-pre-mulgt0 7460 ax-pre-mulext 7461 ax-arch 7462 ax-caucvg 7463 |
This theorem depends on definitions: df-bi 115 df-3or 925 df-3an 926 df-tru 1292 df-fal 1295 df-nf 1395 df-sb 1693 df-eu 1951 df-mo 1952 df-clab 2075 df-cleq 2081 df-clel 2084 df-nfc 2217 df-ne 2256 df-nel 2351 df-ral 2364 df-rex 2365 df-reu 2366 df-rmo 2367 df-rab 2368 df-v 2621 df-sbc 2841 df-dif 3001 df-un 3003 df-in 3005 df-ss 3012 df-pw 3431 df-sn 3452 df-pr 3453 df-op 3455 df-uni 3654 df-int 3689 df-br 3846 df-opab 3900 df-mpt 3901 df-id 4120 df-po 4123 df-iso 4124 df-xp 4444 df-rel 4445 df-cnv 4446 df-co 4447 df-dm 4448 df-rn 4449 df-res 4450 df-ima 4451 df-iota 4980 df-fun 5017 df-fn 5018 df-f 5019 df-fv 5023 df-riota 5608 df-ov 5655 df-oprab 5656 df-mpt2 5657 df-pnf 7522 df-mnf 7523 df-xr 7524 df-ltxr 7525 df-le 7526 df-sub 7653 df-neg 7654 df-reap 8050 df-ap 8057 df-div 8138 df-inn 8421 df-2 8479 df-n0 8672 df-z 8749 df-uz 9018 df-rp 9133 |
This theorem is referenced by: resqrexlemcvg 10448 climrecvg1n 10733 |
Copyright terms: Public domain | W3C validator |