ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  maxabslemlub Unicode version

Theorem maxabslemlub 11973
Description: Lemma for maxabs 11975. A least upper bound for  { A ,  B }. (Contributed by Jim Kingdon, 20-Dec-2021.)
Hypotheses
Ref Expression
maxabslemlub.a  |-  ( ph  ->  A  e.  RR )
maxabslemlub.b  |-  ( ph  ->  B  e.  RR )
maxabslemlub.c  |-  ( ph  ->  C  e.  RR )
maxabslemlub.clt  |-  ( ph  ->  C  <  ( ( ( A  +  B
)  +  ( abs `  ( A  -  B
) ) )  / 
2 ) )
Assertion
Ref Expression
maxabslemlub  |-  ( ph  ->  ( C  <  A  \/  C  <  B ) )

Proof of Theorem maxabslemlub
StepHypRef Expression
1 maxabslemlub.clt . . 3  |-  ( ph  ->  C  <  ( ( ( A  +  B
)  +  ( abs `  ( A  -  B
) ) )  / 
2 ) )
2 maxabslemlub.c . . . 4  |-  ( ph  ->  C  e.  RR )
3 maxabslemlub.a . . . . . . 7  |-  ( ph  ->  A  e.  RR )
4 maxabslemlub.b . . . . . . 7  |-  ( ph  ->  B  e.  RR )
53, 4readdcld 8355 . . . . . 6  |-  ( ph  ->  ( A  +  B
)  e.  RR )
63recnd 8354 . . . . . . . 8  |-  ( ph  ->  A  e.  CC )
74recnd 8354 . . . . . . . 8  |-  ( ph  ->  B  e.  CC )
86, 7subcld 8637 . . . . . . 7  |-  ( ph  ->  ( A  -  B
)  e.  CC )
98abscld 11947 . . . . . 6  |-  ( ph  ->  ( abs `  ( A  -  B )
)  e.  RR )
105, 9readdcld 8355 . . . . 5  |-  ( ph  ->  ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  e.  RR )
1110rehalfcld 9552 . . . 4  |-  ( ph  ->  ( ( ( A  +  B )  +  ( abs `  ( A  -  B )
) )  /  2
)  e.  RR )
12 axltwlin 8393 . . . 4  |-  ( ( C  e.  RR  /\  ( ( ( A  +  B )  +  ( abs `  ( A  -  B )
) )  /  2
)  e.  RR  /\  A  e.  RR )  ->  ( C  <  (
( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 )  ->  ( C  < 
A  \/  A  < 
( ( ( A  +  B )  +  ( abs `  ( A  -  B )
) )  /  2
) ) ) )
132, 11, 3, 12syl3anc 1278 . . 3  |-  ( ph  ->  ( C  <  (
( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 )  ->  ( C  < 
A  \/  A  < 
( ( ( A  +  B )  +  ( abs `  ( A  -  B )
) )  /  2
) ) ) )
141, 13mpd 13 . 2  |-  ( ph  ->  ( C  <  A  \/  A  <  ( ( ( A  +  B
)  +  ( abs `  ( A  -  B
) ) )  / 
2 ) ) )
151adantr 276 . . . . 5  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  C  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )
163adantr 276 . . . . . 6  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  A  e.  RR )
174adantr 276 . . . . . 6  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  B  e.  RR )
1816, 17resubcld 8708 . . . . . . . 8  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( A  -  B )  e.  RR )
19 2re 9374 . . . . . . . . . . . . . 14  |-  2  e.  RR
2019a1i 9 . . . . . . . . . . . . 13  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  2  e.  RR )
2120, 16remulcld 8356 . . . . . . . . . . . 12  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( 2  x.  A )  e.  RR )
2221recnd 8354 . . . . . . . . . . 11  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( 2  x.  A )  e.  CC )
236adantr 276 . . . . . . . . . . 11  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  A  e.  CC )
247adantr 276 . . . . . . . . . . 11  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  B  e.  CC )
2522, 23, 24subsub4d 8668 . . . . . . . . . 10  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( (
( 2  x.  A
)  -  A )  -  B )  =  ( ( 2  x.  A )  -  ( A  +  B )
) )
26 2cnd 9377 . . . . . . . . . . . . . 14  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  2  e.  CC )
2726, 23mulsubfacd 8746 . . . . . . . . . . . . 13  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( (
2  x.  A )  -  A )  =  ( ( 2  -  1 )  x.  A
) )
28 2m1e1 9422 . . . . . . . . . . . . . 14  |-  ( 2  -  1 )  =  1
2928oveq1i 6095 . . . . . . . . . . . . 13  |-  ( ( 2  -  1 )  x.  A )  =  ( 1  x.  A
)
3027, 29eqtrdi 2287 . . . . . . . . . . . 12  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( (
2  x.  A )  -  A )  =  ( 1  x.  A
) )
3123mullidd 8344 . . . . . . . . . . . 12  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( 1  x.  A )  =  A )
3230, 31eqtrd 2271 . . . . . . . . . . 11  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( (
2  x.  A )  -  A )  =  A )
3332oveq1d 6100 . . . . . . . . . 10  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( (
( 2  x.  A
)  -  A )  -  B )  =  ( A  -  B
) )
3425, 33eqtr3d 2273 . . . . . . . . 9  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( (
2  x.  A )  -  ( A  +  B ) )  =  ( A  -  B
) )
35 simpr 110 . . . . . . . . . . 11  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )
3610adantr 276 . . . . . . . . . . . 12  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( ( A  +  B )  +  ( abs `  ( A  -  B )
) )  e.  RR )
37 2rp 10059 . . . . . . . . . . . . 13  |-  2  e.  RR+
3837a1i 9 . . . . . . . . . . . 12  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  2  e.  RR+ )
3916, 36, 38ltmuldiv2d 10146 . . . . . . . . . . 11  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( (
2  x.  A )  <  ( ( A  +  B )  +  ( abs `  ( A  -  B )
) )  <->  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) ) )
4035, 39mpbird 167 . . . . . . . . . 10  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( 2  x.  A )  < 
( ( A  +  B )  +  ( abs `  ( A  -  B ) ) ) )
415adantr 276 . . . . . . . . . . 11  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( A  +  B )  e.  RR )
429adantr 276 . . . . . . . . . . 11  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( abs `  ( A  -  B
) )  e.  RR )
4321, 41, 42ltsubadd2d 8871 . . . . . . . . . 10  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( (
( 2  x.  A
)  -  ( A  +  B ) )  <  ( abs `  ( A  -  B )
)  <->  ( 2  x.  A )  <  (
( A  +  B
)  +  ( abs `  ( A  -  B
) ) ) ) )
4440, 43mpbird 167 . . . . . . . . 9  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( (
2  x.  A )  -  ( A  +  B ) )  < 
( abs `  ( A  -  B )
) )
4534, 44eqbrtrrd 4154 . . . . . . . 8  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( A  -  B )  <  ( abs `  ( A  -  B ) ) )
46 ltabs 11853 . . . . . . . 8  |-  ( ( ( A  -  B
)  e.  RR  /\  ( A  -  B
)  <  ( abs `  ( A  -  B
) ) )  -> 
( A  -  B
)  <  0 )
4718, 45, 46syl2anc 415 . . . . . . 7  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( A  -  B )  <  0
)
4816, 17sublt0d 8898 . . . . . . 7  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( ( A  -  B )  <  0  <->  A  <  B ) )
4947, 48mpbid 147 . . . . . 6  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  A  <  B )
5016, 17, 49maxabslemab 11972 . . . . 5  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  ( (
( A  +  B
)  +  ( abs `  ( A  -  B
) ) )  / 
2 )  =  B )
5115, 50breqtrd 4156 . . . 4  |-  ( (
ph  /\  A  <  ( ( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 ) )  ->  C  <  B )
5251ex 115 . . 3  |-  ( ph  ->  ( A  <  (
( ( A  +  B )  +  ( abs `  ( A  -  B ) ) )  /  2 )  ->  C  <  B
) )
5352orim2d 800 . 2  |-  ( ph  ->  ( ( C  < 
A  \/  A  < 
( ( ( A  +  B )  +  ( abs `  ( A  -  B )
) )  /  2
) )  ->  ( C  <  A  \/  C  <  B ) ) )
5414, 53mpd 13 1  |-  ( ph  ->  ( C  <  A  \/  C  <  B ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    \/ wo 720    e. wcel 2209   class class class wbr 4130   ` cfv 5377  (class class class)co 6085   CCcc 8177   RRcr 8178   0cc0 8179   1c1 8180    + caddc 8182    x. cmul 8184    < clt 8360    - cmin 8497    / cdiv 9002   2c2 9355   RR+crp 10054   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:  maxabslemval  11974  maxleastlt  11981
  Copyright terms: Public domain W3C validator