ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  abslt Unicode version
Theorem abslt 11270
Description: Absolute value and 'less than' relation. (Contributed by NM, 6-Apr-2005.) (Revised by Mario Carneiro, 29-May-2016.)
Assertion
Ref Expression
abslt |- ( ( A e. RR /\ B e. RR ) -> ( ( abs ` A ) < B <-> ( -u B < A /\ A < B ) ) )
Proof of Theorem abslt
StepHypRef Expression
1 simpll 527 . . . . . 6 |- ( ( ( A e. RR /\ B e. RR ) /\ ( abs ` A ) < B ) -> A e. RR )
21renegcld 8423 . . . . 5 |- ( ( ( A e. RR /\ B e. RR ) /\ ( abs ` A ) < B ) -> -u A e. RR )
31recnd 8072 . . . . . 6 |- ( ( ( A e. RR /\ B e. RR ) /\ ( abs ` A ) < B ) -> A e. CC )
4 abscl 11233 . . . . . 6 |- ( A e. CC -> ( abs ` A ) e. RR )
53, 4syl 14 . . . . 5 |- ( ( ( A e. RR /\ B e. RR ) /\ ( abs ` A ) < B ) -> ( abs ` A ) e. RR )
6 simplr 528 . . . . 5 |- ( ( ( A e. RR /\ B e. RR ) /\ ( abs ` A ) < B ) -> B e. RR )
7 leabs 11256 . . . . . . 7 |- ( -u A e. RR -> -u A <_ ( abs ` -u A ) )
82, 7syl 14 . . . . . 6 |- ( ( ( A e. RR /\ B e. RR ) /\ ( abs ` A ) < B ) -> -u A <_ ( abs ` -u A ) )
9 absneg 11232 . . . . . . 7 |- ( A e. CC -> ( abs ` -u A ) = ( abs ` A ) )
103, 9syl 14 . . . . . 6 |- ( ( ( A e. RR /\ B e. RR ) /\ ( abs ` A ) < B ) -> ( abs ` -u A ) = ( abs ` A ) )
118, 10breqtrd 4060 . . . . 5 |- ( ( ( A e. RR /\ B e. RR ) /\ ( abs ` A ) < B ) -> -u A <_ ( abs ` A ) )
12 simpr 110 . . . . 5 |- ( ( ( A e. RR /\ B e. RR ) /\ ( abs ` A ) < B ) -> ( abs ` A ) < B )
132, 5, 6, 11, 12lelttrd 8168 . . . 4 |- ( ( ( A e. RR /\ B e. RR ) /\ ( abs ` A ) < B ) -> -u A < B )
14 leabs 11256 . . . . . 6 |- ( A e. RR -> A <_ ( abs ` A ) )
1514ad2antrr 488 . . . . 5 |- ( ( ( A e. RR /\ B e. RR ) /\ ( abs ` A ) < B ) -> A <_ ( abs ` A ) )
161, 5, 6, 15, 12lelttrd 8168 . . . 4 |- ( ( ( A e. RR /\ B e. RR ) /\ ( abs ` A ) < B ) -> A < B )
1713, 16jca 306 . . 3 |- ( ( ( A e. RR /\ B e. RR ) /\ ( abs ` A ) < B ) -> ( -u A < B /\ A < B ) )
18 simpll 527 . . . . . 6 |- ( ( ( A e. RR /\ B e. RR ) /\ ( -u A < B /\ A < B ) ) -> A e. RR )
19 simpl 109 . . . . . . . . 9 |- ( ( A e. RR /\ A < ( abs ` A ) ) -> A e. RR )
2019recnd 8072 . . . . . . . 8 |- ( ( A e. RR /\ A < ( abs ` A ) ) -> A e. CC )
2120, 9syl 14 . . . . . . 7 |- ( ( A e. RR /\ A < ( abs ` A ) ) -> ( abs ` -u A ) = ( abs ` A ) )
2219renegcld 8423 . . . . . . . 8 |- ( ( A e. RR /\ A < ( abs ` A ) ) -> -u A e. RR )
23 0red 8044 . . . . . . . . . 10 |- ( ( A e. RR /\ A < ( abs ` A ) ) -> 0 e. RR )
24 ltabs 11269 . . . . . . . . . 10 |- ( ( A e. RR /\ A < ( abs ` A ) ) -> A < 0 )
2519, 23, 24ltled 8162 . . . . . . . . 9 |- ( ( A e. RR /\ A < ( abs ` A ) ) -> A <_ 0 )
2619le0neg1d 8561 . . . . . . . . 9 |- ( ( A e. RR /\ A < ( abs ` A ) ) -> ( A <_ 0 <-> 0 <_ -u A ) )
2725, 26mpbid 147 . . . . . . . 8 |- ( ( A e. RR /\ A < ( abs ` A ) ) -> 0 <_ -u A )
28 absid 11253 . . . . . . . 8 |- ( ( -u A e. RR /\ 0 <_ -u A ) -> ( abs ` -u A ) = -u A )
2922, 27, 28syl2anc 411 . . . . . . 7 |- ( ( A e. RR /\ A < ( abs ` A ) ) -> ( abs ` -u A ) = -u A )
3021, 29eqtr3d 2231 . . . . . 6 |- ( ( A e. RR /\ A < ( abs ` A ) ) -> ( abs ` A ) = -u A )
3118, 30sylan 283 . . . . 5 |- ( ( ( ( A e. RR /\ B e. RR ) /\ ( -u A < B /\ A < B ) ) /\ A < ( abs ` A ) ) -> ( abs ` A ) = -u A )
32 simplrl 535 . . . . 5 |- ( ( ( ( A e. RR /\ B e. RR ) /\ ( -u A < B /\ A < B ) ) /\ A < ( abs ` A ) ) -> -u A < B )
3331, 32eqbrtrd 4056 . . . 4 |- ( ( ( ( A e. RR /\ B e. RR ) /\ ( -u A < B /\ A < B ) ) /\ A < ( abs ` A ) ) -> ( abs ` A ) < B )
34 simpr 110 . . . 4 |- ( ( ( ( A e. RR /\ B e. RR ) /\ ( -u A < B /\ A < B ) ) /\ ( abs ` A ) < B ) -> ( abs ` A ) < B )
35 simprr 531 . . . . 5 |- ( ( ( A e. RR /\ B e. RR ) /\ ( -u A < B /\ A < B ) ) -> A < B )
36 simplr 528 . . . . . 6 |- ( ( ( A e. RR /\ B e. RR ) /\ ( -u A < B /\ A < B ) ) -> B e. RR )
3718recnd 8072 . . . . . . 7 |- ( ( ( A e. RR /\ B e. RR ) /\ ( -u A < B /\ A < B ) ) -> A e. CC )
3837, 4syl 14 . . . . . 6 |- ( ( ( A e. RR /\ B e. RR ) /\ ( -u A < B /\ A < B ) ) -> ( abs ` A ) e. RR )
39 axltwlin 8111 . . . . . 6 |- ( ( A e. RR /\ B e. RR /\ ( abs ` A ) e. RR ) -> ( A < B -> ( A < ( abs ` A ) \/ ( abs ` A ) < B ) ) )
4018, 36, 38, 39syl3anc 1249 . . . . 5 |- ( ( ( A e. RR /\ B e. RR ) /\ ( -u A < B /\ A < B ) ) -> ( A < B -> ( A < ( abs ` A ) \/ ( abs ` A ) < B ) ) )
4135, 40mpd 13 . . . 4 |- ( ( ( A e. RR /\ B e. RR ) /\ ( -u A < B /\ A < B ) ) -> ( A < ( abs ` A ) \/ ( abs ` A ) < B ) )
4233, 34, 41mpjaodan 799 . . 3 |- ( ( ( A e. RR /\ B e. RR ) /\ ( -u A < B /\ A < B ) ) -> ( abs ` A ) < B )
4317, 42impbida 596 . 2 |- ( ( A e. RR /\ B e. RR ) -> ( ( abs ` A ) < B <-> ( -u A < B /\ A < B ) ) )
44 ltnegcon1 8507 . . 3 |- ( ( A e. RR /\ B e. RR ) -> ( -u A < B <-> -u B < A ) )
4544anbi1d 465 . 2 |- ( ( A e. RR /\ B e. RR ) -> ( ( -u A < B /\ A < B ) <-> ( -u B < A /\ A < B ) ) )
4643, 45bitrd 188 1 |- ( ( A e. RR /\ B e. RR ) -> ( ( abs ` A ) < B <-> ( -u B < A /\ A < B ) ) )
Colors of variables: wff set class
Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 709   = wceq 1364   e. wcel 2167   class class class wbr 4034   ` cfv 5259   CCcc 7894   RRcr 7895   0cc0 7896   < clt 8078   <_ cle 8079   -ucneg 8215   abscabs 11179
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-mulrcl 7995  ax-addcom 7996  ax-mulcom 7997  ax-addass 7998  ax-mulass 7999  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-1rid 8003  ax-0id 8004  ax-rnegex 8005  ax-precex 8006  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-apti 8011  ax-pre-ltadd 8012  ax-pre-mulgt0 8013  ax-pre-mulext 8014  ax-arch 8015  ax-caucvg 8016
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-if 3563  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-po 4332  df-iso 4333  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-frec 6458  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-reap 8619  df-ap 8626  df-div 8717  df-inn 9008  df-2 9066  df-3 9067  df-4 9068  df-n0 9267  df-z 9344  df-uz 9619  df-rp 9746  df-seqfrec 10557  df-exp 10648  df-cj 11024  df-re 11025  df-im 11026  df-rsqrt 11180  df-abs 11181
This theorem is referenced by:  absdiflt  11274  abslti  11320  absltd  11356
  Copyright terms: Public domain W3C validator