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

Theorem xrltmininf 11039
Description: Two ways of saying an extended real is less than the minimum of two others. (Contributed by NM, 7-Feb-2007.) (Revised by Jim Kingdon, 3-May-2023.)
Assertion
Ref Expression
xrltmininf  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( A  < inf ( { B ,  C } ,  RR* ,  <  )  <->  ( A  <  B  /\  A  < 
C ) ) )

Proof of Theorem xrltmininf
StepHypRef Expression
1 xrminmax 11034 . . . 4  |-  ( ( B  e.  RR*  /\  C  e.  RR* )  -> inf ( { B ,  C } ,  RR* ,  <  )  =  -e sup ( {  -e B ,  -e C } ,  RR* ,  <  ) )
213adant1 999 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  -> inf ( { B ,  C } ,  RR* ,  <  )  =  -e sup ( {  -e B ,  -e C } ,  RR* ,  <  ) )
32breq2d 3941 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( A  < inf ( { B ,  C } ,  RR* ,  <  )  <->  A  <  -e sup ( { 
-e B ,  -e C } ,  RR* ,  <  ) ) )
4 simp2 982 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  B  e.  RR* )
54xnegcld 9638 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  -e
B  e.  RR* )
6 simp3 983 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  C  e.  RR* )
76xnegcld 9638 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  -e
C  e.  RR* )
8 simp1 981 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  A  e.  RR* )
98xnegcld 9638 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  -e
A  e.  RR* )
10 xrmaxltsup 11027 . . . 4  |-  ( ( 
-e B  e. 
RR*  /\  -e C  e.  RR*  /\  -e
A  e.  RR* )  ->  ( sup ( { 
-e B ,  -e C } ,  RR* ,  <  )  <  -e A  <->  (  -e
B  <  -e A  /\  -e C  <  -e A ) ) )
115, 7, 9, 10syl3anc 1216 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( sup ( {  -e
B ,  -e
C } ,  RR* ,  <  )  <  -e
A  <->  (  -e
B  <  -e A  /\  -e C  <  -e A ) ) )
12 xrmaxcl 11021 . . . . . . 7  |-  ( ( 
-e B  e. 
RR*  /\  -e C  e.  RR* )  ->  sup ( {  -e B ,  -e C } ,  RR* ,  <  )  e.  RR* )
135, 7, 12syl2anc 408 . . . . . 6  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  sup ( {  -e B ,  -e C } ,  RR* ,  <  )  e.  RR* )
1413xnegcld 9638 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  -e sup ( {  -e
B ,  -e
C } ,  RR* ,  <  )  e.  RR* )
15 xltneg 9619 . . . . 5  |-  ( ( A  e.  RR*  /\  -e sup ( {  -e
B ,  -e
C } ,  RR* ,  <  )  e.  RR* )  ->  ( A  <  -e sup ( {  -e B ,  -e C } ,  RR* ,  <  )  <->  -e  -e sup ( {  -e
B ,  -e
C } ,  RR* ,  <  )  <  -e
A ) )
168, 14, 15syl2anc 408 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( A  <  -e sup ( {  -e B ,  -e C } ,  RR* ,  <  )  <->  -e  -e sup ( {  -e
B ,  -e
C } ,  RR* ,  <  )  <  -e
A ) )
17 xnegneg 9616 . . . . . 6  |-  ( sup ( {  -e
B ,  -e
C } ,  RR* ,  <  )  e.  RR*  -> 
-e  -e sup ( {  -e
B ,  -e
C } ,  RR* ,  <  )  =  sup ( {  -e B ,  -e C } ,  RR* ,  <  ) )
1813, 17syl 14 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  -e  -e sup ( { 
-e B ,  -e C } ,  RR* ,  <  )  =  sup ( {  -e
B ,  -e
C } ,  RR* ,  <  ) )
1918breq1d 3939 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  (  -e  -e sup ( {  -e
B ,  -e
C } ,  RR* ,  <  )  <  -e
A  <->  sup ( {  -e
B ,  -e
C } ,  RR* ,  <  )  <  -e
A ) )
2016, 19bitrd 187 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( A  <  -e sup ( {  -e B ,  -e C } ,  RR* ,  <  )  <->  sup ( {  -e B ,  -e C } ,  RR* ,  <  )  <  -e A ) )
21 xltneg 9619 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A  <  B  <->  -e B  <  -e A ) )
22213adant3 1001 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( A  <  B  <->  -e B  <  -e A ) )
23 xltneg 9619 . . . . 5  |-  ( ( A  e.  RR*  /\  C  e.  RR* )  ->  ( A  <  C  <->  -e C  <  -e A ) )
24233adant2 1000 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( A  <  C  <->  -e C  <  -e A ) )
2522, 24anbi12d 464 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  (
( A  <  B  /\  A  <  C )  <-> 
(  -e B  <  -e A  /\  -e C  <  -e
A ) ) )
2611, 20, 253bitr4d 219 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( A  <  -e sup ( {  -e B ,  -e C } ,  RR* ,  <  )  <->  ( A  <  B  /\  A  < 
C ) ) )
273, 26bitrd 187 1  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( A  < inf ( { B ,  C } ,  RR* ,  <  )  <->  ( A  <  B  /\  A  < 
C ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 962    = wceq 1331    e. wcel 1480   {cpr 3528   class class class wbr 3929   supcsup 6869  infcinf 6870   RR*cxr 7799    < clt 7800    -ecxne 9556
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502  ax-cnex 7711  ax-resscn 7712  ax-1cn 7713  ax-1re 7714  ax-icn 7715  ax-addcl 7716  ax-addrcl 7717  ax-mulcl 7718  ax-mulrcl 7719  ax-addcom 7720  ax-mulcom 7721  ax-addass 7722  ax-mulass 7723  ax-distr 7724  ax-i2m1 7725  ax-0lt1 7726  ax-1rid 7727  ax-0id 7728  ax-rnegex 7729  ax-precex 7730  ax-cnre 7731  ax-pre-ltirr 7732  ax-pre-ltwlin 7733  ax-pre-lttrn 7734  ax-pre-apti 7735  ax-pre-ltadd 7736  ax-pre-mulgt0 7737  ax-pre-mulext 7738  ax-arch 7739  ax-caucvg 7740
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rmo 2424  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-if 3475  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-po 4218  df-iso 4219  df-iord 4288  df-on 4290  df-ilim 4291  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-isom 5132  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-recs 6202  df-frec 6288  df-sup 6871  df-inf 6872  df-pnf 7802  df-mnf 7803  df-xr 7804  df-ltxr 7805  df-le 7806  df-sub 7935  df-neg 7936  df-reap 8337  df-ap 8344  df-div 8433  df-inn 8721  df-2 8779  df-3 8780  df-4 8781  df-n0 8978  df-z 9055  df-uz 9327  df-rp 9442  df-xneg 9559  df-seqfrec 10219  df-exp 10293  df-cj 10614  df-re 10615  df-im 10616  df-rsqrt 10770  df-abs 10771
This theorem is referenced by:  xrminrpcl  11043  iooinsup  11046  blininf  12593  bdxmet  12670  bdmopn  12673
  Copyright terms: Public domain W3C validator