| 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 36522. (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 36511 | . . . 4 ⊢ (𝜑 → (((2 · 𝑁) · (abs‘𝐶)) ≠ 1 ∧ 1 < (((2 · 𝑁) · (abs‘𝐶)) − 1))) |
| 5 | 4 | simprd 495 | . . 3 ⊢ (𝜑 → 1 < (((2 · 𝑁) · (abs‘𝐶)) − 1)) |
| 6 | 2re 12260 | . . . . . . . . 9 ⊢ 2 ∈ ℝ | |
| 7 | 6 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → 2 ∈ ℝ) |
| 8 | 2 | nnred 12201 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 9 | 7, 8 | remulcld 11204 | . . . . . . 7 ⊢ (𝜑 → (2 · 𝑁) ∈ ℝ) |
| 10 | 1 | knoppndvlem3 36502 | . . . . . . . . . 10 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ (abs‘𝐶) < 1)) |
| 11 | 10 | simpld 494 | . . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 12 | 11 | recnd 11202 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 13 | 12 | abscld 15405 | . . . . . . 7 ⊢ (𝜑 → (abs‘𝐶) ∈ ℝ) |
| 14 | 9, 13 | remulcld 11204 | . . . . . 6 ⊢ (𝜑 → ((2 · 𝑁) · (abs‘𝐶)) ∈ ℝ) |
| 15 | 1red 11175 | . . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 16 | 14, 15 | resubcld 11606 | . . . . 5 ⊢ (𝜑 → (((2 · 𝑁) · (abs‘𝐶)) − 1) ∈ ℝ) |
| 17 | 0red 11177 | . . . . . 6 ⊢ (𝜑 → 0 ∈ ℝ) | |
| 18 | 0lt1 11700 | . . . . . . 7 ⊢ 0 < 1 | |
| 19 | 18 | a1i 11 | . . . . . 6 ⊢ (𝜑 → 0 < 1) |
| 20 | 17, 15, 16, 19, 5 | lttrd 11335 | . . . . 5 ⊢ (𝜑 → 0 < (((2 · 𝑁) · (abs‘𝐶)) − 1)) |
| 21 | 16, 20 | elrpd 12992 | . . . 4 ⊢ (𝜑 → (((2 · 𝑁) · (abs‘𝐶)) − 1) ∈ ℝ+) |
| 22 | 21 | recgt1d 13009 | . . 3 ⊢ (𝜑 → (1 < (((2 · 𝑁) · (abs‘𝐶)) − 1) ↔ (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) < 1)) |
| 23 | 5, 22 | mpbid 232 | . 2 ⊢ (𝜑 → (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) < 1) |
| 24 | 21 | rprecred 13006 | . . . 4 ⊢ (𝜑 → (1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) ∈ ℝ) |
| 25 | 24, 15 | jca 511 | . . 3 ⊢ (𝜑 → ((1 / (((2 · 𝑁) · (abs‘𝐶)) − 1)) ∈ ℝ ∧ 1 ∈ ℝ)) |
| 26 | difrp 12991 | . . 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 2109 ≠ wne 2925 class class class wbr 5107 ‘cfv 6511 (class class class)co 7387 ℝcr 11067 0cc0 11068 1c1 11069 · cmul 11073 < clt 11208 − cmin 11405 -cneg 11406 / cdiv 11835 ℕcn 12186 2c2 12241 ℝ+crp 12951 (,)cioo 13306 abscabs 15200 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-pre-sup 11146 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-sup 9393 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-div 11836 df-nn 12187 df-2 12249 df-3 12250 df-n0 12443 df-z 12530 df-uz 12794 df-rp 12952 df-ioo 13310 df-seq 13967 df-exp 14027 df-cj 15065 df-re 15066 df-im 15067 df-sqrt 15201 df-abs 15202 |
| This theorem is referenced by: knoppndvlem21 36520 knoppndvlem22 36521 |
| Copyright terms: Public domain | W3C validator |