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

Theorem xrltmininf 11796
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 11791 . . . 4  |-  ( ( B  e.  RR*  /\  C  e.  RR* )  -> inf ( { B ,  C } ,  RR* ,  <  )  =  -e sup ( {  -e B ,  -e C } ,  RR* ,  <  ) )
213adant1 1039 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  -> inf ( { B ,  C } ,  RR* ,  <  )  =  -e sup ( {  -e B ,  -e C } ,  RR* ,  <  ) )
32breq2d 4095 . 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 1022 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  B  e.  RR* )
54xnegcld 10063 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  -e
B  e.  RR* )
6 simp3 1023 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  C  e.  RR* )
76xnegcld 10063 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  -e
C  e.  RR* )
8 simp1 1021 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  A  e.  RR* )
98xnegcld 10063 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  -e
A  e.  RR* )
10 xrmaxltsup 11784 . . . 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 1271 . . 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 11778 . . . . . . 7  |-  ( ( 
-e B  e. 
RR*  /\  -e C  e.  RR* )  ->  sup ( {  -e B ,  -e C } ,  RR* ,  <  )  e.  RR* )
135, 7, 12syl2anc 411 . . . . . 6  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  sup ( {  -e B ,  -e C } ,  RR* ,  <  )  e.  RR* )
1413xnegcld 10063 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  -e sup ( {  -e
B ,  -e
C } ,  RR* ,  <  )  e.  RR* )
15 xltneg 10044 . . . . 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 411 . . . 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 10041 . . . . . 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 4093 . . . 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 188 . . 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 10044 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A  <  B  <->  -e B  <  -e A ) )
22213adant3 1041 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( A  <  B  <->  -e B  <  -e A ) )
23 xltneg 10044 . . . . 5  |-  ( ( A  e.  RR*  /\  C  e.  RR* )  ->  ( A  <  C  <->  -e C  <  -e A ) )
24233adant2 1040 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( A  <  C  <->  -e C  <  -e A ) )
2522, 24anbi12d 473 . . 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 220 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( A  <  -e sup ( {  -e B ,  -e C } ,  RR* ,  <  )  <->  ( A  <  B  /\  A  < 
C ) ) )
273, 26bitrd 188 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 104    <-> wb 105    /\ w3a 1002    = wceq 1395    e. wcel 2200   {cpr 3667   class class class wbr 4083   supcsup 7160  infcinf 7161   RR*cxr 8191    < clt 8192    -ecxne 9977
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 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-mulrcl 8109  ax-addcom 8110  ax-mulcom 8111  ax-addass 8112  ax-mulass 8113  ax-distr 8114  ax-i2m1 8115  ax-0lt1 8116  ax-1rid 8117  ax-0id 8118  ax-rnegex 8119  ax-precex 8120  ax-cnre 8121  ax-pre-ltirr 8122  ax-pre-ltwlin 8123  ax-pre-lttrn 8124  ax-pre-apti 8125  ax-pre-ltadd 8126  ax-pre-mulgt0 8127  ax-pre-mulext 8128  ax-arch 8129  ax-caucvg 8130
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 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-po 4387  df-iso 4388  df-iord 4457  df-on 4459  df-ilim 4460  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-isom 5327  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-recs 6457  df-frec 6543  df-sup 7162  df-inf 7163  df-pnf 8194  df-mnf 8195  df-xr 8196  df-ltxr 8197  df-le 8198  df-sub 8330  df-neg 8331  df-reap 8733  df-ap 8740  df-div 8831  df-inn 9122  df-2 9180  df-3 9181  df-4 9182  df-n0 9381  df-z 9458  df-uz 9734  df-rp 9862  df-xneg 9980  df-seqfrec 10682  df-exp 10773  df-cj 11368  df-re 11369  df-im 11370  df-rsqrt 11524  df-abs 11525
This theorem is referenced by:  xrminrpcl  11800  iooinsup  11803  blininf  15113  bdxmet  15190  bdmopn  15193
  Copyright terms: Public domain W3C validator