| Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pellfundgt1 | Structured version Visualization version GIF version | ||
| Description: Weak lower bound on the Pell fundamental solution. (Contributed by Stefan O'Rear, 19-Sep-2014.) |
| Ref | Expression |
|---|---|
| pellfundgt1 | ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → 1 < (PellFund‘𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1red 11147 | . 2 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → 1 ∈ ℝ) | |
| 2 | eldifi 4085 | . . . . . . 7 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → 𝐷 ∈ ℕ) | |
| 3 | 2 | peano2nnd 12176 | . . . . . 6 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (𝐷 + 1) ∈ ℕ) |
| 4 | 3 | nnrpd 12961 | . . . . 5 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (𝐷 + 1) ∈ ℝ+) |
| 5 | 4 | rpsqrtcld 15349 | . . . 4 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (√‘(𝐷 + 1)) ∈ ℝ+) |
| 6 | 5 | rpred 12963 | . . 3 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (√‘(𝐷 + 1)) ∈ ℝ) |
| 7 | 2 | nnrpd 12961 | . . . . 5 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → 𝐷 ∈ ℝ+) |
| 8 | 7 | rpsqrtcld 15349 | . . . 4 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (√‘𝐷) ∈ ℝ+) |
| 9 | 8 | rpred 12963 | . . 3 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (√‘𝐷) ∈ ℝ) |
| 10 | 6, 9 | readdcld 11175 | . 2 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → ((√‘(𝐷 + 1)) + (√‘𝐷)) ∈ ℝ) |
| 11 | pellfundre 43267 | . 2 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (PellFund‘𝐷) ∈ ℝ) | |
| 12 | sqrt1 15208 | . . . . 5 ⊢ (√‘1) = 1 | |
| 13 | 12, 1 | eqeltrid 2841 | . . . 4 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (√‘1) ∈ ℝ) |
| 14 | 13, 13 | readdcld 11175 | . . 3 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → ((√‘1) + (√‘1)) ∈ ℝ) |
| 15 | 1lt2 12325 | . . . . 5 ⊢ 1 < 2 | |
| 16 | 12, 12 | oveq12i 7382 | . . . . . 6 ⊢ ((√‘1) + (√‘1)) = (1 + 1) |
| 17 | 1p1e2 12279 | . . . . . 6 ⊢ (1 + 1) = 2 | |
| 18 | 16, 17 | eqtri 2760 | . . . . 5 ⊢ ((√‘1) + (√‘1)) = 2 |
| 19 | 15, 18 | breqtrri 5127 | . . . 4 ⊢ 1 < ((√‘1) + (√‘1)) |
| 20 | 19 | a1i 11 | . . 3 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → 1 < ((√‘1) + (√‘1))) |
| 21 | 3 | nnge1d 12207 | . . . . 5 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → 1 ≤ (𝐷 + 1)) |
| 22 | 0le1 11674 | . . . . . . 7 ⊢ 0 ≤ 1 | |
| 23 | 22 | a1i 11 | . . . . . 6 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → 0 ≤ 1) |
| 24 | 2 | nnred 12174 | . . . . . . 7 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → 𝐷 ∈ ℝ) |
| 25 | peano2re 11320 | . . . . . . 7 ⊢ (𝐷 ∈ ℝ → (𝐷 + 1) ∈ ℝ) | |
| 26 | 24, 25 | syl 17 | . . . . . 6 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (𝐷 + 1) ∈ ℝ) |
| 27 | 3 | nnnn0d 12476 | . . . . . . 7 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (𝐷 + 1) ∈ ℕ0) |
| 28 | 27 | nn0ge0d 12479 | . . . . . 6 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → 0 ≤ (𝐷 + 1)) |
| 29 | 1, 23, 26, 28 | sqrtled 15364 | . . . . 5 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (1 ≤ (𝐷 + 1) ↔ (√‘1) ≤ (√‘(𝐷 + 1)))) |
| 30 | 21, 29 | mpbid 232 | . . . 4 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (√‘1) ≤ (√‘(𝐷 + 1))) |
| 31 | 2 | nnge1d 12207 | . . . . 5 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → 1 ≤ 𝐷) |
| 32 | 2 | nnnn0d 12476 | . . . . . . 7 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → 𝐷 ∈ ℕ0) |
| 33 | 32 | nn0ge0d 12479 | . . . . . 6 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → 0 ≤ 𝐷) |
| 34 | 1, 23, 24, 33 | sqrtled 15364 | . . . . 5 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (1 ≤ 𝐷 ↔ (√‘1) ≤ (√‘𝐷))) |
| 35 | 31, 34 | mpbid 232 | . . . 4 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (√‘1) ≤ (√‘𝐷)) |
| 36 | 13, 13, 6, 9, 30, 35 | le2addd 11770 | . . 3 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → ((√‘1) + (√‘1)) ≤ ((√‘(𝐷 + 1)) + (√‘𝐷))) |
| 37 | 1, 14, 10, 20, 36 | ltletrd 11307 | . 2 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → 1 < ((√‘(𝐷 + 1)) + (√‘𝐷))) |
| 38 | pellfundge 43268 | . 2 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → ((√‘(𝐷 + 1)) + (√‘𝐷)) ≤ (PellFund‘𝐷)) | |
| 39 | 1, 10, 11, 37, 38 | ltletrd 11307 | 1 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → 1 < (PellFund‘𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2114 ∖ cdif 3900 class class class wbr 5100 ‘cfv 6502 (class class class)co 7370 ℝcr 11039 0cc0 11040 1c1 11041 + caddc 11043 < clt 11180 ≤ cle 11181 ℕcn 12159 2c2 12214 √csqrt 15170 ◻NNcsquarenn 43222 PellFundcpellfund 43226 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-inf2 9564 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 ax-pre-sup 11118 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-se 5588 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-isom 6511 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-1st 7945 df-2nd 7946 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-1o 8409 df-oadd 8413 df-omul 8414 df-er 8647 df-map 8779 df-en 8898 df-dom 8899 df-sdom 8900 df-fin 8901 df-sup 9359 df-inf 9360 df-oi 9429 df-card 9865 df-acn 9868 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-div 11809 df-nn 12160 df-2 12222 df-3 12223 df-n0 12416 df-xnn0 12489 df-z 12503 df-uz 12766 df-q 12876 df-rp 12920 df-ico 13281 df-fz 13438 df-fl 13726 df-mod 13804 df-seq 13939 df-exp 13999 df-hash 14268 df-cj 15036 df-re 15037 df-im 15038 df-sqrt 15172 df-abs 15173 df-dvds 16194 df-gcd 16436 df-numer 16676 df-denom 16677 df-squarenn 43227 df-pell1qr 43228 df-pell14qr 43229 df-pell1234qr 43230 df-pellfund 43231 |
| This theorem is referenced by: pellfundex 43272 pellfundrp 43274 pellfundne1 43275 pellfund14 43284 |
| Copyright terms: Public domain | W3C validator |