ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  leabs Unicode version
Theorem leabs 9960
Description: A real number is less than or equal to its absolute value. (Contributed by NM, 27-Feb-2005.)
Assertion
Ref Expression
leabs |- ( A e. RR -> A <_ ( abs ` A ) )
Proof of Theorem leabs
StepHypRef Expression
1 simpr 108 . . . . 5 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ ( abs ` A ) < 0 ) -> ( abs ` A ) < 0 )
2 recn 7106 . . . . . . . 8 |- ( A e. RR -> A e. CC )
3 absge0 9946 . . . . . . . 8 |- ( A e. CC -> 0 <_ ( abs ` A ) )
42, 3syl 14 . . . . . . 7 |- ( A e. RR -> 0 <_ ( abs ` A ) )
54ad2antrr 471 . . . . . 6 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ ( abs ` A ) < 0 ) -> 0 <_ ( abs ` A ) )
6 0red 7120 . . . . . . 7 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ ( abs ` A ) < 0 ) -> 0 e. RR )
7 abscl 9937 . . . . . . . . 9 |- ( A e. CC -> ( abs ` A ) e. RR )
82, 7syl 14 . . . . . . . 8 |- ( A e. RR -> ( abs ` A ) e. RR )
98ad2antrr 471 . . . . . . 7 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ ( abs ` A ) < 0 ) -> ( abs ` A ) e. RR )
106, 9lenltd 7227 . . . . . 6 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ ( abs ` A ) < 0 ) -> ( 0 <_ ( abs ` A ) <-> -. ( abs ` A ) < 0 ) )
115, 10mpbid 145 . . . . 5 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ ( abs ` A ) < 0 ) -> -. ( abs ` A ) < 0 )
121, 11pm2.21fal 1304 . . . 4 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ ( abs ` A ) < 0 ) -> F. )
13 simpll 495 . . . . . . 7 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ 0 < A ) -> A e. RR )
14 0red 7120 . . . . . . . 8 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ 0 < A ) -> 0 e. RR )
15 simpr 108 . . . . . . . 8 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ 0 < A ) -> 0 < A )
1614, 13, 15ltled 7228 . . . . . . 7 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ 0 < A ) -> 0 <_ A )
17 absid 9957 . . . . . . 7 |- ( ( A e. RR /\ 0 <_ A ) -> ( abs ` A ) = A )
1813, 16, 17syl2anc 403 . . . . . 6 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ 0 < A ) -> ( abs ` A ) = A )
19 simplr 496 . . . . . 6 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ 0 < A ) -> ( abs ` A ) < A )
2018, 19eqbrtrrd 3807 . . . . 5 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ 0 < A ) -> A < A )
2113ltnrd 7222 . . . . 5 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ 0 < A ) -> -. A < A )
2220, 21pm2.21fal 1304 . . . 4 |- ( ( ( A e. RR /\ ( abs ` A ) < A ) /\ 0 < A ) -> F. )
23 0re 7119 . . . . . . 7 |- 0 e. RR
24 axltwlin 7180 . . . . . . 7 |- ( ( ( abs ` A ) e. RR /\ A e. RR /\ 0 e. RR ) -> ( ( abs ` A ) < A -> ( ( abs ` A ) < 0 \/ 0 < A ) ) )
2523, 24mp3an3 1257 . . . . . 6 |- ( ( ( abs ` A ) e. RR /\ A e. RR ) -> ( ( abs ` A ) < A -> ( ( abs ` A ) < 0 \/ 0 < A ) ) )
268, 25mpancom 413 . . . . 5 |- ( A e. RR -> ( ( abs ` A ) < A -> ( ( abs ` A ) < 0 \/ 0 < A ) ) )
2726imp 122 . . . 4 |- ( ( A e. RR /\ ( abs ` A ) < A ) -> ( ( abs ` A ) < 0 \/ 0 < A ) )
2812, 22, 27mpjaodan 744 . . 3 |- ( ( A e. RR /\ ( abs ` A ) < A ) -> F. )
2928inegd 1303 . 2 |- ( A e. RR -> -. ( abs ` A ) < A )
30 id 19 . . 3 |- ( A e. RR -> A e. RR )
3130, 8lenltd 7227 . 2 |- ( A e. RR -> ( A <_ ( abs ` A ) <-> -. ( abs ` A ) < A ) )
3229, 31mpbird 165 1 |- ( A e. RR -> A <_ ( abs ` A ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3   -> wi 4   /\ wa 102   \/ wo 661   = wceq 1284   F. wfal 1289   e. wcel 1433   class class class wbr 3785   ` cfv 4922   CCcc 6979   RRcr 6980   0cc0 6981   < clt 7153   <_ cle 7154   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  abssubap0  9976  releabs  9982  leabsi  10014  leabsd  10047  dfabsmax  10103
  Copyright terms: Public domain W3C validator