ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  abs2dif Unicode version
Theorem abs2dif 11872
Description: Difference of absolute values. (Contributed by Paul Chapman, 7-Sep-2007.)
Assertion
Ref Expression
abs2dif |- ( ( A e. CC /\ B e. CC ) -> ( ( abs ` A ) - ( abs ` B ) ) <_ ( abs ` ( A - B ) ) )
Proof of Theorem abs2dif
StepHypRef Expression
1 subid1 8546 . . . 4 |- ( A e. CC -> ( A - 0 ) = A )
21fveq2d 5699 . . 3 |- ( A e. CC -> ( abs ` ( A - 0 ) ) = ( abs ` A ) )
3 subid1 8546 . . . 4 |- ( B e. CC -> ( B - 0 ) = B )
43fveq2d 5699 . . 3 |- ( B e. CC -> ( abs ` ( B - 0 ) ) = ( abs ` B ) )
52, 4oveqan12d 6104 . 2 |- ( ( A e. CC /\ B e. CC ) -> ( ( abs ` ( A - 0 ) ) - ( abs ` ( B - 0 ) ) ) = ( ( abs ` A ) - ( abs ` B ) ) )
6 0cn 8318 . . . 4 |- 0 e. CC
7 abs3dif 11871 . . . 4 |- ( ( A e. CC /\ 0 e. CC /\ B e. CC ) -> ( abs ` ( A - 0 ) ) <_ ( ( abs ` ( A - B ) ) + ( abs ` ( B - 0 ) ) ) )
86, 7mp3an2 1366 . . 3 |- ( ( A e. CC /\ B e. CC ) -> ( abs ` ( A - 0 ) ) <_ ( ( abs ` ( A - B ) ) + ( abs ` ( B - 0 ) ) ) )
9 subcl 8525 . . . . . . . 8 |- ( ( A e. CC /\ 0 e. CC ) -> ( A - 0 ) e. CC )
106, 9mpan2 429 . . . . . . 7 |- ( A e. CC -> ( A - 0 ) e. CC )
11 abscl 11817 . . . . . . 7 |- ( ( A - 0 ) e. CC -> ( abs ` ( A - 0 ) ) e. RR )
1210, 11syl 14 . . . . . 6 |- ( A e. CC -> ( abs ` ( A - 0 ) ) e. RR )
13 subcl 8525 . . . . . . . 8 |- ( ( B e. CC /\ 0 e. CC ) -> ( B - 0 ) e. CC )
146, 13mpan2 429 . . . . . . 7 |- ( B e. CC -> ( B - 0 ) e. CC )
15 abscl 11817 . . . . . . 7 |- ( ( B - 0 ) e. CC -> ( abs ` ( B - 0 ) ) e. RR )
1614, 15syl 14 . . . . . 6 |- ( B e. CC -> ( abs ` ( B - 0 ) ) e. RR )
1712, 16anim12i 338 . . . . 5 |- ( ( A e. CC /\ B e. CC ) -> ( ( abs ` ( A - 0 ) ) e. RR /\ ( abs ` ( B - 0 ) ) e. RR ) )
18 subcl 8525 . . . . . 6 |- ( ( A e. CC /\ B e. CC ) -> ( A - B ) e. CC )
19 abscl 11817 . . . . . 6 |- ( ( A - B ) e. CC -> ( abs ` ( A - B ) ) e. RR )
2018, 19syl 14 . . . . 5 |- ( ( A e. CC /\ B e. CC ) -> ( abs ` ( A - B ) ) e. RR )
21 df-3an 1011 . . . . 5 |- ( ( ( abs ` ( A - 0 ) ) e. RR /\ ( abs ` ( B - 0 ) ) e. RR /\ ( abs ` ( A - B ) ) e. RR ) <-> ( ( ( abs ` ( A - 0 ) ) e. RR /\ ( abs ` ( B - 0 ) ) e. RR ) /\ ( abs ` ( A - B ) ) e. RR ) )
2217, 20, 21sylanbrc 421 . . . 4 |- ( ( A e. CC /\ B e. CC ) -> ( ( abs ` ( A - 0 ) ) e. RR /\ ( abs ` ( B - 0 ) ) e. RR /\ ( abs ` ( A - B ) ) e. RR ) )
23 lesubadd 8762 . . . 4 |- ( ( ( abs ` ( A - 0 ) ) e. RR /\ ( abs ` ( B - 0 ) ) e. RR /\ ( abs ` ( A - B ) ) e. RR ) -> ( ( ( abs ` ( A - 0 ) ) - ( abs ` ( B - 0 ) ) ) <_ ( abs ` ( A - B ) ) <-> ( abs ` ( A - 0 ) ) <_ ( ( abs ` ( A - B ) ) + ( abs ` ( B - 0 ) ) ) ) )
2422, 23syl 14 . . 3 |- ( ( A e. CC /\ B e. CC ) -> ( ( ( abs ` ( A - 0 ) ) - ( abs ` ( B - 0 ) ) ) <_ ( abs ` ( A - B ) ) <-> ( abs ` ( A - 0 ) ) <_ ( ( abs ` ( A - B ) ) + ( abs ` ( B - 0 ) ) ) ) )
258, 24mpbird 167 . 2 |- ( ( A e. CC /\ B e. CC ) -> ( ( abs ` ( A - 0 ) ) - ( abs ` ( B - 0 ) ) ) <_ ( abs ` ( A - B ) ) )
265, 25eqbrtrrd 4154 1 |- ( ( A e. CC /\ B e. CC ) -> ( ( abs ` A ) - ( abs ` B ) ) <_ ( abs ` ( A - B ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   e. wcel 2209   class class class wbr 4130   ` cfv 5377  (class class class)co 6085   CCcc 8177   RRcr 8178   0cc0 8179   + caddc 8182   <_ cle 8361   - cmin 8497   abscabs 11763
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298  ax-caucvg 8299
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-n0 9564  df-z 9645  df-uz 9922  df-rp 10055  df-seqfrec 10885  df-exp 10976  df-cj 11607  df-re 11608  df-im 11609  df-rsqrt 11764  df-abs 11765
This theorem is used by:  abs2difabs  11874  caubnd2  11883  abs2difd  11963
  Copyright terms: Public domain W3C validator