| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > resqrexlemf1 | GIF version | ||
| Description: Lemma for resqrex 11586. 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 5640 | . . 3 ⊢ (𝐹‘1) = (seq1((𝑦 ∈ ℝ+, 𝑧 ∈ ℝ+ ↦ ((𝑦 + (𝐴 / 𝑦)) / 2)), (ℕ × {(1 + 𝐴)}))‘1) |
| 3 | 1zzd 9505 | . . . 4 ⊢ (𝜑 → 1 ∈ ℤ) | |
| 4 | elnnuz 9792 | . . . . 5 ⊢ (𝑎 ∈ ℕ ↔ 𝑎 ∈ (ℤ≥‘1)) | |
| 5 | resqrexlemex.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 6 | resqrexlemex.agt0 | . . . . . 6 ⊢ (𝜑 → 0 ≤ 𝐴) | |
| 7 | 5, 6 | resqrexlem1arp 11565 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ ℕ) → ((ℕ × {(1 + 𝐴)})‘𝑎) ∈ ℝ+) |
| 8 | 4, 7 | sylan2br 288 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ (ℤ≥‘1)) → ((ℕ × {(1 + 𝐴)})‘𝑎) ∈ ℝ+) |
| 9 | 5, 6 | resqrexlemp1rp 11566 | . . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+)) → (𝑎(𝑦 ∈ ℝ+, 𝑧 ∈ ℝ+ ↦ ((𝑦 + (𝐴 / 𝑦)) / 2))𝑏) ∈ ℝ+) |
| 10 | 3, 8, 9 | seq3-1 10723 | . . 3 ⊢ (𝜑 → (seq1((𝑦 ∈ ℝ+, 𝑧 ∈ ℝ+ ↦ ((𝑦 + (𝐴 / 𝑦)) / 2)), (ℕ × {(1 + 𝐴)}))‘1) = ((ℕ × {(1 + 𝐴)})‘1)) |
| 11 | 2, 10 | eqtrid 2276 | . 2 ⊢ (𝜑 → (𝐹‘1) = ((ℕ × {(1 + 𝐴)})‘1)) |
| 12 | 1red 8193 | . . . 4 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 13 | 12, 5 | readdcld 8208 | . . 3 ⊢ (𝜑 → (1 + 𝐴) ∈ ℝ) |
| 14 | 1nn 9153 | . . 3 ⊢ 1 ∈ ℕ | |
| 15 | fvconst2g 5867 | . . 3 ⊢ (((1 + 𝐴) ∈ ℝ ∧ 1 ∈ ℕ) → ((ℕ × {(1 + 𝐴)})‘1) = (1 + 𝐴)) | |
| 16 | 13, 14, 15 | sylancl 413 | . 2 ⊢ (𝜑 → ((ℕ × {(1 + 𝐴)})‘1) = (1 + 𝐴)) |
| 17 | 11, 16 | eqtrd 2264 | 1 ⊢ (𝜑 → (𝐹‘1) = (1 + 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 ∈ wcel 2202 {csn 3669 class class class wbr 4088 × cxp 4723 ‘cfv 5326 (class class class)co 6017 ∈ cmpo 6019 ℝcr 8030 0cc0 8031 1c1 8032 + caddc 8034 ≤ cle 8214 / cdiv 8851 ℕcn 9142 2c2 9193 ℤ≥cuz 9754 ℝ+crp 9887 seqcseq 10708 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-mulrcl 8130 ax-addcom 8131 ax-mulcom 8132 ax-addass 8133 ax-mulass 8134 ax-distr 8135 ax-i2m1 8136 ax-0lt1 8137 ax-1rid 8138 ax-0id 8139 ax-rnegex 8140 ax-precex 8141 ax-cnre 8142 ax-pre-ltirr 8143 ax-pre-ltwlin 8144 ax-pre-lttrn 8145 ax-pre-apti 8146 ax-pre-ltadd 8147 ax-pre-mulgt0 8148 ax-pre-mulext 8149 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-po 4393 df-iso 4394 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-recs 6470 df-frec 6556 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 df-sub 8351 df-neg 8352 df-reap 8754 df-ap 8761 df-div 8852 df-inn 9143 df-2 9201 df-n0 9402 df-z 9479 df-uz 9755 df-rp 9888 df-seqfrec 10709 |
| This theorem is referenced by: resqrexlemover 11570 resqrexlemlo 11573 |
| Copyright terms: Public domain | W3C validator |