MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ioodisj Structured version   Visualization version   Unicode version

Theorem ioodisj 11790
Description: If the upper bound of one open interval is less than or equal to the lower bound of the other, the intervals are disjoint. (Contributed by Jeff Hankins, 13-Jul-2009.)
Assertion
Ref Expression
ioodisj  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e. 
RR* ) )  /\  B  <_  C )  -> 
( ( A (,) B )  i^i  ( C (,) D ) )  =  (/) )

Proof of Theorem ioodisj
Dummy variables  x  w  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpllr 774 . . . . . 6  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e. 
RR* ) )  /\  B  <_  C )  ->  B  e.  RR* )
2 iooss1 11699 . . . . . 6  |-  ( ( B  e.  RR*  /\  B  <_  C )  ->  ( C (,) D )  C_  ( B (,) D ) )
31, 2sylancom 678 . . . . 5  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e. 
RR* ) )  /\  B  <_  C )  -> 
( C (,) D
)  C_  ( B (,) D ) )
4 ioossicc 11748 . . . . 5  |-  ( B (,) D )  C_  ( B [,] D )
53, 4syl6ss 3455 . . . 4  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e. 
RR* ) )  /\  B  <_  C )  -> 
( C (,) D
)  C_  ( B [,] D ) )
6 sslin 3669 . . . 4  |-  ( ( C (,) D ) 
C_  ( B [,] D )  ->  (
( A (,) B
)  i^i  ( C (,) D ) )  C_  ( ( A (,) B )  i^i  ( B [,] D ) ) )
75, 6syl 17 . . 3  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e. 
RR* ) )  /\  B  <_  C )  -> 
( ( A (,) B )  i^i  ( C (,) D ) ) 
C_  ( ( A (,) B )  i^i  ( B [,] D
) ) )
8 simplll 773 . . . 4  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e. 
RR* ) )  /\  B  <_  C )  ->  A  e.  RR* )
9 simplrr 776 . . . 4  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e. 
RR* ) )  /\  B  <_  C )  ->  D  e.  RR* )
10 df-ioo 11667 . . . . 5  |-  (,)  =  ( x  e.  RR* ,  y  e.  RR*  |->  { z  e.  RR*  |  (
x  <  z  /\  z  <  y ) } )
11 df-icc 11670 . . . . 5  |-  [,]  =  ( x  e.  RR* ,  y  e.  RR*  |->  { z  e.  RR*  |  (
x  <_  z  /\  z  <_  y ) } )
12 xrlenlt 9724 . . . . 5  |-  ( ( B  e.  RR*  /\  w  e.  RR* )  ->  ( B  <_  w  <->  -.  w  <  B ) )
1310, 11, 12ixxdisj 11678 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  D  e. 
RR* )  ->  (
( A (,) B
)  i^i  ( B [,] D ) )  =  (/) )
148, 1, 9, 13syl3anc 1276 . . 3  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e. 
RR* ) )  /\  B  <_  C )  -> 
( ( A (,) B )  i^i  ( B [,] D ) )  =  (/) )
157, 14sseqtrd 3479 . 2  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e. 
RR* ) )  /\  B  <_  C )  -> 
( ( A (,) B )  i^i  ( C (,) D ) ) 
C_  (/) )
16 ss0 3776 . 2  |-  ( ( ( A (,) B
)  i^i  ( C (,) D ) )  C_  (/) 
->  ( ( A (,) B )  i^i  ( C (,) D ) )  =  (/) )
1715, 16syl 17 1  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e. 
RR* ) )  /\  B  <_  C )  -> 
( ( A (,) B )  i^i  ( C (,) D ) )  =  (/) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 375    = wceq 1454    e. wcel 1897    i^i cin 3414    C_ wss 3415   (/)c0 3742   class class class wbr 4415  (class class class)co 6314   RR*cxr 9699    < clt 9700    <_ cle 9701   (,)cioo 11663   [,]cicc 11666
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1679  ax-4 1692  ax-5 1768  ax-6 1815  ax-7 1861  ax-8 1899  ax-9 1906  ax-10 1925  ax-11 1930  ax-12 1943  ax-13 2101  ax-ext 2441  ax-sep 4538  ax-nul 4547  ax-pow 4594  ax-pr 4652  ax-un 6609  ax-cnex 9620  ax-resscn 9621  ax-pre-lttri 9638  ax-pre-lttrn 9639
This theorem depends on definitions:  df-bi 190  df-or 376  df-an 377  df-3or 992  df-3an 993  df-tru 1457  df-ex 1674  df-nf 1678  df-sb 1808  df-eu 2313  df-mo 2314  df-clab 2448  df-cleq 2454  df-clel 2457  df-nfc 2591  df-ne 2634  df-nel 2635  df-ral 2753  df-rex 2754  df-rab 2757  df-v 3058  df-sbc 3279  df-csb 3375  df-dif 3418  df-un 3420  df-in 3422  df-ss 3429  df-nul 3743  df-if 3893  df-pw 3964  df-sn 3980  df-pr 3982  df-op 3986  df-uni 4212  df-iun 4293  df-br 4416  df-opab 4475  df-mpt 4476  df-id 4767  df-po 4773  df-so 4774  df-xp 4858  df-rel 4859  df-cnv 4860  df-co 4861  df-dm 4862  df-rn 4863  df-res 4864  df-ima 4865  df-iota 5564  df-fun 5602  df-fn 5603  df-f 5604  df-f1 5605  df-fo 5606  df-f1o 5607  df-fv 5608  df-ov 6317  df-oprab 6318  df-mpt2 6319  df-1st 6819  df-2nd 6820  df-er 7388  df-en 7595  df-dom 7596  df-sdom 7597  df-pnf 9702  df-mnf 9703  df-xr 9704  df-ltxr 9705  df-le 9706  df-ioo 11667  df-icc 11670
This theorem is referenced by:  reconnlem1  21892  dyaddisjlem  22601  itgsplitioo  22843
  Copyright terms: Public domain W3C validator