| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > caucvgsrlembnd | GIF version | ||
| Description: Lemma for caucvgsr 7977. A Cauchy sequence with a lower bound converges. (Contributed by Jim Kingdon, 19-Jun-2021.) |
| Ref | Expression |
|---|---|
| caucvgsr.f | ⊢ (𝜑 → 𝐹:N⟶R) |
| caucvgsr.cau | ⊢ (𝜑 → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛) <R ((𝐹‘𝑘) +R [〈(〈{𝑙 ∣ 𝑙 <Q (*Q‘[〈𝑛, 1o〉] ~Q )}, {𝑢 ∣ (*Q‘[〈𝑛, 1o〉] ~Q ) <Q 𝑢}〉 +P 1P), 1P〉] ~R ) ∧ (𝐹‘𝑘) <R ((𝐹‘𝑛) +R [〈(〈{𝑙 ∣ 𝑙 <Q (*Q‘[〈𝑛, 1o〉] ~Q )}, {𝑢 ∣ (*Q‘[〈𝑛, 1o〉] ~Q ) <Q 𝑢}〉 +P 1P), 1P〉] ~R )))) |
| caucvgsrlembnd.bnd | ⊢ (𝜑 → ∀𝑚 ∈ N 𝐴 <R (𝐹‘𝑚)) |
| Ref | Expression |
|---|---|
| caucvgsrlembnd | ⊢ (𝜑 → ∃𝑦 ∈ R ∀𝑥 ∈ R (0R <R 𝑥 → ∃𝑗 ∈ N ∀𝑘 ∈ N (𝑗 <N 𝑘 → ((𝐹‘𝑘) <R (𝑦 +R 𝑥) ∧ 𝑦 <R ((𝐹‘𝑘) +R 𝑥))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | caucvgsr.f | . 2 ⊢ (𝜑 → 𝐹:N⟶R) | |
| 2 | caucvgsr.cau | . 2 ⊢ (𝜑 → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛) <R ((𝐹‘𝑘) +R [〈(〈{𝑙 ∣ 𝑙 <Q (*Q‘[〈𝑛, 1o〉] ~Q )}, {𝑢 ∣ (*Q‘[〈𝑛, 1o〉] ~Q ) <Q 𝑢}〉 +P 1P), 1P〉] ~R ) ∧ (𝐹‘𝑘) <R ((𝐹‘𝑛) +R [〈(〈{𝑙 ∣ 𝑙 <Q (*Q‘[〈𝑛, 1o〉] ~Q )}, {𝑢 ∣ (*Q‘[〈𝑛, 1o〉] ~Q ) <Q 𝑢}〉 +P 1P), 1P〉] ~R )))) | |
| 3 | caucvgsrlembnd.bnd | . 2 ⊢ (𝜑 → ∀𝑚 ∈ N 𝐴 <R (𝐹‘𝑚)) | |
| 4 | fveq2 5623 | . . . . 5 ⊢ (𝑎 = 𝑏 → (𝐹‘𝑎) = (𝐹‘𝑏)) | |
| 5 | 4 | oveq1d 6009 | . . . 4 ⊢ (𝑎 = 𝑏 → ((𝐹‘𝑎) +R 1R) = ((𝐹‘𝑏) +R 1R)) |
| 6 | 5 | oveq1d 6009 | . . 3 ⊢ (𝑎 = 𝑏 → (((𝐹‘𝑎) +R 1R) +R (𝐴 ·R -1R)) = (((𝐹‘𝑏) +R 1R) +R (𝐴 ·R -1R))) |
| 7 | 6 | cbvmptv 4179 | . 2 ⊢ (𝑎 ∈ N ↦ (((𝐹‘𝑎) +R 1R) +R (𝐴 ·R -1R))) = (𝑏 ∈ N ↦ (((𝐹‘𝑏) +R 1R) +R (𝐴 ·R -1R))) |
| 8 | 1, 2, 3, 7 | caucvgsrlemoffres 7975 | 1 ⊢ (𝜑 → ∃𝑦 ∈ R ∀𝑥 ∈ R (0R <R 𝑥 → ∃𝑗 ∈ N ∀𝑘 ∈ N (𝑗 <N 𝑘 → ((𝐹‘𝑘) <R (𝑦 +R 𝑥) ∧ 𝑦 <R ((𝐹‘𝑘) +R 𝑥))))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 {cab 2215 ∀wral 2508 ∃wrex 2509 〈cop 3669 class class class wbr 4082 ↦ cmpt 4144 ⟶wf 5310 ‘cfv 5314 (class class class)co 5994 1oc1o 6545 [cec 6668 Ncnpi 7447 <N clti 7450 ~Q ceq 7454 *Qcrq 7459 <Q cltq 7460 1Pc1p 7467 +P cpp 7468 ~R cer 7471 Rcnr 7472 0Rc0r 7473 1Rc1r 7474 -1Rcm1r 7475 +R cplr 7476 ·R cmr 7477 <R cltr 7478 |
| 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-coll 4198 ax-sep 4201 ax-nul 4209 ax-pow 4257 ax-pr 4292 ax-un 4521 ax-setind 4626 ax-iinf 4677 |
| This theorem depends on definitions: df-bi 117 df-dc 840 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-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-int 3923 df-iun 3966 df-br 4083 df-opab 4145 df-mpt 4146 df-tr 4182 df-eprel 4377 df-id 4381 df-po 4384 df-iso 4385 df-iord 4454 df-on 4456 df-suc 4459 df-iom 4680 df-xp 4722 df-rel 4723 df-cnv 4724 df-co 4725 df-dm 4726 df-rn 4727 df-res 4728 df-ima 4729 df-iota 5274 df-fun 5316 df-fn 5317 df-f 5318 df-f1 5319 df-fo 5320 df-f1o 5321 df-fv 5322 df-riota 5947 df-ov 5997 df-oprab 5998 df-mpo 5999 df-1st 6276 df-2nd 6277 df-recs 6441 df-irdg 6506 df-1o 6552 df-2o 6553 df-oadd 6556 df-omul 6557 df-er 6670 df-ec 6672 df-qs 6676 df-ni 7479 df-pli 7480 df-mi 7481 df-lti 7482 df-plpq 7519 df-mpq 7520 df-enq 7522 df-nqqs 7523 df-plqqs 7524 df-mqqs 7525 df-1nqqs 7526 df-rq 7527 df-ltnqqs 7528 df-enq0 7599 df-nq0 7600 df-0nq0 7601 df-plq0 7602 df-mq0 7603 df-inp 7641 df-i1p 7642 df-iplp 7643 df-imp 7644 df-iltp 7645 df-enr 7901 df-nr 7902 df-plr 7903 df-mr 7904 df-ltr 7905 df-0r 7906 df-1r 7907 df-m1r 7908 |
| This theorem is referenced by: caucvgsr 7977 |
| Copyright terms: Public domain | W3C validator |