| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > resqrexlemf1 | GIF version | ||
| Description: Lemma for resqrex 11577. Initial value. Although this sequence converges to the square root with any positive initial value, this choice makes various steps in the proof of convergence easier. (Contributed by Mario Carneiro and Jim Kingdon, 27-Jul-2021.) (Revised by Jim Kingdon, 16-Oct-2022.) |
| Ref | Expression |
|---|---|
| resqrexlemex.seq | ⊢ 𝐹 = seq1((𝑦 ∈ ℝ+, 𝑧 ∈ ℝ+ ↦ ((𝑦 + (𝐴 / 𝑦)) / 2)), (ℕ × {(1 + 𝐴)})) |
| resqrexlemex.a | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| resqrexlemex.agt0 | ⊢ (𝜑 → 0 ≤ 𝐴) |
| Ref | Expression |
|---|---|
| resqrexlemf1 | ⊢ (𝜑 → (𝐹‘1) = (1 + 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | resqrexlemex.seq | . . . 4 ⊢ 𝐹 = seq1((𝑦 ∈ ℝ+, 𝑧 ∈ ℝ+ ↦ ((𝑦 + (𝐴 / 𝑦)) / 2)), (ℕ × {(1 + 𝐴)})) | |
| 2 | 1 | fveq1i 5636 | . . 3 ⊢ (𝐹‘1) = (seq1((𝑦 ∈ ℝ+, 𝑧 ∈ ℝ+ ↦ ((𝑦 + (𝐴 / 𝑦)) / 2)), (ℕ × {(1 + 𝐴)}))‘1) |
| 3 | 1zzd 9496 | . . . 4 ⊢ (𝜑 → 1 ∈ ℤ) | |
| 4 | elnnuz 9783 | . . . . 5 ⊢ (𝑎 ∈ ℕ ↔ 𝑎 ∈ (ℤ≥‘1)) | |
| 5 | resqrexlemex.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 6 | resqrexlemex.agt0 | . . . . . 6 ⊢ (𝜑 → 0 ≤ 𝐴) | |
| 7 | 5, 6 | resqrexlem1arp 11556 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ ℕ) → ((ℕ × {(1 + 𝐴)})‘𝑎) ∈ ℝ+) |
| 8 | 4, 7 | sylan2br 288 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ (ℤ≥‘1)) → ((ℕ × {(1 + 𝐴)})‘𝑎) ∈ ℝ+) |
| 9 | 5, 6 | resqrexlemp1rp 11557 | . . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+)) → (𝑎(𝑦 ∈ ℝ+, 𝑧 ∈ ℝ+ ↦ ((𝑦 + (𝐴 / 𝑦)) / 2))𝑏) ∈ ℝ+) |
| 10 | 3, 8, 9 | seq3-1 10714 | . . 3 ⊢ (𝜑 → (seq1((𝑦 ∈ ℝ+, 𝑧 ∈ ℝ+ ↦ ((𝑦 + (𝐴 / 𝑦)) / 2)), (ℕ × {(1 + 𝐴)}))‘1) = ((ℕ × {(1 + 𝐴)})‘1)) |
| 11 | 2, 10 | eqtrid 2274 | . 2 ⊢ (𝜑 → (𝐹‘1) = ((ℕ × {(1 + 𝐴)})‘1)) |
| 12 | 1red 8184 | . . . 4 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 13 | 12, 5 | readdcld 8199 | . . 3 ⊢ (𝜑 → (1 + 𝐴) ∈ ℝ) |
| 14 | 1nn 9144 | . . 3 ⊢ 1 ∈ ℕ | |
| 15 | fvconst2g 5863 | . . 3 ⊢ (((1 + 𝐴) ∈ ℝ ∧ 1 ∈ ℕ) → ((ℕ × {(1 + 𝐴)})‘1) = (1 + 𝐴)) | |
| 16 | 13, 14, 15 | sylancl 413 | . 2 ⊢ (𝜑 → ((ℕ × {(1 + 𝐴)})‘1) = (1 + 𝐴)) |
| 17 | 11, 16 | eqtrd 2262 | 1 ⊢ (𝜑 → (𝐹‘1) = (1 + 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 {csn 3667 class class class wbr 4086 × cxp 4721 ‘cfv 5324 (class class class)co 6013 ∈ cmpo 6015 ℝcr 8021 0cc0 8022 1c1 8023 + caddc 8025 ≤ cle 8205 / cdiv 8842 ℕcn 9133 2c2 9184 ℤ≥cuz 9745 ℝ+crp 9878 seqcseq 10699 |
| 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 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-mulrcl 8121 ax-addcom 8122 ax-mulcom 8123 ax-addass 8124 ax-mulass 8125 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-1rid 8129 ax-0id 8130 ax-rnegex 8131 ax-precex 8132 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-apti 8137 ax-pre-ltadd 8138 ax-pre-mulgt0 8139 ax-pre-mulext 8140 |
| 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 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-po 4391 df-iso 4392 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-frec 6552 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-reap 8745 df-ap 8752 df-div 8843 df-inn 9134 df-2 9192 df-n0 9393 df-z 9470 df-uz 9746 df-rp 9879 df-seqfrec 10700 |
| This theorem is referenced by: resqrexlemover 11561 resqrexlemlo 11564 |
| Copyright terms: Public domain | W3C validator |