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

Theorem iooinsup 11962
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 3493 . . 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 10241 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A (,) B )  =  { z  e.  RR*  |  ( A  <  z  /\  z  <  B ) } )
3 iooval 10241 . . . 4  |-  ( ( C  e.  RR*  /\  D  e.  RR* )  ->  ( C (,) D )  =  { z  e.  RR*  |  ( C  <  z  /\  z  <  D ) } )
42, 3ineqan12d 3424 . . 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 11943 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  C  e.  RR*  /\  z  e. 
RR* )  ->  ( sup ( { A ,  C } ,  RR* ,  <  )  <  z  <->  ( A  <  z  /\  C  < 
z ) ) )
65ad4ant124 1243 . . . . . . 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 11955 . . . . . . . . . 10  |-  ( ( z  e.  RR*  /\  B  e.  RR*  /\  D  e. 
RR* )  ->  (
z  < inf ( { B ,  D } ,  RR* ,  <  )  <->  ( z  <  B  /\  z  <  D ) ) )
873expb 1231 . . . . . . . . 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 476 . . . . . . 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 473 . . . . . 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 588 . . . . . 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 2801 . . . 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 592 . . 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 2291 . 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 11937 . . . 4  |-  ( ( A  e.  RR*  /\  C  e.  RR* )  ->  sup ( { A ,  C } ,  RR* ,  <  )  e.  RR* )
18 xrmincl 11951 . . . 4  |-  ( ( B  e.  RR*  /\  D  e.  RR* )  -> inf ( { B ,  D } ,  RR* ,  <  )  e.  RR* )
19 iooval 10241 . . . 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 592 . 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 2268 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
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2203   {crab 2524    i^i cin 3210   {cpr 3690   class class class wbr 4109  (class class class)co 6050   supcsup 7273  infcinf 7274   RR*cxr 8307    < clt 8308   (,)cioo 10221
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-mulrcl 8226  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-precex 8237  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243  ax-pre-mulgt0 8244  ax-pre-mulext 8245  ax-arch 8246  ax-caucvg 8247
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-po 4417  df-iso 4418  df-iord 4487  df-on 4489  df-ilim 4490  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-isom 5361  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-recs 6536  df-frec 6622  df-sup 7275  df-inf 7276  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-reap 8849  df-ap 8856  df-div 8947  df-inn 9238  df-2 9296  df-3 9297  df-4 9298  df-n0 9497  df-z 9578  df-uz 9854  df-rp 9987  df-xneg 10105  df-ioo 10225  df-seqfrec 10810  df-exp 10901  df-cj 11527  df-re 11528  df-im 11529  df-rsqrt 11683  df-abs 11684
This theorem is referenced by:  qtopbasss  15386  tgioo  15419
  Copyright terms: Public domain W3C validator