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

Theorem icc0r 10307
Description: An empty closed interval of extended reals. (Contributed by Jim Kingdon, 30-Mar-2020.)
Assertion
Ref Expression
icc0r  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( B  <  A  ->  ( A [,] B )  =  (/) ) )

Proof of Theorem icc0r
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 xrletr 10189 . . . . . . 7  |-  ( ( A  e.  RR*  /\  x  e.  RR*  /\  B  e. 
RR* )  ->  (
( A  <_  x  /\  x  <_  B )  ->  A  <_  B
) )
213com23 1240 . . . . . 6  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  x  e. 
RR* )  ->  (
( A  <_  x  /\  x  <_  B )  ->  A  <_  B
) )
323expa 1234 . . . . 5  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  x  e.  RR* )  ->  ( ( A  <_  x  /\  x  <_  B
)  ->  A  <_  B ) )
43rexlimdva 2668 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( E. x  e.  RR*  ( A  <_  x  /\  x  <_  B )  ->  A  <_  B ) )
5 xrlenlt 8380 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A  <_  B  <->  -.  B  <  A ) )
64, 5sylibd 149 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( E. x  e.  RR*  ( A  <_  x  /\  x  <_  B )  ->  -.  B  <  A ) )
76con2d 633 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( B  <  A  ->  -.  E. x  e.  RR*  ( A  <_  x  /\  x  <_  B ) ) )
8 iccval 10301 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A [,] B )  =  { x  e.  RR*  |  ( A  <_  x  /\  x  <_  B ) } )
98eqeq1d 2247 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( A [,] B
)  =  (/)  <->  { x  e.  RR*  |  ( A  <_  x  /\  x  <_  B ) }  =  (/) ) )
10 rabeq0 3552 . . . 4  |-  ( { x  e.  RR*  |  ( A  <_  x  /\  x  <_  B ) }  =  (/)  <->  A. x  e.  RR*  -.  ( A  <_  x  /\  x  <_  B ) )
11 ralnex 2538 . . . 4  |-  ( A. x  e.  RR*  -.  ( A  <_  x  /\  x  <_  B )  <->  -.  E. x  e.  RR*  ( A  <_  x  /\  x  <_  B
) )
1210, 11bitri 184 . . 3  |-  ( { x  e.  RR*  |  ( A  <_  x  /\  x  <_  B ) }  =  (/)  <->  -.  E. x  e.  RR*  ( A  <_  x  /\  x  <_  B
) )
139, 12bitrdi 196 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( A [,] B
)  =  (/)  <->  -.  E. x  e.  RR*  ( A  <_  x  /\  x  <_  B
) ) )
147, 13sylibrd 169 1  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( B  <  A  ->  ( A [,] B )  =  (/) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   A.wral 2528   E.wrex 2529   {crab 2532   (/)c0 3520   class class class wbr 4125  (class class class)co 6075   RR*cxr 8349    < clt 8350    <_ cle 8351   [,]cicc 10272
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283
This theorem depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-po 4436  df-iso 4437  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-icc 10276
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator