| 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 37104. (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 37093 | . . . 4 ⊢ (𝜑 → (((2 · 𝑁) · (abs‘𝐶)) ≠ 1 ∧ 1 < (((2 · 𝑁) · (abs‘𝐶)) − 1))) |
| 5 | 4 | simprd 500 | . . 3 ⊢ (𝜑 → 1 < (((2 · 𝑁) · (abs‘𝐶)) − 1)) |
| 6 | 2re 12316 | . . . . . . . . 9 ⊢ 2 ∈ ℝ | |
| 7 | 6 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → 2 ∈ ℝ) |
| 8 | 2 | nnred 12249 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 9 | 7, 8 | remulcld 11240 | . . . . . . 7 ⊢ (𝜑 → (2 · 𝑁) ∈ ℝ) |
| 10 | 1 | knoppndvlem3 37084 | . . . . . . . . . 10 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ (abs‘𝐶) < 1)) |
| 11 | 10 | simpld 499 | . . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 12 | 11 | recnd 11238 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 13 | 12 | abscld 15492 | . . . . . . 7 ⊢ (𝜑 → (abs‘𝐶) ∈ ℝ) |
| 14 | 9, 13 | remulcld 11240 | . . . . . 6 ⊢ (𝜑 → ((2 · 𝑁) · (abs‘𝐶)) ∈ ℝ) |
| 15 | 1red 11210 | . . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 16 | 14, 15 | resubcld 11643 | . . . . 5 ⊢ (𝜑 → (((2 · 𝑁) · (abs‘𝐶)) − 1) ∈ ℝ) |
| 17 | 0red 11212 | . . . . . 6 ⊢ (𝜑 → 0 ∈ ℝ) | |
| 18 | 0lt1 11737 | . . . . . . 7 ⊢ 0 < 1 | |
| 19 | 18 | a1i 11 | . . . . . 6 ⊢ (𝜑 → 0 < 1) |
| 20 | 17, 15, 16, 19, 5 | lttrd 11372 | . . . . 5 ⊢ (𝜑 → 0 < (((2 · 𝑁) · (abs‘𝐶)) − 1)) |
| 21 | 16, 20 | elrpd 13058 | . . . 4 ⊢ (𝜑 → (((2 · 𝑁) · (abs‘𝐶)) − 1) ∈ ℝ+) |
| 22 | 21 | recgt1d 13075 | . . 3 ⊢ (𝜑 → (1 < (((2 · 𝑁) · (abs‘𝐶)) − 1) ↔ (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) < 1)) |
| 23 | 5, 22 | mpbid 235 | . 2 ⊢ (𝜑 → (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) < 1) |
| 24 | 21 | rprecred 13072 | . . . 4 ⊢ (𝜑 → (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) ∈ ℝ) |
| 25 | 24, 15 | jca 520 | . . 3 ⊢ (𝜑 → ((1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) ∈ ℝ ∧ 1 ∈ ℝ)) |
| 26 | difrp 13057 | . . 3 ⊢ (((1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) ∈ ℝ ∧ 1 ∈ ℝ) → ((1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) < 1 ↔ (1 − (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1))) ∈ ℝ+)) | |
| 27 | 25, 26 | syl 18 | . 2 ⊢ (𝜑 → ((1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) < 1 ↔ (1 − (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1))) ∈ ℝ+)) |
| 28 | 23, 27 | mpbid 235 | 1 ⊢ (𝜑 → (1 − (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1))) ∈ ℝ+) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∈ wcel 2143 ≠ wne 2958 class class class wbr 5110 ‘cfv 6538 (class class class)co 7412 ℝcr 11100 0cc0 11101 1c1 11102 · cmul 11106 < clt 11244 − cmin 11442 -cneg 11443 / cdiv 11872 ℕcn 12234 2c2 12296 ℝ+crp 13017 (,)cioo 13373 abscabs 15287 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 ax-pre-sup 11179 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-sup 9403 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-div 11873 df-nn 12235 df-2 12304 df-3 12305 df-n0 12506 df-z 12593 df-uz 12864 df-rp 13018 df-ioo 13377 df-seq 14040 df-exp 14100 df-cj 15152 df-re 15153 df-im 15154 df-sqrt 15288 df-abs 15289 |
| This theorem is referenced by: knoppndvlem21 37102 knoppndvlem22 37103 |
| Copyright terms: Public domain | W3C validator |