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

Theorem iccssico2 10039
Description: Condition for a closed interval to be a subset of a closed-below, open-above interval. (Contributed by Mario Carneiro, 20-Feb-2015.)
Assertion
Ref Expression
iccssico2  |-  ( ( C  e.  ( A [,) B )  /\  D  e.  ( A [,) B ) )  -> 
( C [,] D
)  C_  ( A [,) B ) )

Proof of Theorem iccssico2
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ico 9986 . . . 4  |-  [,)  =  ( x  e.  RR* ,  y  e.  RR*  |->  { z  e.  RR*  |  (
x  <_  z  /\  z  <  y ) } )
21elmpocl1 6123 . . 3  |-  ( C  e.  ( A [,) B )  ->  A  e.  RR* )
32adantr 276 . 2  |-  ( ( C  e.  ( A [,) B )  /\  D  e.  ( A [,) B ) )  ->  A  e.  RR* )
41elmpocl2 6124 . . 3  |-  ( C  e.  ( A [,) B )  ->  B  e.  RR* )
54adantr 276 . 2  |-  ( ( C  e.  ( A [,) B )  /\  D  e.  ( A [,) B ) )  ->  B  e.  RR* )
61elixx3g 9993 . . . . 5  |-  ( C  e.  ( A [,) B )  <->  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  /\  ( A  <_  C  /\  C  <  B ) ) )
76simprbi 275 . . . 4  |-  ( C  e.  ( A [,) B )  ->  ( A  <_  C  /\  C  <  B ) )
87simpld 112 . . 3  |-  ( C  e.  ( A [,) B )  ->  A  <_  C )
98adantr 276 . 2  |-  ( ( C  e.  ( A [,) B )  /\  D  e.  ( A [,) B ) )  ->  A  <_  C )
101elixx3g 9993 . . . . 5  |-  ( D  e.  ( A [,) B )  <->  ( ( A  e.  RR*  /\  B  e.  RR*  /\  D  e. 
RR* )  /\  ( A  <_  D  /\  D  <  B ) ) )
1110simprbi 275 . . . 4  |-  ( D  e.  ( A [,) B )  ->  ( A  <_  D  /\  D  <  B ) )
1211simprd 114 . . 3  |-  ( D  e.  ( A [,) B )  ->  D  <  B )
1312adantl 277 . 2  |-  ( ( C  e.  ( A [,) B )  /\  D  e.  ( A [,) B ) )  ->  D  <  B )
14 iccssico 10037 . 2  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  ( A  <_  C  /\  D  <  B ) )  ->  ( C [,] D )  C_  ( A [,) B ) )
153, 5, 9, 13, 14syl22anc 1250 1  |-  ( ( C  e.  ( A [,) B )  /\  D  e.  ( A [,) B ) )  -> 
( C [,] D
)  C_  ( A [,) B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 980    e. wcel 2167   {crab 2479    C_ wss 3157   class class class wbr 4034  (class class class)co 5925   RR*cxr 8077    < clt 8078    <_ cle 8079   [,)cico 9982   [,]cicc 9983
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-id 4329  df-po 4332  df-iso 4333  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-iota 5220  df-fun 5261  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-ico 9986  df-icc 9987
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator