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

Theorem iooinsup 12068
Description: Intersection of two open intervals of extended reals. (Contributed by NM, 7-Feb-2007.) (Revised by Jim Kingdon, 22-May-2023.)
Assertion
Ref Expression
iooinsup  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e.  RR* )
)  ->  ( ( A (,) B )  i^i  ( C (,) D
) )  =  ( sup ( { A ,  C } ,  RR* ,  <  ) (,)inf ( { B ,  D } ,  RR* ,  <  )
) )

Proof of Theorem iooinsup
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 inrab 3505 . . 3  |-  ( { z  e.  RR*  |  ( A  <  z  /\  z  <  B ) }  i^i  { z  e. 
RR*  |  ( C  <  z  /\  z  < 
D ) } )  =  { z  e. 
RR*  |  ( ( A  <  z  /\  z  <  B )  /\  ( C  <  z  /\  z  <  D ) ) }
2 iooval 10327 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A (,) B )  =  { z  e.  RR*  |  ( A  <  z  /\  z  <  B ) } )
3 iooval 10327 . . . 4  |-  ( ( C  e.  RR*  /\  D  e.  RR* )  ->  ( C (,) D )  =  { z  e.  RR*  |  ( C  <  z  /\  z  <  D ) } )
42, 3ineqan12d 3434 . . 3  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e.  RR* )
)  ->  ( ( A (,) B )  i^i  ( C (,) D
) )  =  ( { z  e.  RR*  |  ( A  <  z  /\  z  <  B ) }  i^i  { z  e.  RR*  |  ( C  <  z  /\  z  <  D ) } ) )
5 xrmaxltsup 12049 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  C  e.  RR*  /\  z  e. 
RR* )  ->  ( sup ( { A ,  C } ,  RR* ,  <  )  <  z  <->  ( A  <  z  /\  C  < 
z ) ) )
65ad4ant124 1247 . . . . . . 7  |-  ( ( ( ( A  e. 
RR*  /\  C  e.  RR* )  /\  ( B  e.  RR*  /\  D  e. 
RR* ) )  /\  z  e.  RR* )  -> 
( sup ( { A ,  C } ,  RR* ,  <  )  <  z  <->  ( A  < 
z  /\  C  <  z ) ) )
7 xrltmininf 12061 . . . . . . . . . 10  |-  ( ( z  e.  RR*  /\  B  e.  RR*  /\  D  e. 
RR* )  ->  (
z  < inf ( { B ,  D } ,  RR* ,  <  )  <->  ( z  <  B  /\  z  <  D ) ) )
873expb 1235 . . . . . . . . 9  |-  ( ( z  e.  RR*  /\  ( B  e.  RR*  /\  D  e.  RR* ) )  -> 
( z  < inf ( { B ,  D } ,  RR* ,  <  )  <->  ( z  <  B  /\  z  <  D ) ) )
98ancoms 268 . . . . . . . 8  |-  ( ( ( B  e.  RR*  /\  D  e.  RR* )  /\  z  e.  RR* )  ->  ( z  < inf ( { B ,  D } ,  RR* ,  <  )  <->  ( z  <  B  /\  z  <  D ) ) )
109adantll 480 . . . . . . 7  |-  ( ( ( ( A  e. 
RR*  /\  C  e.  RR* )  /\  ( B  e.  RR*  /\  D  e. 
RR* ) )  /\  z  e.  RR* )  -> 
( z  < inf ( { B ,  D } ,  RR* ,  <  )  <->  ( z  <  B  /\  z  <  D ) ) )
116, 10anbi12d 477 . . . . . 6  |-  ( ( ( ( A  e. 
RR*  /\  C  e.  RR* )  /\  ( B  e.  RR*  /\  D  e. 
RR* ) )  /\  z  e.  RR* )  -> 
( ( sup ( { A ,  C } ,  RR* ,  <  )  <  z  /\  z  < inf ( { B ,  D } ,  RR* ,  <  ) )  <->  ( ( A  <  z  /\  C  <  z )  /\  (
z  <  B  /\  z  <  D ) ) ) )
12 an4 592 . . . . . 6  |-  ( ( ( A  <  z  /\  z  <  B )  /\  ( C  < 
z  /\  z  <  D ) )  <->  ( ( A  <  z  /\  C  <  z )  /\  (
z  <  B  /\  z  <  D ) ) )
1311, 12bitr4di 198 . . . . 5  |-  ( ( ( ( A  e. 
RR*  /\  C  e.  RR* )  /\  ( B  e.  RR*  /\  D  e. 
RR* ) )  /\  z  e.  RR* )  -> 
( ( sup ( { A ,  C } ,  RR* ,  <  )  <  z  /\  z  < inf ( { B ,  D } ,  RR* ,  <  ) )  <->  ( ( A  <  z  /\  z  <  B )  /\  ( C  <  z  /\  z  <  D ) ) ) )
1413rabbidva 2809 . . . 4  |-  ( ( ( A  e.  RR*  /\  C  e.  RR* )  /\  ( B  e.  RR*  /\  D  e.  RR* )
)  ->  { z  e.  RR*  |  ( sup ( { A ,  C } ,  RR* ,  <  )  <  z  /\  z  < inf ( { B ,  D } ,  RR* ,  <  ) ) }  =  {
z  e.  RR*  |  ( ( A  <  z  /\  z  <  B )  /\  ( C  < 
z  /\  z  <  D ) ) } )
1514an4s 596 . . 3  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e.  RR* )
)  ->  { z  e.  RR*  |  ( sup ( { A ,  C } ,  RR* ,  <  )  <  z  /\  z  < inf ( { B ,  D } ,  RR* ,  <  ) ) }  =  {
z  e.  RR*  |  ( ( A  <  z  /\  z  <  B )  /\  ( C  < 
z  /\  z  <  D ) ) } )
161, 4, 153eqtr4a 2297 . 2  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e.  RR* )
)  ->  ( ( A (,) B )  i^i  ( C (,) D
) )  =  {
z  e.  RR*  |  ( sup ( { A ,  C } ,  RR* ,  <  )  <  z  /\  z  < inf ( { B ,  D } ,  RR* ,  <  )
) } )
17 xrmaxcl 12043 . . . 4  |-  ( ( A  e.  RR*  /\  C  e.  RR* )  ->  sup ( { A ,  C } ,  RR* ,  <  )  e.  RR* )
18 xrmincl 12057 . . . 4  |-  ( ( B  e.  RR*  /\  D  e.  RR* )  -> inf ( { B ,  D } ,  RR* ,  <  )  e.  RR* )
19 iooval 10327 . . . 4  |-  ( ( sup ( { A ,  C } ,  RR* ,  <  )  e.  RR*  /\ inf ( { B ,  D } ,  RR* ,  <  )  e.  RR* )  ->  ( sup ( { A ,  C } ,  RR* ,  <  ) (,)inf ( { B ,  D } ,  RR* ,  <  ) )  =  { z  e.  RR*  |  ( sup ( { A ,  C } ,  RR* ,  <  )  <  z  /\  z  < inf ( { B ,  D } ,  RR* ,  <  ) ) } )
2017, 18, 19syl2an 289 . . 3  |-  ( ( ( A  e.  RR*  /\  C  e.  RR* )  /\  ( B  e.  RR*  /\  D  e.  RR* )
)  ->  ( sup ( { A ,  C } ,  RR* ,  <  ) (,)inf ( { B ,  D } ,  RR* ,  <  ) )  =  { z  e.  RR*  |  ( sup ( { A ,  C } ,  RR* ,  <  )  <  z  /\  z  < inf ( { B ,  D } ,  RR* ,  <  ) ) } )
2120an4s 596 . 2  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e.  RR* )
)  ->  ( sup ( { A ,  C } ,  RR* ,  <  ) (,)inf ( { B ,  D } ,  RR* ,  <  ) )  =  { z  e.  RR*  |  ( sup ( { A ,  C } ,  RR* ,  <  )  <  z  /\  z  < inf ( { B ,  D } ,  RR* ,  <  ) ) } )
2216, 21eqtr4d 2274 1  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e.  RR* )
)  ->  ( ( A (,) B )  i^i  ( C (,) D
) )  =  ( sup ( { A ,  C } ,  RR* ,  <  ) (,)inf ( { B ,  D } ,  RR* ,  <  )
) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   {crab 2532    i^i cin 3219   {cpr 3710   class class class wbr 4131  (class class class)co 6088   supcsup 7328  infcinf 7329   RR*cxr 8365    < clt 8366   (,)cioo 10307
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 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302  ax-pre-mulext 8303  ax-arch 8304  ax-caucvg 8305
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 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-isom 5389  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-sup 7330  df-inf 7331  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-div 9011  df-inn 9314  df-2 9372  df-3 9373  df-4 9374  df-n0 9575  df-z 9656  df-uz 9938  df-rp 10072  df-xneg 10191  df-ioo 10311  df-seqfrec 10906  df-exp 10997  df-cj 11629  df-re 11630  df-im 11631  df-rsqrt 11786  df-abs 11787
This theorem is used by:  qtopbasss  15747  tgioo  15780
  Copyright terms: Public domain W3C validator