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

Theorem xrltmininf 11821
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 11816 . . . 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 4098 . 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 10080 . . . 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 10080 . . . 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 10080 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  -e
A  e.  RR* )
10 xrmaxltsup 11809 . . . 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 11803 . . . . . . 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 10080 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  -e sup ( {  -e
B ,  -e
C } ,  RR* ,  <  )  e.  RR* )
15 xltneg 10061 . . . . 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 10058 . . . . . 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 4096 . . . 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 10061 . . . . 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 10061 . . . . 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 3668   class class class wbr 4086   supcsup 7172  infcinf 7173   RR*cxr 8203    < clt 8204    -ecxne 9994
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 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-mulrcl 8121  ax-addcom 8122  ax-mulcom 8123  ax-addass 8124  ax-mulass 8125  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-1rid 8129  ax-0id 8130  ax-rnegex 8131  ax-precex 8132  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-apti 8137  ax-pre-ltadd 8138  ax-pre-mulgt0 8139  ax-pre-mulext 8140  ax-arch 8141  ax-caucvg 8142
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 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-po 4391  df-iso 4392  df-iord 4461  df-on 4463  df-ilim 4464  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-isom 5333  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-frec 6552  df-sup 7174  df-inf 7175  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-reap 8745  df-ap 8752  df-div 8843  df-inn 9134  df-2 9192  df-3 9193  df-4 9194  df-n0 9393  df-z 9470  df-uz 9746  df-rp 9879  df-xneg 9997  df-seqfrec 10700  df-exp 10791  df-cj 11393  df-re 11394  df-im 11395  df-rsqrt 11549  df-abs 11550
This theorem is referenced by:  xrminrpcl  11825  iooinsup  11828  blininf  15138  bdxmet  15215  bdmopn  15218
  Copyright terms: Public domain W3C validator