| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > caucvgsrlemf | GIF version | ||
| Description: Lemma for caucvgsr 7952. Defining the sequence in terms of positive reals. (Contributed by Jim Kingdon, 23-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 )))) |
| caucvgsrlemgt1.gt1 | ⊢ (𝜑 → ∀𝑚 ∈ N 1R <R (𝐹‘𝑚)) |
| caucvgsrlemf.xfr | ⊢ 𝐺 = (𝑥 ∈ N ↦ (℩𝑦 ∈ P (𝐹‘𝑥) = [〈(𝑦 +P 1P), 1P〉] ~R )) |
| Ref | Expression |
|---|---|
| caucvgsrlemf | ⊢ (𝜑 → 𝐺:N⟶P) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | caucvgsr.f | . . 3 ⊢ (𝜑 → 𝐹:N⟶R) | |
| 2 | caucvgsrlemgt1.gt1 | . . 3 ⊢ (𝜑 → ∀𝑚 ∈ N 1R <R (𝐹‘𝑚)) | |
| 3 | 1, 2 | caucvgsrlemcl 7939 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ N) → (℩𝑦 ∈ P (𝐹‘𝑥) = [〈(𝑦 +P 1P), 1P〉] ~R ) ∈ P) |
| 4 | caucvgsrlemf.xfr | . 2 ⊢ 𝐺 = (𝑥 ∈ N ↦ (℩𝑦 ∈ P (𝐹‘𝑥) = [〈(𝑦 +P 1P), 1P〉] ~R )) | |
| 5 | 3, 4 | fmptd 5759 | 1 ⊢ (𝜑 → 𝐺:N⟶P) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1373 {cab 2193 ∀wral 2486 〈cop 3647 class class class wbr 4060 ↦ cmpt 4122 ⟶wf 5287 ‘cfv 5291 ℩crio 5923 (class class class)co 5969 1oc1o 6520 [cec 6643 Ncnpi 7422 <N clti 7425 ~Q ceq 7429 *Qcrq 7434 <Q cltq 7435 Pcnp 7441 1Pc1p 7442 +P cpp 7443 ~R cer 7446 Rcnr 7447 1Rc1r 7449 +R cplr 7451 <R cltr 7453 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-coll 4176 ax-sep 4179 ax-nul 4187 ax-pow 4235 ax-pr 4270 ax-un 4499 ax-setind 4604 ax-iinf 4655 |
| This theorem depends on definitions: df-bi 117 df-dc 837 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-ral 2491 df-rex 2492 df-reu 2493 df-rmo 2494 df-rab 2495 df-v 2779 df-sbc 3007 df-csb 3103 df-dif 3177 df-un 3179 df-in 3181 df-ss 3188 df-nul 3470 df-pw 3629 df-sn 3650 df-pr 3651 df-op 3653 df-uni 3866 df-int 3901 df-iun 3944 df-br 4061 df-opab 4123 df-mpt 4124 df-tr 4160 df-eprel 4355 df-id 4359 df-po 4362 df-iso 4363 df-iord 4432 df-on 4434 df-suc 4437 df-iom 4658 df-xp 4700 df-rel 4701 df-cnv 4702 df-co 4703 df-dm 4704 df-rn 4705 df-res 4706 df-ima 4707 df-iota 5252 df-fun 5293 df-fn 5294 df-f 5295 df-f1 5296 df-fo 5297 df-f1o 5298 df-fv 5299 df-riota 5924 df-ov 5972 df-oprab 5973 df-mpo 5974 df-1st 6251 df-2nd 6252 df-recs 6416 df-irdg 6481 df-1o 6527 df-2o 6528 df-oadd 6531 df-omul 6532 df-er 6645 df-ec 6647 df-qs 6651 df-ni 7454 df-pli 7455 df-mi 7456 df-lti 7457 df-plpq 7494 df-mpq 7495 df-enq 7497 df-nqqs 7498 df-plqqs 7499 df-mqqs 7500 df-1nqqs 7501 df-rq 7502 df-ltnqqs 7503 df-enq0 7574 df-nq0 7575 df-0nq0 7576 df-plq0 7577 df-mq0 7578 df-inp 7616 df-i1p 7617 df-iplp 7618 df-iltp 7620 df-enr 7876 df-nr 7877 df-ltr 7880 df-0r 7881 df-1r 7882 |
| This theorem is referenced by: caucvgsrlemcau 7943 caucvgsrlembound 7944 caucvgsrlemgt1 7945 |
| Copyright terms: Public domain | W3C validator |