| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > absle | Structured version Visualization version GIF version | ||
| Description: Absolute value and 'less than or equal to' relation. (Contributed by NM, 6-Apr-2005.) (Revised by Mario Carneiro, 29-May-2016.) |
| Ref | Expression |
|---|---|
| absle | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((abs‘𝐴) ≤ 𝐵 ↔ (-𝐵 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpll 766 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (abs‘𝐴) ≤ 𝐵) → 𝐴 ∈ ℝ) | |
| 2 | 1 | renegcld 11547 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (abs‘𝐴) ≤ 𝐵) → -𝐴 ∈ ℝ) |
| 3 | 1 | recnd 11143 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (abs‘𝐴) ≤ 𝐵) → 𝐴 ∈ ℂ) |
| 4 | abscl 15185 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → (abs‘𝐴) ∈ ℝ) | |
| 5 | 3, 4 | syl 17 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (abs‘𝐴) ≤ 𝐵) → (abs‘𝐴) ∈ ℝ) |
| 6 | simplr 768 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (abs‘𝐴) ≤ 𝐵) → 𝐵 ∈ ℝ) | |
| 7 | leabs 15206 | . . . . . . . 8 ⊢ (-𝐴 ∈ ℝ → -𝐴 ≤ (abs‘-𝐴)) | |
| 8 | 2, 7 | syl 17 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (abs‘𝐴) ≤ 𝐵) → -𝐴 ≤ (abs‘-𝐴)) |
| 9 | absneg 15184 | . . . . . . . 8 ⊢ (𝐴 ∈ ℂ → (abs‘-𝐴) = (abs‘𝐴)) | |
| 10 | 3, 9 | syl 17 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (abs‘𝐴) ≤ 𝐵) → (abs‘-𝐴) = (abs‘𝐴)) |
| 11 | 8, 10 | breqtrd 5118 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (abs‘𝐴) ≤ 𝐵) → -𝐴 ≤ (abs‘𝐴)) |
| 12 | simpr 484 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (abs‘𝐴) ≤ 𝐵) → (abs‘𝐴) ≤ 𝐵) | |
| 13 | 2, 5, 6, 11, 12 | letrd 11273 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (abs‘𝐴) ≤ 𝐵) → -𝐴 ≤ 𝐵) |
| 14 | leabs 15206 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → 𝐴 ≤ (abs‘𝐴)) | |
| 15 | 14 | ad2antrr 726 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (abs‘𝐴) ≤ 𝐵) → 𝐴 ≤ (abs‘𝐴)) |
| 16 | 1, 5, 6, 15, 12 | letrd 11273 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (abs‘𝐴) ≤ 𝐵) → 𝐴 ≤ 𝐵) |
| 17 | 13, 16 | jca 511 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (abs‘𝐴) ≤ 𝐵) → (-𝐴 ≤ 𝐵 ∧ 𝐴 ≤ 𝐵)) |
| 18 | 17 | ex 412 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((abs‘𝐴) ≤ 𝐵 → (-𝐴 ≤ 𝐵 ∧ 𝐴 ≤ 𝐵))) |
| 19 | absor 15207 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((abs‘𝐴) = 𝐴 ∨ (abs‘𝐴) = -𝐴)) | |
| 20 | 19 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((abs‘𝐴) = 𝐴 ∨ (abs‘𝐴) = -𝐴)) |
| 21 | breq1 5095 | . . . . . . 7 ⊢ ((abs‘𝐴) = 𝐴 → ((abs‘𝐴) ≤ 𝐵 ↔ 𝐴 ≤ 𝐵)) | |
| 22 | 21 | biimprd 248 | . . . . . 6 ⊢ ((abs‘𝐴) = 𝐴 → (𝐴 ≤ 𝐵 → (abs‘𝐴) ≤ 𝐵)) |
| 23 | breq1 5095 | . . . . . . 7 ⊢ ((abs‘𝐴) = -𝐴 → ((abs‘𝐴) ≤ 𝐵 ↔ -𝐴 ≤ 𝐵)) | |
| 24 | 23 | biimprd 248 | . . . . . 6 ⊢ ((abs‘𝐴) = -𝐴 → (-𝐴 ≤ 𝐵 → (abs‘𝐴) ≤ 𝐵)) |
| 25 | 22, 24 | jaoa 957 | . . . . 5 ⊢ (((abs‘𝐴) = 𝐴 ∨ (abs‘𝐴) = -𝐴) → ((𝐴 ≤ 𝐵 ∧ -𝐴 ≤ 𝐵) → (abs‘𝐴) ≤ 𝐵)) |
| 26 | 25 | ancomsd 465 | . . . 4 ⊢ (((abs‘𝐴) = 𝐴 ∨ (abs‘𝐴) = -𝐴) → ((-𝐴 ≤ 𝐵 ∧ 𝐴 ≤ 𝐵) → (abs‘𝐴) ≤ 𝐵)) |
| 27 | 20, 26 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((-𝐴 ≤ 𝐵 ∧ 𝐴 ≤ 𝐵) → (abs‘𝐴) ≤ 𝐵)) |
| 28 | 18, 27 | impbid 212 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((abs‘𝐴) ≤ 𝐵 ↔ (-𝐴 ≤ 𝐵 ∧ 𝐴 ≤ 𝐵))) |
| 29 | lenegcon1 11624 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (-𝐴 ≤ 𝐵 ↔ -𝐵 ≤ 𝐴)) | |
| 30 | 29 | anbi1d 631 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((-𝐴 ≤ 𝐵 ∧ 𝐴 ≤ 𝐵) ↔ (-𝐵 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵))) |
| 31 | 28, 30 | bitrd 279 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((abs‘𝐴) ≤ 𝐵 ↔ (-𝐵 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1540 ∈ wcel 2109 class class class wbr 5092 ‘cfv 6482 ℂcc 11007 ℝcr 11008 ≤ cle 11150 -cneg 11348 abscabs 15141 |
| 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 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 ax-pre-sup 11087 |
| 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 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7800 df-2nd 7925 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-er 8625 df-en 8873 df-dom 8874 df-sdom 8875 df-sup 9332 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-div 11778 df-nn 12129 df-2 12191 df-3 12192 df-n0 12385 df-z 12472 df-uz 12736 df-rp 12894 df-seq 13909 df-exp 13969 df-cj 15006 df-re 15007 df-im 15008 df-sqrt 15142 df-abs 15143 |
| This theorem is referenced by: absdifle 15226 lenegsq 15228 abs2difabs 15242 abslei 15299 absled 15340 volsup2 25504 efif1olem3 26451 argregt0 26517 argrege0 26518 abscxpbnd 26661 lgseisen 27288 ftc1anclem1 37683 pellexlem5 42816 rexabslelem 45407 |
| Copyright terms: Public domain | W3C validator |