| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > logcnlem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for logcn 26572. (Contributed by Mario Carneiro, 25-Feb-2015.) |
| Ref | Expression |
|---|---|
| logcn.d | ⊢ 𝐷 = (ℂ ∖ (-∞(,]0)) |
| logcnlem.s | ⊢ 𝑆 = if(𝐴 ∈ ℝ+, 𝐴, (abs‘(ℑ‘𝐴))) |
| logcnlem.t | ⊢ 𝑇 = ((abs‘𝐴) · (𝑅 / (1 + 𝑅))) |
| logcnlem.a | ⊢ (𝜑 → 𝐴 ∈ 𝐷) |
| logcnlem.r | ⊢ (𝜑 → 𝑅 ∈ ℝ+) |
| Ref | Expression |
|---|---|
| logcnlem2 | ⊢ (𝜑 → if(𝑆 ≤ 𝑇, 𝑆, 𝑇) ∈ ℝ+) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | logcnlem.s | . . 3 ⊢ 𝑆 = if(𝐴 ∈ ℝ+, 𝐴, (abs‘(ℑ‘𝐴))) | |
| 2 | simpr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ+) → 𝐴 ∈ ℝ+) | |
| 3 | logcnlem.a | . . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ 𝐷) | |
| 4 | logcn.d | . . . . . . . . . . 11 ⊢ 𝐷 = (ℂ ∖ (-∞(,]0)) | |
| 5 | 4 | ellogdm 26564 | . . . . . . . . . 10 ⊢ (𝐴 ∈ 𝐷 ↔ (𝐴 ∈ ℂ ∧ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ+))) |
| 6 | 5 | simplbi 497 | . . . . . . . . 9 ⊢ (𝐴 ∈ 𝐷 → 𝐴 ∈ ℂ) |
| 7 | 3, 6 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| 8 | 7 | imcld 15120 | . . . . . . 7 ⊢ (𝜑 → (ℑ‘𝐴) ∈ ℝ) |
| 9 | 8 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐴 ∈ ℝ+) → (ℑ‘𝐴) ∈ ℝ) |
| 10 | 9 | recnd 11162 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐴 ∈ ℝ+) → (ℑ‘𝐴) ∈ ℂ) |
| 11 | reim0b 15044 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℂ → (𝐴 ∈ ℝ ↔ (ℑ‘𝐴) = 0)) | |
| 12 | 7, 11 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 ∈ ℝ ↔ (ℑ‘𝐴) = 0)) |
| 13 | 5 | simprbi 496 | . . . . . . . . 9 ⊢ (𝐴 ∈ 𝐷 → (𝐴 ∈ ℝ → 𝐴 ∈ ℝ+)) |
| 14 | 3, 13 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 ∈ ℝ → 𝐴 ∈ ℝ+)) |
| 15 | 12, 14 | sylbird 260 | . . . . . . 7 ⊢ (𝜑 → ((ℑ‘𝐴) = 0 → 𝐴 ∈ ℝ+)) |
| 16 | 15 | necon3bd 2939 | . . . . . 6 ⊢ (𝜑 → (¬ 𝐴 ∈ ℝ+ → (ℑ‘𝐴) ≠ 0)) |
| 17 | 16 | imp 406 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐴 ∈ ℝ+) → (ℑ‘𝐴) ≠ 0) |
| 18 | 10, 17 | absrpcld 15376 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 ∈ ℝ+) → (abs‘(ℑ‘𝐴)) ∈ ℝ+) |
| 19 | 2, 18 | ifclda 4514 | . . 3 ⊢ (𝜑 → if(𝐴 ∈ ℝ+, 𝐴, (abs‘(ℑ‘𝐴))) ∈ ℝ+) |
| 20 | 1, 19 | eqeltrid 2832 | . 2 ⊢ (𝜑 → 𝑆 ∈ ℝ+) |
| 21 | logcnlem.t | . . 3 ⊢ 𝑇 = ((abs‘𝐴) · (𝑅 / (1 + 𝑅))) | |
| 22 | 4 | logdmn0 26565 | . . . . . 6 ⊢ (𝐴 ∈ 𝐷 → 𝐴 ≠ 0) |
| 23 | 3, 22 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐴 ≠ 0) |
| 24 | 7, 23 | absrpcld 15376 | . . . 4 ⊢ (𝜑 → (abs‘𝐴) ∈ ℝ+) |
| 25 | logcnlem.r | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ ℝ+) | |
| 26 | 1rp 12915 | . . . . . 6 ⊢ 1 ∈ ℝ+ | |
| 27 | rpaddcl 12935 | . . . . . 6 ⊢ ((1 ∈ ℝ+ ∧ 𝑅 ∈ ℝ+) → (1 + 𝑅) ∈ ℝ+) | |
| 28 | 26, 25, 27 | sylancr 587 | . . . . 5 ⊢ (𝜑 → (1 + 𝑅) ∈ ℝ+) |
| 29 | 25, 28 | rpdivcld 12972 | . . . 4 ⊢ (𝜑 → (𝑅 / (1 + 𝑅)) ∈ ℝ+) |
| 30 | 24, 29 | rpmulcld 12971 | . . 3 ⊢ (𝜑 → ((abs‘𝐴) · (𝑅 / (1 + 𝑅))) ∈ ℝ+) |
| 31 | 21, 30 | eqeltrid 2832 | . 2 ⊢ (𝜑 → 𝑇 ∈ ℝ+) |
| 32 | 20, 31 | ifcld 4525 | 1 ⊢ (𝜑 → if(𝑆 ≤ 𝑇, 𝑆, 𝑇) ∈ ℝ+) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∖ cdif 3902 ifcif 4478 class class class wbr 5095 ‘cfv 6486 (class class class)co 7353 ℂcc 11026 ℝcr 11027 0cc0 11028 1c1 11029 + caddc 11031 · cmul 11033 -∞cmnf 11166 ≤ cle 11169 / cdiv 11795 ℝ+crp 12911 (,]cioc 13267 ℑcim 15023 abscabs 15159 |
| 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 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-pre-sup 11106 |
| 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 3345 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8632 df-en 8880 df-dom 8881 df-sdom 8882 df-sup 9351 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11367 df-neg 11368 df-div 11796 df-nn 12147 df-2 12209 df-3 12210 df-n0 12403 df-z 12490 df-uz 12754 df-rp 12912 df-ioc 13271 df-seq 13927 df-exp 13987 df-cj 15024 df-re 15025 df-im 15026 df-sqrt 15160 df-abs 15161 |
| This theorem is referenced by: logcnlem5 26571 |
| Copyright terms: Public domain | W3C validator |