ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  maxabslemval Unicode version
Theorem maxabslemval 11714
Description: Lemma for maxabs 11715. Value of the supremum. (Contributed by Jim Kingdon, 22-Dec-2021.)
Assertion
Ref Expression
maxabslemval |- ( ( A e. RR /\ B e. RR ) -> ( ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) e. RR /\ A. x e. { A , B } -. ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < x /\ A. x e. RR ( x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) -> E. z e. { A , B } x < z ) ) )
Distinct variable groups:   x, A, z   x, B, z
Proof of Theorem maxabslemval
StepHypRef Expression
1 readdcl 8121 . . . 4 |- ( ( A e. RR /\ B e. RR ) -> ( A + B ) e. RR )
2 simpl 109 . . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> A e. RR )
32recnd 8171 . . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> A e. CC )
4 simpr 110 . . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> B e. RR )
54recnd 8171 . . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> B e. CC )
63, 5subcld 8453 . . . . 5 |- ( ( A e. RR /\ B e. RR ) -> ( A - B ) e. CC )
76abscld 11687 . . . 4 |- ( ( A e. RR /\ B e. RR ) -> ( abs ` ( A - B ) ) e. RR )
81, 7readdcld 8172 . . 3 |- ( ( A e. RR /\ B e. RR ) -> ( ( A + B ) + ( abs ` ( A - B ) ) ) e. RR )
98rehalfcld 9354 . 2 |- ( ( A e. RR /\ B e. RR ) -> ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) e. RR )
10 vex 2802 . . . . 5 |- x e. _V
1110elpr 3687 . . . 4 |- ( x e. { A , B } <-> ( x = A \/ x = B ) )
12 maxabsle 11710 . . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> A <_ ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) )
132, 9, 12lensymd 8264 . . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> -. ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < A )
14 breq2 4086 . . . . . . 7 |- ( x = A -> ( ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < x <-> ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < A ) )
1514notbid 671 . . . . . 6 |- ( x = A -> ( -. ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < x <-> -. ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < A ) )
1613, 15syl5ibrcom 157 . . . . 5 |- ( ( A e. RR /\ B e. RR ) -> ( x = A -> -. ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < x ) )
17 maxabsle 11710 . . . . . . . . 9 |- ( ( B e. RR /\ A e. RR ) -> B <_ ( ( ( B + A ) + ( abs ` ( B - A ) ) ) / 2 ) )
1817ancoms 268 . . . . . . . 8 |- ( ( A e. RR /\ B e. RR ) -> B <_ ( ( ( B + A ) + ( abs ` ( B - A ) ) ) / 2 ) )
195, 3addcomd 8293 . . . . . . . . . 10 |- ( ( A e. RR /\ B e. RR ) -> ( B + A ) = ( A + B ) )
205, 3abssubd 11699 . . . . . . . . . 10 |- ( ( A e. RR /\ B e. RR ) -> ( abs ` ( B - A ) ) = ( abs ` ( A - B ) ) )
2119, 20oveq12d 6018 . . . . . . . . 9 |- ( ( A e. RR /\ B e. RR ) -> ( ( B + A ) + ( abs ` ( B - A ) ) ) = ( ( A + B ) + ( abs ` ( A - B ) ) ) )
2221oveq1d 6015 . . . . . . . 8 |- ( ( A e. RR /\ B e. RR ) -> ( ( ( B + A ) + ( abs ` ( B - A ) ) ) / 2 ) = ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) )
2318, 22breqtrd 4108 . . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> B <_ ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) )
244, 9, 23lensymd 8264 . . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> -. ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < B )
25 breq2 4086 . . . . . . 7 |- ( x = B -> ( ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < x <-> ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < B ) )
2625notbid 671 . . . . . 6 |- ( x = B -> ( -. ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < x <-> -. ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < B ) )
2724, 26syl5ibrcom 157 . . . . 5 |- ( ( A e. RR /\ B e. RR ) -> ( x = B -> -. ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < x ) )
2816, 27jaod 722 . . . 4 |- ( ( A e. RR /\ B e. RR ) -> ( ( x = A \/ x = B ) -> -. ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < x ) )
2911, 28biimtrid 152 . . 3 |- ( ( A e. RR /\ B e. RR ) -> ( x e. { A , B } -> -. ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < x ) )
3029ralrimiv 2602 . 2 |- ( ( A e. RR /\ B e. RR ) -> A. x e. { A , B } -. ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < x )
31 prid1g 3770 . . . . . . 7 |- ( A e. RR -> A e. { A , B } )
3231ad4antr 494 . . . . . 6 |- ( ( ( ( ( A e. RR /\ B e. RR ) /\ x e. RR ) /\ x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) /\ x < A ) -> A e. { A , B } )
33 breq2 4086 . . . . . . 7 |- ( z = A -> ( x < z <-> x < A ) )
3433rspcev 2907 . . . . . 6 |- ( ( A e. { A , B } /\ x < A ) -> E. z e. { A , B } x < z )
3532, 34sylancom 420 . . . . 5 |- ( ( ( ( ( A e. RR /\ B e. RR ) /\ x e. RR ) /\ x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) /\ x < A ) -> E. z e. { A , B } x < z )
36 prid2g 3771 . . . . . . 7 |- ( B e. RR -> B e. { A , B } )
3736ad4antlr 495 . . . . . 6 |- ( ( ( ( ( A e. RR /\ B e. RR ) /\ x e. RR ) /\ x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) /\ x < B ) -> B e. { A , B } )
38 breq2 4086 . . . . . . 7 |- ( z = B -> ( x < z <-> x < B ) )
3938rspcev 2907 . . . . . 6 |- ( ( B e. { A , B } /\ x < B ) -> E. z e. { A , B } x < z )
4037, 39sylancom 420 . . . . 5 |- ( ( ( ( ( A e. RR /\ B e. RR ) /\ x e. RR ) /\ x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) /\ x < B ) -> E. z e. { A , B } x < z )
412ad2antrr 488 . . . . . 6 |- ( ( ( ( A e. RR /\ B e. RR ) /\ x e. RR ) /\ x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> A e. RR )
424ad2antrr 488 . . . . . 6 |- ( ( ( ( A e. RR /\ B e. RR ) /\ x e. RR ) /\ x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> B e. RR )
43 simplr 528 . . . . . 6 |- ( ( ( ( A e. RR /\ B e. RR ) /\ x e. RR ) /\ x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> x e. RR )
44 simpr 110 . . . . . 6 |- ( ( ( ( A e. RR /\ B e. RR ) /\ x e. RR ) /\ x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) )
4541, 42, 43, 44maxabslemlub 11713 . . . . 5 |- ( ( ( ( A e. RR /\ B e. RR ) /\ x e. RR ) /\ x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( x < A \/ x < B ) )
4635, 40, 45mpjaodan 803 . . . 4 |- ( ( ( ( A e. RR /\ B e. RR ) /\ x e. RR ) /\ x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> E. z e. { A , B } x < z )
4746ex 115 . . 3 |- ( ( ( A e. RR /\ B e. RR ) /\ x e. RR ) -> ( x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) -> E. z e. { A , B } x < z ) )
4847ralrimiva 2603 . 2 |- ( ( A e. RR /\ B e. RR ) -> A. x e. RR ( x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) -> E. z e. { A , B } x < z ) )
499, 30, 483jca 1201 1 |- ( ( A e. RR /\ B e. RR ) -> ( ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) e. RR /\ A. x e. { A , B } -. ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < x /\ A. x e. RR ( x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) -> E. z e. { A , B } x < z ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   \/ wo 713   /\ w3a 1002   = wceq 1395   e. wcel 2200   A.wral 2508   E.wrex 2509   {cpr 3667   class class class wbr 4082   ` cfv 5317  (class class class)co 6000   RRcr 7994   + caddc 7998   < clt 8177   <_ cle 8178   - cmin 8313   / cdiv 8815   2c2 9157   abscabs 11503
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-nul 4209  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-iinf 4679  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-mulrcl 8094  ax-addcom 8095  ax-mulcom 8096  ax-addass 8097  ax-mulass 8098  ax-distr 8099  ax-i2m1 8100  ax-0lt1 8101  ax-1rid 8102  ax-0id 8103  ax-rnegex 8104  ax-precex 8105  ax-cnre 8106  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109  ax-pre-apti 8110  ax-pre-ltadd 8111  ax-pre-mulgt0 8112  ax-pre-mulext 8113  ax-arch 8114  ax-caucvg 8115
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-tr 4182  df-id 4383  df-po 4386  df-iso 4387  df-iord 4456  df-on 4458  df-ilim 4459  df-suc 4461  df-iom 4682  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-recs 6449  df-frec 6535  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183  df-sub 8315  df-neg 8316  df-reap 8718  df-ap 8725  df-div 8816  df-inn 9107  df-2 9165  df-3 9166  df-4 9167  df-n0 9366  df-z 9443  df-uz 9719  df-rp 9846  df-seqfrec 10665  df-exp 10756  df-cj 11348  df-re 11349  df-im 11350  df-rsqrt 11504  df-abs 11505
This theorem is referenced by:  maxabs  11715  maxleast  11719
  Copyright terms: Public domain W3C validator