Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ltabs | GIF version |
Description: A number which is less than its absolute value is negative. (Contributed by Jim Kingdon, 12-Aug-2021.) |
Ref | Expression |
---|---|
ltabs | ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) → 𝐴 < 0) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpr 108 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 𝐴 < 0) → 𝐴 < 0) | |
2 | simpllr 500 | . . . . 5 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) ∧ 0 < 𝐴) → 𝐴 < (abs‘𝐴)) | |
3 | simpll 495 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) → 𝐴 ∈ ℝ) | |
4 | 3 | adantr 270 | . . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) ∧ 0 < 𝐴) → 𝐴 ∈ ℝ) |
5 | 0red 7120 | . . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) ∧ 0 < 𝐴) → 0 ∈ ℝ) | |
6 | simpr 108 | . . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) ∧ 0 < 𝐴) → 0 < 𝐴) | |
7 | 5, 4, 6 | ltled 7228 | . . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) ∧ 0 < 𝐴) → 0 ≤ 𝐴) |
8 | absid 9957 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (abs‘𝐴) = 𝐴) | |
9 | 4, 7, 8 | syl2anc 403 | . . . . 5 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) ∧ 0 < 𝐴) → (abs‘𝐴) = 𝐴) |
10 | 2, 9 | breqtrd 3809 | . . . 4 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) ∧ 0 < 𝐴) → 𝐴 < 𝐴) |
11 | 4 | ltnrd 7222 | . . . 4 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) ∧ 0 < 𝐴) → ¬ 𝐴 < 𝐴) |
12 | 10, 11 | pm2.65da 619 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) → ¬ 0 < 𝐴) |
13 | recn 7106 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
14 | abscl 9937 | . . . . . . . 8 ⊢ (𝐴 ∈ ℂ → (abs‘𝐴) ∈ ℝ) | |
15 | 13, 14 | syl 14 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (abs‘𝐴) ∈ ℝ) |
16 | 15 | ad2antrr 471 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) → (abs‘𝐴) ∈ ℝ) |
17 | simpr 108 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) → 0 < (abs‘𝐴)) | |
18 | 16, 17 | gt0ap0d 7728 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) → (abs‘𝐴) # 0) |
19 | abs00ap 9948 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((abs‘𝐴) # 0 ↔ 𝐴 # 0)) | |
20 | 3, 13, 19 | 3syl 17 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) → ((abs‘𝐴) # 0 ↔ 𝐴 # 0)) |
21 | 18, 20 | mpbid 145 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) → 𝐴 # 0) |
22 | 0re 7119 | . . . . 5 ⊢ 0 ∈ ℝ | |
23 | reaplt 7688 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 # 0 ↔ (𝐴 < 0 ∨ 0 < 𝐴))) | |
24 | 3, 22, 23 | sylancl 404 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) → (𝐴 # 0 ↔ (𝐴 < 0 ∨ 0 < 𝐴))) |
25 | 21, 24 | mpbid 145 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) → (𝐴 < 0 ∨ 0 < 𝐴)) |
26 | 12, 25 | ecased 1280 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) ∧ 0 < (abs‘𝐴)) → 𝐴 < 0) |
27 | axltwlin 7180 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ (abs‘𝐴) ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 < (abs‘𝐴) → (𝐴 < 0 ∨ 0 < (abs‘𝐴)))) | |
28 | 22, 27 | mp3an3 1257 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (abs‘𝐴) ∈ ℝ) → (𝐴 < (abs‘𝐴) → (𝐴 < 0 ∨ 0 < (abs‘𝐴)))) |
29 | 15, 28 | mpdan 412 | . . 3 ⊢ (𝐴 ∈ ℝ → (𝐴 < (abs‘𝐴) → (𝐴 < 0 ∨ 0 < (abs‘𝐴)))) |
30 | 29 | imp 122 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) → (𝐴 < 0 ∨ 0 < (abs‘𝐴))) |
31 | 1, 26, 30 | mpjaodan 744 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) → 𝐴 < 0) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ↔ wb 103 ∨ wo 661 = wceq 1284 ∈ wcel 1433 class class class wbr 3785 ‘cfv 4922 ℂcc 6979 ℝcr 6980 0cc0 6981 < clt 7153 ≤ cle 7154 # cap 7681 abscabs 9883 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-13 1444 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-coll 3893 ax-sep 3896 ax-nul 3904 ax-pow 3948 ax-pr 3964 ax-un 4188 ax-setind 4280 ax-iinf 4329 ax-cnex 7067 ax-resscn 7068 ax-1cn 7069 ax-1re 7070 ax-icn 7071 ax-addcl 7072 ax-addrcl 7073 ax-mulcl 7074 ax-mulrcl 7075 ax-addcom 7076 ax-mulcom 7077 ax-addass 7078 ax-mulass 7079 ax-distr 7080 ax-i2m1 7081 ax-0lt1 7082 ax-1rid 7083 ax-0id 7084 ax-rnegex 7085 ax-precex 7086 ax-cnre 7087 ax-pre-ltirr 7088 ax-pre-ltwlin 7089 ax-pre-lttrn 7090 ax-pre-apti 7091 ax-pre-ltadd 7092 ax-pre-mulgt0 7093 ax-pre-mulext 7094 ax-arch 7095 ax-caucvg 7096 |
This theorem depends on definitions: df-bi 115 df-dc 776 df-3or 920 df-3an 921 df-tru 1287 df-fal 1290 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ne 2246 df-nel 2340 df-ral 2353 df-rex 2354 df-reu 2355 df-rmo 2356 df-rab 2357 df-v 2603 df-sbc 2816 df-csb 2909 df-dif 2975 df-un 2977 df-in 2979 df-ss 2986 df-nul 3252 df-if 3352 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-int 3637 df-iun 3680 df-br 3786 df-opab 3840 df-mpt 3841 df-tr 3876 df-id 4048 df-po 4051 df-iso 4052 df-iord 4121 df-on 4123 df-suc 4126 df-iom 4332 df-xp 4369 df-rel 4370 df-cnv 4371 df-co 4372 df-dm 4373 df-rn 4374 df-res 4375 df-ima 4376 df-iota 4887 df-fun 4924 df-fn 4925 df-f 4926 df-f1 4927 df-fo 4928 df-f1o 4929 df-fv 4930 df-riota 5488 df-ov 5535 df-oprab 5536 df-mpt2 5537 df-1st 5787 df-2nd 5788 df-recs 5943 df-frec 6001 df-pnf 7155 df-mnf 7156 df-xr 7157 df-ltxr 7158 df-le 7159 df-sub 7281 df-neg 7282 df-reap 7675 df-ap 7682 df-div 7761 df-inn 8040 df-2 8098 df-3 8099 df-4 8100 df-n0 8289 df-z 8352 df-uz 8620 df-rp 8735 df-iseq 9432 df-iexp 9476 df-cj 9729 df-re 9730 df-im 9731 df-rsqrt 9884 df-abs 9885 |
This theorem is referenced by: abslt 9974 absle 9975 maxabslemlub 10093 |
Copyright terms: Public domain | W3C validator |