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

Theorem xrminltinf 12066
Description: Two ways of saying an extended real is greater than the minimum of two others. (Contributed by Jim Kingdon, 19-May-2023.)
Assertion
Ref Expression
xrminltinf  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  (inf ( { B ,  C } ,  RR* ,  <  )  <  A  <->  ( B  <  A  \/  C  < 
A ) ) )

Proof of Theorem xrminltinf
StepHypRef Expression
1 xnegcl 10254 . . . 4  |-  ( B  e.  RR*  ->  -e
B  e.  RR* )
213ad2ant2 1050 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  -e
B  e.  RR* )
3 xnegcl 10254 . . . 4  |-  ( C  e.  RR*  ->  -e
C  e.  RR* )
433ad2ant3 1051 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  -e
C  e.  RR* )
5 xnegcl 10254 . . . 4  |-  ( A  e.  RR*  ->  -e
A  e.  RR* )
653ad2ant1 1049 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  -e
A  e.  RR* )
7 xrltmaxsup 12051 . . 3  |-  ( ( 
-e B  e. 
RR*  /\  -e C  e.  RR*  /\  -e
A  e.  RR* )  ->  (  -e A  <  sup ( {  -e
B ,  -e
C } ,  RR* ,  <  )  <->  (  -e
A  <  -e B  \/  -e A  <  -e C ) ) )
82, 4, 6, 7syl3anc 1278 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  (  -e A  <  sup ( {  -e B ,  -e C } ,  RR* ,  <  )  <-> 
(  -e A  <  -e B  \/  -e A  <  -e
C ) ) )
9 xrminmax 12059 . . . . 5  |-  ( ( B  e.  RR*  /\  C  e.  RR* )  -> inf ( { B ,  C } ,  RR* ,  <  )  =  -e sup ( {  -e B ,  -e C } ,  RR* ,  <  ) )
1093adant1 1046 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  -> inf ( { B ,  C } ,  RR* ,  <  )  =  -e sup ( {  -e B ,  -e C } ,  RR* ,  <  ) )
11 xnegneg 10255 . . . . . 6  |-  ( A  e.  RR*  ->  -e  -e A  =  A )
1211eqcomd 2244 . . . . 5  |-  ( A  e.  RR*  ->  A  = 
-e  -e
A )
13123ad2ant1 1049 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  A  =  -e  -e
A )
1410, 13breq12d 4144 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  (inf ( { B ,  C } ,  RR* ,  <  )  <  A  <->  -e sup ( {  -e
B ,  -e
C } ,  RR* ,  <  )  <  -e  -e A ) )
15 xrmaxcl 12046 . . . . 5  |-  ( ( 
-e B  e. 
RR*  /\  -e C  e.  RR* )  ->  sup ( {  -e B ,  -e C } ,  RR* ,  <  )  e.  RR* )
162, 4, 15syl2anc 415 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  sup ( {  -e B ,  -e C } ,  RR* ,  <  )  e.  RR* )
17 xltneg 10258 . . . 4  |-  ( ( 
-e A  e. 
RR*  /\  sup ( {  -e B ,  -e C } ,  RR* ,  <  )  e. 
RR* )  ->  (  -e A  <  sup ( {  -e B ,  -e C } ,  RR* ,  <  )  <->  -e sup ( {  -e B ,  -e C } ,  RR* ,  <  )  <  -e  -e A ) )
186, 16, 17syl2anc 415 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  (  -e A  <  sup ( {  -e B ,  -e C } ,  RR* ,  <  )  <->  -e sup ( {  -e B ,  -e C } ,  RR* ,  <  )  <  -e  -e A ) )
1914, 18bitr4d 191 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  (inf ( { B ,  C } ,  RR* ,  <  )  <  A  <->  -e A  <  sup ( {  -e
B ,  -e
C } ,  RR* ,  <  ) ) )
20 simp2 1029 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  B  e.  RR* )
21 simp1 1028 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  A  e.  RR* )
22 xltneg 10258 . . . 4  |-  ( ( B  e.  RR*  /\  A  e.  RR* )  ->  ( B  <  A  <->  -e A  <  -e B ) )
2320, 21, 22syl2anc 415 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( B  <  A  <->  -e A  <  -e B ) )
24 simp3 1030 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  C  e.  RR* )
25 xltneg 10258 . . . 4  |-  ( ( C  e.  RR*  /\  A  e.  RR* )  ->  ( C  <  A  <->  -e A  <  -e C ) )
2624, 21, 25syl2anc 415 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( C  <  A  <->  -e A  <  -e C ) )
2723, 26orbi12d 805 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  (
( B  <  A  \/  C  <  A )  <-> 
(  -e A  <  -e B  \/  -e A  <  -e
C ) ) )
288, 19, 273bitr4d 220 1  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  (inf ( { B ,  C } ,  RR* ,  <  )  <  A  <->  ( B  <  A  \/  C  < 
A ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    <-> wb 105    \/ wo 720    /\ w3a 1009    = wceq 1402    e. wcel 2209   {cpr 3710   class class class wbr 4131   supcsup 7332  infcinf 7333   RR*cxr 8369    < clt 8370    -ecxne 10191
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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8280  ax-resscn 8281  ax-1cn 8282  ax-1re 8283  ax-icn 8284  ax-addcl 8285  ax-addrcl 8286  ax-mulcl 8287  ax-mulrcl 8288  ax-addcom 8289  ax-mulcom 8290  ax-addass 8291  ax-mulass 8292  ax-distr 8293  ax-i2m1 8294  ax-0lt1 8295  ax-1rid 8296  ax-0id 8297  ax-rnegex 8298  ax-precex 8299  ax-cnre 8300  ax-pre-ltirr 8301  ax-pre-ltwlin 8302  ax-pre-lttrn 8303  ax-pre-apti 8304  ax-pre-ltadd 8305  ax-pre-mulgt0 8306  ax-pre-mulext 8307  ax-arch 8308  ax-caucvg 8309
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 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5343  df-fun 5385  df-fn 5386  df-f 5387  df-f1 5388  df-fo 5389  df-f1o 5390  df-fv 5391  df-isom 5392  df-riota 6044  df-ov 6094  df-oprab 6095  df-mpo 6096  df-1st 6381  df-2nd 6382  df-recs 6584  df-frec 6670  df-sup 7334  df-inf 7335  df-pnf 8372  df-mnf 8373  df-xr 8374  df-ltxr 8375  df-le 8376  df-sub 8510  df-neg 8511  df-reap 8915  df-ap 8922  df-div 9015  df-inn 9318  df-2 9376  df-3 9377  df-4 9378  df-n0 9579  df-z 9658  df-uz 9941  df-rp 10075  df-xneg 10194  df-seqfrec 10909  df-exp 11000  df-cj 11632  df-re 11633  df-im 11634  df-rsqrt 11789  df-abs 11790
This theorem is used by:  bdbl  15780
  Copyright terms: Public domain W3C validator