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

Theorem iooinsup 11269
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 3407 . . 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 9895 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A (,) B )  =  { z  e.  RR*  |  ( A  <  z  /\  z  <  B ) } )
3 iooval 9895 . . . 4  |-  ( ( C  e.  RR*  /\  D  e.  RR* )  ->  ( C (,) D )  =  { z  e.  RR*  |  ( C  <  z  /\  z  <  D ) } )
42, 3ineqan12d 3338 . . 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 11250 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  C  e.  RR*  /\  z  e. 
RR* )  ->  ( sup ( { A ,  C } ,  RR* ,  <  )  <  z  <->  ( A  <  z  /\  C  < 
z ) ) )
65ad4ant124 1216 . . . . . . 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 11262 . . . . . . . . . 10  |-  ( ( z  e.  RR*  /\  B  e.  RR*  /\  D  e. 
RR* )  ->  (
z  < inf ( { B ,  D } ,  RR* ,  <  )  <->  ( z  <  B  /\  z  <  D ) ) )
873expb 1204 . . . . . . . . 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 586 . . . . . 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 2725 . . . 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 588 . . 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 2236 . 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 11244 . . . 4  |-  ( ( A  e.  RR*  /\  C  e.  RR* )  ->  sup ( { A ,  C } ,  RR* ,  <  )  e.  RR* )
18 xrmincl 11258 . . . 4  |-  ( ( B  e.  RR*  /\  D  e.  RR* )  -> inf ( { B ,  D } ,  RR* ,  <  )  e.  RR* )
19 iooval 9895 . . . 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 588 . 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 2213 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 1353    e. wcel 2148   {crab 2459    i^i cin 3128   {cpr 3592   class class class wbr 4000  (class class class)co 5869   supcsup 6975  infcinf 6976   RR*cxr 7981    < clt 7982   (,)cioo 9875
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533  ax-iinf 4584  ax-cnex 7893  ax-resscn 7894  ax-1cn 7895  ax-1re 7896  ax-icn 7897  ax-addcl 7898  ax-addrcl 7899  ax-mulcl 7900  ax-mulrcl 7901  ax-addcom 7902  ax-mulcom 7903  ax-addass 7904  ax-mulass 7905  ax-distr 7906  ax-i2m1 7907  ax-0lt1 7908  ax-1rid 7909  ax-0id 7910  ax-rnegex 7911  ax-precex 7912  ax-cnre 7913  ax-pre-ltirr 7914  ax-pre-ltwlin 7915  ax-pre-lttrn 7916  ax-pre-apti 7917  ax-pre-ltadd 7918  ax-pre-mulgt0 7919  ax-pre-mulext 7920  ax-arch 7921  ax-caucvg 7922
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-if 3535  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-tr 4099  df-id 4290  df-po 4293  df-iso 4294  df-iord 4363  df-on 4365  df-ilim 4366  df-suc 4368  df-iom 4587  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219  df-fv 5220  df-isom 5221  df-riota 5825  df-ov 5872  df-oprab 5873  df-mpo 5874  df-1st 6135  df-2nd 6136  df-recs 6300  df-frec 6386  df-sup 6977  df-inf 6978  df-pnf 7984  df-mnf 7985  df-xr 7986  df-ltxr 7987  df-le 7988  df-sub 8120  df-neg 8121  df-reap 8522  df-ap 8529  df-div 8619  df-inn 8909  df-2 8967  df-3 8968  df-4 8969  df-n0 9166  df-z 9243  df-uz 9518  df-rp 9641  df-xneg 9759  df-ioo 9879  df-seqfrec 10432  df-exp 10506  df-cj 10835  df-re 10836  df-im 10837  df-rsqrt 10991  df-abs 10992
This theorem is referenced by:  qtopbasss  13688  tgioo  13713
  Copyright terms: Public domain W3C validator