| Mathbox for Asger C. Ipsen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > knoppndvlem20 | Structured version Visualization version GIF version | ||
| Description: Lemma for knoppndv 36589. (Contributed by Asger C. Ipsen, 18-Aug-2021.) |
| Ref | Expression |
|---|---|
| knoppndvlem20.c | ⊢ (𝜑 → 𝐶 ∈ (-1(,)1)) |
| knoppndvlem20.n | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
| knoppndvlem20.1 | ⊢ (𝜑 → 1 < (𝑁 · (abs‘𝐶))) |
| Ref | Expression |
|---|---|
| knoppndvlem20 | ⊢ (𝜑 → (1 − (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1))) ∈ ℝ+) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | knoppndvlem20.c | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ (-1(,)1)) | |
| 2 | knoppndvlem20.n | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
| 3 | knoppndvlem20.1 | . . . . 5 ⊢ (𝜑 → 1 < (𝑁 · (abs‘𝐶))) | |
| 4 | 1, 2, 3 | knoppndvlem12 36578 | . . . 4 ⊢ (𝜑 → (((2 · 𝑁) · (abs‘𝐶)) ≠ 1 ∧ 1 < (((2 · 𝑁) · (abs‘𝐶)) − 1))) |
| 5 | 4 | simprd 495 | . . 3 ⊢ (𝜑 → 1 < (((2 · 𝑁) · (abs‘𝐶)) − 1)) |
| 6 | 2re 12209 | . . . . . . . . 9 ⊢ 2 ∈ ℝ | |
| 7 | 6 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → 2 ∈ ℝ) |
| 8 | 2 | nnred 12150 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 9 | 7, 8 | remulcld 11152 | . . . . . . 7 ⊢ (𝜑 → (2 · 𝑁) ∈ ℝ) |
| 10 | 1 | knoppndvlem3 36569 | . . . . . . . . . 10 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ (abs‘𝐶) < 1)) |
| 11 | 10 | simpld 494 | . . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 12 | 11 | recnd 11150 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 13 | 12 | abscld 15356 | . . . . . . 7 ⊢ (𝜑 → (abs‘𝐶) ∈ ℝ) |
| 14 | 9, 13 | remulcld 11152 | . . . . . 6 ⊢ (𝜑 → ((2 · 𝑁) · (abs‘𝐶)) ∈ ℝ) |
| 15 | 1red 11123 | . . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 16 | 14, 15 | resubcld 11555 | . . . . 5 ⊢ (𝜑 → (((2 · 𝑁) · (abs‘𝐶)) − 1) ∈ ℝ) |
| 17 | 0red 11125 | . . . . . 6 ⊢ (𝜑 → 0 ∈ ℝ) | |
| 18 | 0lt1 11649 | . . . . . . 7 ⊢ 0 < 1 | |
| 19 | 18 | a1i 11 | . . . . . 6 ⊢ (𝜑 → 0 < 1) |
| 20 | 17, 15, 16, 19, 5 | lttrd 11284 | . . . . 5 ⊢ (𝜑 → 0 < (((2 · 𝑁) · (abs‘𝐶)) − 1)) |
| 21 | 16, 20 | elrpd 12941 | . . . 4 ⊢ (𝜑 → (((2 · 𝑁) · (abs‘𝐶)) − 1) ∈ ℝ+) |
| 22 | 21 | recgt1d 12958 | . . 3 ⊢ (𝜑 → (1 < (((2 · 𝑁) · (abs‘𝐶)) − 1) ↔ (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) < 1)) |
| 23 | 5, 22 | mpbid 232 | . 2 ⊢ (𝜑 → (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) < 1) |
| 24 | 21 | rprecred 12955 | . . . 4 ⊢ (𝜑 → (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) ∈ ℝ) |
| 25 | 24, 15 | jca 511 | . . 3 ⊢ (𝜑 → ((1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) ∈ ℝ ∧ 1 ∈ ℝ)) |
| 26 | difrp 12940 | . . 3 ⊢ (((1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) ∈ ℝ ∧ 1 ∈ ℝ) → ((1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) < 1 ↔ (1 − (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1))) ∈ ℝ+)) | |
| 27 | 25, 26 | syl 17 | . 2 ⊢ (𝜑 → ((1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) < 1 ↔ (1 − (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1))) ∈ ℝ+)) |
| 28 | 23, 27 | mpbid 232 | 1 ⊢ (𝜑 → (1 − (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1))) ∈ ℝ+) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2113 ≠ wne 2930 class class class wbr 5095 ‘cfv 6489 (class class class)co 7355 ℝcr 11015 0cc0 11016 1c1 11017 · cmul 11021 < clt 11156 − cmin 11354 -cneg 11355 / cdiv 11784 ℕcn 12135 2c2 12190 ℝ+crp 12900 (,)cioo 13255 abscabs 15151 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-cnex 11072 ax-resscn 11073 ax-1cn 11074 ax-icn 11075 ax-addcl 11076 ax-addrcl 11077 ax-mulcl 11078 ax-mulrcl 11079 ax-mulcom 11080 ax-addass 11081 ax-mulass 11082 ax-distr 11083 ax-i2m1 11084 ax-1ne0 11085 ax-1rid 11086 ax-rnegex 11087 ax-rrecex 11088 ax-cnre 11089 ax-pre-lttri 11090 ax-pre-lttrn 11091 ax-pre-ltadd 11092 ax-pre-mulgt0 11093 ax-pre-sup 11094 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-om 7806 df-1st 7930 df-2nd 7931 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-er 8631 df-en 8879 df-dom 8880 df-sdom 8881 df-sup 9336 df-pnf 11158 df-mnf 11159 df-xr 11160 df-ltxr 11161 df-le 11162 df-sub 11356 df-neg 11357 df-div 11785 df-nn 12136 df-2 12198 df-3 12199 df-n0 12392 df-z 12479 df-uz 12743 df-rp 12901 df-ioo 13259 df-seq 13919 df-exp 13979 df-cj 15016 df-re 15017 df-im 15018 df-sqrt 15152 df-abs 15153 |
| This theorem is referenced by: knoppndvlem21 36587 knoppndvlem22 36588 |
| Copyright terms: Public domain | W3C validator |