![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > logdmnrp | Structured version Visualization version GIF version |
Description: A number in the continuous domain of log is not a strictly negative number. (Contributed by Mario Carneiro, 18-Feb-2015.) |
Ref | Expression |
---|---|
logcn.d | ⊢ 𝐷 = (ℂ ∖ (-∞(,]0)) |
Ref | Expression |
---|---|
logdmnrp | ⊢ (𝐴 ∈ 𝐷 → ¬ -𝐴 ∈ ℝ+) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eldifn 3766 | . . 3 ⊢ (𝐴 ∈ (ℂ ∖ (-∞(,]0)) → ¬ 𝐴 ∈ (-∞(,]0)) | |
2 | logcn.d | . . 3 ⊢ 𝐷 = (ℂ ∖ (-∞(,]0)) | |
3 | 1, 2 | eleq2s 2748 | . 2 ⊢ (𝐴 ∈ 𝐷 → ¬ 𝐴 ∈ (-∞(,]0)) |
4 | rpre 11877 | . . . . 5 ⊢ (-𝐴 ∈ ℝ+ → -𝐴 ∈ ℝ) | |
5 | 2 | ellogdm 24430 | . . . . . . 7 ⊢ (𝐴 ∈ 𝐷 ↔ (𝐴 ∈ ℂ ∧ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ+))) |
6 | 5 | simplbi 475 | . . . . . 6 ⊢ (𝐴 ∈ 𝐷 → 𝐴 ∈ ℂ) |
7 | negreb 10384 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (-𝐴 ∈ ℝ ↔ 𝐴 ∈ ℝ)) | |
8 | 6, 7 | syl 17 | . . . . 5 ⊢ (𝐴 ∈ 𝐷 → (-𝐴 ∈ ℝ ↔ 𝐴 ∈ ℝ)) |
9 | 4, 8 | syl5ib 234 | . . . 4 ⊢ (𝐴 ∈ 𝐷 → (-𝐴 ∈ ℝ+ → 𝐴 ∈ ℝ)) |
10 | 9 | imp 444 | . . 3 ⊢ ((𝐴 ∈ 𝐷 ∧ -𝐴 ∈ ℝ+) → 𝐴 ∈ ℝ) |
11 | mnflt 11995 | . . . 4 ⊢ (𝐴 ∈ ℝ → -∞ < 𝐴) | |
12 | 10, 11 | syl 17 | . . 3 ⊢ ((𝐴 ∈ 𝐷 ∧ -𝐴 ∈ ℝ+) → -∞ < 𝐴) |
13 | rpgt0 11882 | . . . . . 6 ⊢ (-𝐴 ∈ ℝ+ → 0 < -𝐴) | |
14 | 13 | adantl 481 | . . . . 5 ⊢ ((𝐴 ∈ 𝐷 ∧ -𝐴 ∈ ℝ+) → 0 < -𝐴) |
15 | 10 | lt0neg1d 10635 | . . . . 5 ⊢ ((𝐴 ∈ 𝐷 ∧ -𝐴 ∈ ℝ+) → (𝐴 < 0 ↔ 0 < -𝐴)) |
16 | 14, 15 | mpbird 247 | . . . 4 ⊢ ((𝐴 ∈ 𝐷 ∧ -𝐴 ∈ ℝ+) → 𝐴 < 0) |
17 | 0re 10078 | . . . . 5 ⊢ 0 ∈ ℝ | |
18 | ltle 10164 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 < 0 → 𝐴 ≤ 0)) | |
19 | 10, 17, 18 | sylancl 695 | . . . 4 ⊢ ((𝐴 ∈ 𝐷 ∧ -𝐴 ∈ ℝ+) → (𝐴 < 0 → 𝐴 ≤ 0)) |
20 | 16, 19 | mpd 15 | . . 3 ⊢ ((𝐴 ∈ 𝐷 ∧ -𝐴 ∈ ℝ+) → 𝐴 ≤ 0) |
21 | mnfxr 10134 | . . . 4 ⊢ -∞ ∈ ℝ* | |
22 | elioc2 12274 | . . . 4 ⊢ ((-∞ ∈ ℝ* ∧ 0 ∈ ℝ) → (𝐴 ∈ (-∞(,]0) ↔ (𝐴 ∈ ℝ ∧ -∞ < 𝐴 ∧ 𝐴 ≤ 0))) | |
23 | 21, 17, 22 | mp2an 708 | . . 3 ⊢ (𝐴 ∈ (-∞(,]0) ↔ (𝐴 ∈ ℝ ∧ -∞ < 𝐴 ∧ 𝐴 ≤ 0)) |
24 | 10, 12, 20, 23 | syl3anbrc 1265 | . 2 ⊢ ((𝐴 ∈ 𝐷 ∧ -𝐴 ∈ ℝ+) → 𝐴 ∈ (-∞(,]0)) |
25 | 3, 24 | mtand 692 | 1 ⊢ (𝐴 ∈ 𝐷 → ¬ -𝐴 ∈ ℝ+) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 383 ∧ w3a 1054 = wceq 1523 ∈ wcel 2030 ∖ cdif 3604 class class class wbr 4685 (class class class)co 6690 ℂcc 9972 ℝcr 9973 0cc0 9974 -∞cmnf 10110 ℝ*cxr 10111 < clt 10112 ≤ cle 10113 -cneg 10305 ℝ+crp 11870 (,]cioc 12214 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 ax-cnex 10030 ax-resscn 10031 ax-1cn 10032 ax-icn 10033 ax-addcl 10034 ax-addrcl 10035 ax-mulcl 10036 ax-mulrcl 10037 ax-mulcom 10038 ax-addass 10039 ax-mulass 10040 ax-distr 10041 ax-i2m1 10042 ax-1ne0 10043 ax-1rid 10044 ax-rnegex 10045 ax-rrecex 10046 ax-cnre 10047 ax-pre-lttri 10048 ax-pre-lttrn 10049 ax-pre-ltadd 10050 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-nel 2927 df-ral 2946 df-rex 2947 df-reu 2948 df-rab 2950 df-v 3233 df-sbc 3469 df-csb 3567 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-op 4217 df-uni 4469 df-br 4686 df-opab 4746 df-mpt 4763 df-id 5053 df-po 5064 df-so 5065 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-riota 6651 df-ov 6693 df-oprab 6694 df-mpt2 6695 df-er 7787 df-en 7998 df-dom 7999 df-sdom 8000 df-pnf 10114 df-mnf 10115 df-xr 10116 df-ltxr 10117 df-le 10118 df-sub 10306 df-neg 10307 df-rp 11871 df-ioc 12218 |
This theorem is referenced by: dvloglem 24439 logf1o2 24441 |
Copyright terms: Public domain | W3C validator |