![]() |
Mathbox for Asger C. Ipsen |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > knoppndvlem12 | Structured version Visualization version GIF version |
Description: Lemma for knoppndv 32852. (Contributed by Asger C. Ipsen, 29-Jun-2021.) (Revised by Asger C. Ipsen, 5-Jul-2021.) |
Ref | Expression |
---|---|
knoppndvlem12.c | ⊢ (𝜑 → 𝐶 ∈ (-1(,)1)) |
knoppndvlem12.n | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
knoppndvlem12.1 | ⊢ (𝜑 → 1 < (𝑁 · (abs‘𝐶))) |
Ref | Expression |
---|---|
knoppndvlem12 | ⊢ (𝜑 → (((2 · 𝑁) · (abs‘𝐶)) ≠ 1 ∧ 1 < (((2 · 𝑁) · (abs‘𝐶)) − 1))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1red 10267 | . . . 4 ⊢ (𝜑 → 1 ∈ ℝ) | |
2 | 2re 11302 | . . . . . 6 ⊢ 2 ∈ ℝ | |
3 | 2 | a1i 11 | . . . . 5 ⊢ (𝜑 → 2 ∈ ℝ) |
4 | knoppndvlem12.n | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
5 | nnre 11239 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ) | |
6 | 4, 5 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
7 | 3, 6 | remulcld 10282 | . . . . . 6 ⊢ (𝜑 → (2 · 𝑁) ∈ ℝ) |
8 | knoppndvlem12.c | . . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ (-1(,)1)) | |
9 | 8 | knoppndvlem3 32832 | . . . . . . . . 9 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ (abs‘𝐶) < 1)) |
10 | 9 | simpld 477 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
11 | 10 | recnd 10280 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
12 | 11 | abscld 14394 | . . . . . 6 ⊢ (𝜑 → (abs‘𝐶) ∈ ℝ) |
13 | 7, 12 | remulcld 10282 | . . . . 5 ⊢ (𝜑 → ((2 · 𝑁) · (abs‘𝐶)) ∈ ℝ) |
14 | 1lt2 11406 | . . . . . 6 ⊢ 1 < 2 | |
15 | 14 | a1i 11 | . . . . 5 ⊢ (𝜑 → 1 < 2) |
16 | 2t1e2 11388 | . . . . . . . . 9 ⊢ (2 · 1) = 2 | |
17 | 16 | eqcomi 2769 | . . . . . . . 8 ⊢ 2 = (2 · 1) |
18 | 17 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → 2 = (2 · 1)) |
19 | 6, 12 | remulcld 10282 | . . . . . . . 8 ⊢ (𝜑 → (𝑁 · (abs‘𝐶)) ∈ ℝ) |
20 | 2rp 12050 | . . . . . . . . 9 ⊢ 2 ∈ ℝ+ | |
21 | 20 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → 2 ∈ ℝ+) |
22 | knoppndvlem12.1 | . . . . . . . 8 ⊢ (𝜑 → 1 < (𝑁 · (abs‘𝐶))) | |
23 | 1, 19, 21, 22 | ltmul2dd 12141 | . . . . . . 7 ⊢ (𝜑 → (2 · 1) < (2 · (𝑁 · (abs‘𝐶)))) |
24 | 18, 23 | eqbrtrd 4826 | . . . . . 6 ⊢ (𝜑 → 2 < (2 · (𝑁 · (abs‘𝐶)))) |
25 | 3 | recnd 10280 | . . . . . . . 8 ⊢ (𝜑 → 2 ∈ ℂ) |
26 | 6 | recnd 10280 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
27 | 12 | recnd 10280 | . . . . . . . 8 ⊢ (𝜑 → (abs‘𝐶) ∈ ℂ) |
28 | 25, 26, 27 | mulassd 10275 | . . . . . . 7 ⊢ (𝜑 → ((2 · 𝑁) · (abs‘𝐶)) = (2 · (𝑁 · (abs‘𝐶)))) |
29 | 28 | eqcomd 2766 | . . . . . 6 ⊢ (𝜑 → (2 · (𝑁 · (abs‘𝐶))) = ((2 · 𝑁) · (abs‘𝐶))) |
30 | 24, 29 | breqtrd 4830 | . . . . 5 ⊢ (𝜑 → 2 < ((2 · 𝑁) · (abs‘𝐶))) |
31 | 1, 3, 13, 15, 30 | lttrd 10410 | . . . 4 ⊢ (𝜑 → 1 < ((2 · 𝑁) · (abs‘𝐶))) |
32 | 1, 31 | jca 555 | . . 3 ⊢ (𝜑 → (1 ∈ ℝ ∧ 1 < ((2 · 𝑁) · (abs‘𝐶)))) |
33 | ltne 10346 | . . 3 ⊢ ((1 ∈ ℝ ∧ 1 < ((2 · 𝑁) · (abs‘𝐶))) → ((2 · 𝑁) · (abs‘𝐶)) ≠ 1) | |
34 | 32, 33 | syl 17 | . 2 ⊢ (𝜑 → ((2 · 𝑁) · (abs‘𝐶)) ≠ 1) |
35 | 1p1e2 11346 | . . . . 5 ⊢ (1 + 1) = 2 | |
36 | 35 | a1i 11 | . . . 4 ⊢ (𝜑 → (1 + 1) = 2) |
37 | 36, 30 | eqbrtrd 4826 | . . 3 ⊢ (𝜑 → (1 + 1) < ((2 · 𝑁) · (abs‘𝐶))) |
38 | 1, 1, 13 | ltaddsubd 10839 | . . 3 ⊢ (𝜑 → ((1 + 1) < ((2 · 𝑁) · (abs‘𝐶)) ↔ 1 < (((2 · 𝑁) · (abs‘𝐶)) − 1))) |
39 | 37, 38 | mpbid 222 | . 2 ⊢ (𝜑 → 1 < (((2 · 𝑁) · (abs‘𝐶)) − 1)) |
40 | 34, 39 | jca 555 | 1 ⊢ (𝜑 → (((2 · 𝑁) · (abs‘𝐶)) ≠ 1 ∧ 1 < (((2 · 𝑁) · (abs‘𝐶)) − 1))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1632 ∈ wcel 2139 ≠ wne 2932 class class class wbr 4804 ‘cfv 6049 (class class class)co 6814 ℝcr 10147 1c1 10149 + caddc 10151 · cmul 10153 < clt 10286 − cmin 10478 -cneg 10479 ℕcn 11232 2c2 11282 ℝ+crp 12045 (,)cioo 12388 abscabs 14193 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-8 2141 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 ax-sep 4933 ax-nul 4941 ax-pow 4992 ax-pr 5055 ax-un 7115 ax-cnex 10204 ax-resscn 10205 ax-1cn 10206 ax-icn 10207 ax-addcl 10208 ax-addrcl 10209 ax-mulcl 10210 ax-mulrcl 10211 ax-mulcom 10212 ax-addass 10213 ax-mulass 10214 ax-distr 10215 ax-i2m1 10216 ax-1ne0 10217 ax-1rid 10218 ax-rnegex 10219 ax-rrecex 10220 ax-cnre 10221 ax-pre-lttri 10222 ax-pre-lttrn 10223 ax-pre-ltadd 10224 ax-pre-mulgt0 10225 ax-pre-sup 10226 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2047 df-eu 2611 df-mo 2612 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ne 2933 df-nel 3036 df-ral 3055 df-rex 3056 df-reu 3057 df-rmo 3058 df-rab 3059 df-v 3342 df-sbc 3577 df-csb 3675 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-pss 3731 df-nul 4059 df-if 4231 df-pw 4304 df-sn 4322 df-pr 4324 df-tp 4326 df-op 4328 df-uni 4589 df-iun 4674 df-br 4805 df-opab 4865 df-mpt 4882 df-tr 4905 df-id 5174 df-eprel 5179 df-po 5187 df-so 5188 df-fr 5225 df-we 5227 df-xp 5272 df-rel 5273 df-cnv 5274 df-co 5275 df-dm 5276 df-rn 5277 df-res 5278 df-ima 5279 df-pred 5841 df-ord 5887 df-on 5888 df-lim 5889 df-suc 5890 df-iota 6012 df-fun 6051 df-fn 6052 df-f 6053 df-f1 6054 df-fo 6055 df-f1o 6056 df-fv 6057 df-riota 6775 df-ov 6817 df-oprab 6818 df-mpt2 6819 df-om 7232 df-1st 7334 df-2nd 7335 df-wrecs 7577 df-recs 7638 df-rdg 7676 df-er 7913 df-en 8124 df-dom 8125 df-sdom 8126 df-sup 8515 df-pnf 10288 df-mnf 10289 df-xr 10290 df-ltxr 10291 df-le 10292 df-sub 10480 df-neg 10481 df-div 10897 df-nn 11233 df-2 11291 df-3 11292 df-n0 11505 df-z 11590 df-uz 11900 df-rp 12046 df-ioo 12392 df-seq 13016 df-exp 13075 df-cj 14058 df-re 14059 df-im 14060 df-sqrt 14194 df-abs 14195 |
This theorem is referenced by: knoppndvlem14 32843 knoppndvlem15 32844 knoppndvlem17 32846 knoppndvlem20 32849 |
Copyright terms: Public domain | W3C validator |