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

Theorem iccss 9838
Description: Condition for a closed interval to be a subset of another closed interval. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 20-Feb-2015.)
Assertion
Ref Expression
iccss  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( A  <_  C  /\  D  <_  B
) )  ->  ( C [,] D )  C_  ( A [,] B ) )

Proof of Theorem iccss
Dummy variables  x  w  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rexr 7917 . . 3  |-  ( A  e.  RR  ->  A  e.  RR* )
2 rexr 7917 . . 3  |-  ( B  e.  RR  ->  B  e.  RR* )
31, 2anim12i 336 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  e.  RR*  /\  B  e.  RR* )
)
4 df-icc 9792 . . 3  |-  [,]  =  ( x  e.  RR* ,  y  e.  RR*  |->  { z  e.  RR*  |  (
x  <_  z  /\  z  <_  y ) } )
5 xrletr 9705 . . 3  |-  ( ( A  e.  RR*  /\  C  e.  RR*  /\  w  e. 
RR* )  ->  (
( A  <_  C  /\  C  <_  w )  ->  A  <_  w
) )
6 xrletr 9705 . . 3  |-  ( ( w  e.  RR*  /\  D  e.  RR*  /\  B  e. 
RR* )  ->  (
( w  <_  D  /\  D  <_  B )  ->  w  <_  B
) )
74, 4, 5, 6ixxss12 9803 . 2  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  ( A  <_  C  /\  D  <_  B ) )  ->  ( C [,] D )  C_  ( A [,] B ) )
83, 7sylan 281 1  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( A  <_  C  /\  D  <_  B
) )  ->  ( C [,] D )  C_  ( A [,] B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    e. wcel 2128    C_ wss 3102   class class class wbr 3965  (class class class)co 5821   RRcr 7725   RR*cxr 7905    <_ cle 7907   [,]cicc 9788
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-13 2130  ax-14 2131  ax-ext 2139  ax-sep 4082  ax-pow 4135  ax-pr 4169  ax-un 4393  ax-setind 4495  ax-cnex 7817  ax-resscn 7818  ax-pre-ltirr 7838  ax-pre-ltwlin 7839  ax-pre-lttrn 7840
This theorem depends on definitions:  df-bi 116  df-3or 964  df-3an 965  df-tru 1338  df-fal 1341  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ne 2328  df-nel 2423  df-ral 2440  df-rex 2441  df-rab 2444  df-v 2714  df-sbc 2938  df-dif 3104  df-un 3106  df-in 3108  df-ss 3115  df-pw 3545  df-sn 3566  df-pr 3567  df-op 3569  df-uni 3773  df-br 3966  df-opab 4026  df-id 4253  df-po 4256  df-iso 4257  df-xp 4591  df-rel 4592  df-cnv 4593  df-co 4594  df-dm 4595  df-iota 5134  df-fun 5171  df-fv 5177  df-ov 5824  df-oprab 5825  df-mpo 5826  df-pnf 7908  df-mnf 7909  df-xr 7910  df-ltxr 7911  df-le 7912  df-icc 9792
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator