| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > caucvgsrlembnd | GIF version | ||
| Description: Lemma for caucvgsr 8065. 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 5648 | . . . . 5 ⊢ (𝑎 = 𝑏 → (𝐹‘𝑎) = (𝐹‘𝑏)) | |
| 5 | 4 | oveq1d 6043 | . . . 4 ⊢ (𝑎 = 𝑏 → ((𝐹‘𝑎) +R 1R) = ((𝐹‘𝑏) +R 1R)) |
| 6 | 5 | oveq1d 6043 | . . 3 ⊢ (𝑎 = 𝑏 → (((𝐹‘𝑎) +R 1R) +R (𝐴 ·R -1R)) = (((𝐹‘𝑏) +R 1R) +R (𝐴 ·R -1R))) |
| 7 | 6 | cbvmptv 4190 | . 2 ⊢ (𝑎 ∈ N ↦ (((𝐹‘𝑎) +R 1R) +R (𝐴 ·R -1R))) = (𝑏 ∈ N ↦ (((𝐹‘𝑏) +R 1R) +R (𝐴 ·R -1R))) |
| 8 | 1, 2, 3, 7 | caucvgsrlemoffres 8063 | 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 2217 ∀wral 2511 ∃wrex 2512 〈cop 3676 class class class wbr 4093 ↦ cmpt 4155 ⟶wf 5329 ‘cfv 5333 (class class class)co 6028 1oc1o 6618 [cec 6743 Ncnpi 7535 <N clti 7538 ~Q ceq 7542 *Qcrq 7547 <Q cltq 7548 1Pc1p 7555 +P cpp 7556 ~R cer 7559 Rcnr 7560 0Rc0r 7561 1Rc1r 7562 -1Rcm1r 7563 +R cplr 7564 ·R cmr 7565 <R cltr 7566 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-eprel 4392 df-id 4396 df-po 4399 df-iso 4400 df-iord 4469 df-on 4471 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-irdg 6579 df-1o 6625 df-2o 6626 df-oadd 6629 df-omul 6630 df-er 6745 df-ec 6747 df-qs 6751 df-ni 7567 df-pli 7568 df-mi 7569 df-lti 7570 df-plpq 7607 df-mpq 7608 df-enq 7610 df-nqqs 7611 df-plqqs 7612 df-mqqs 7613 df-1nqqs 7614 df-rq 7615 df-ltnqqs 7616 df-enq0 7687 df-nq0 7688 df-0nq0 7689 df-plq0 7690 df-mq0 7691 df-inp 7729 df-i1p 7730 df-iplp 7731 df-imp 7732 df-iltp 7733 df-enr 7989 df-nr 7990 df-plr 7991 df-mr 7992 df-ltr 7993 df-0r 7994 df-1r 7995 df-m1r 7996 |
| This theorem is referenced by: caucvgsr 8065 |
| Copyright terms: Public domain | W3C validator |