| 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 36810. (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 36799 | . . . 4 ⊢ (𝜑 → (((2 · 𝑁) · (abs‘𝐶)) ≠ 1 ∧ 1 < (((2 · 𝑁) · (abs‘𝐶)) − 1))) |
| 5 | 4 | simprd 495 | . . 3 ⊢ (𝜑 → 1 < (((2 · 𝑁) · (abs‘𝐶)) − 1)) |
| 6 | 2re 12246 | . . . . . . . . 9 ⊢ 2 ∈ ℝ | |
| 7 | 6 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → 2 ∈ ℝ) |
| 8 | 2 | nnred 12180 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 9 | 7, 8 | remulcld 11166 | . . . . . . 7 ⊢ (𝜑 → (2 · 𝑁) ∈ ℝ) |
| 10 | 1 | knoppndvlem3 36790 | . . . . . . . . . 10 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ (abs‘𝐶) < 1)) |
| 11 | 10 | simpld 494 | . . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 12 | 11 | recnd 11164 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 13 | 12 | abscld 15392 | . . . . . . 7 ⊢ (𝜑 → (abs‘𝐶) ∈ ℝ) |
| 14 | 9, 13 | remulcld 11166 | . . . . . 6 ⊢ (𝜑 → ((2 · 𝑁) · (abs‘𝐶)) ∈ ℝ) |
| 15 | 1red 11136 | . . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 16 | 14, 15 | resubcld 11569 | . . . . 5 ⊢ (𝜑 → (((2 · 𝑁) · (abs‘𝐶)) − 1) ∈ ℝ) |
| 17 | 0red 11138 | . . . . . 6 ⊢ (𝜑 → 0 ∈ ℝ) | |
| 18 | 0lt1 11663 | . . . . . . 7 ⊢ 0 < 1 | |
| 19 | 18 | a1i 11 | . . . . . 6 ⊢ (𝜑 → 0 < 1) |
| 20 | 17, 15, 16, 19, 5 | lttrd 11298 | . . . . 5 ⊢ (𝜑 → 0 < (((2 · 𝑁) · (abs‘𝐶)) − 1)) |
| 21 | 16, 20 | elrpd 12974 | . . . 4 ⊢ (𝜑 → (((2 · 𝑁) · (abs‘𝐶)) − 1) ∈ ℝ+) |
| 22 | 21 | recgt1d 12991 | . . 3 ⊢ (𝜑 → (1 < (((2 · 𝑁) · (abs‘𝐶)) − 1) ↔ (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) < 1)) |
| 23 | 5, 22 | mpbid 232 | . 2 ⊢ (𝜑 → (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) < 1) |
| 24 | 21 | rprecred 12988 | . . . 4 ⊢ (𝜑 → (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) ∈ ℝ) |
| 25 | 24, 15 | jca 511 | . . 3 ⊢ (𝜑 → ((1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) ∈ ℝ ∧ 1 ∈ ℝ)) |
| 26 | difrp 12973 | . . 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 2114 ≠ wne 2933 class class class wbr 5086 ‘cfv 6492 (class class class)co 7360 ℝcr 11028 0cc0 11029 1c1 11030 · cmul 11034 < clt 11170 − cmin 11368 -cneg 11369 / cdiv 11798 ℕcn 12165 2c2 12227 ℝ+crp 12933 (,)cioo 13289 abscabs 15187 |
| 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-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 |
| 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 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-sup 9348 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-n0 12429 df-z 12516 df-uz 12780 df-rp 12934 df-ioo 13293 df-seq 13955 df-exp 14015 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 |
| This theorem is referenced by: knoppndvlem21 36808 knoppndvlem22 36809 |
| Copyright terms: Public domain | W3C validator |