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

Theorem ioc0 10477
Description: An empty open interval of extended reals. (Contributed by FL, 30-May-2014.)
Assertion
Ref Expression
ioc0  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( A (,] B
)  =  (/)  <->  B  <_  A ) )

Proof of Theorem ioc0
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 iocval 10110 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A (,] B )  =  { x  e.  RR*  |  ( A  <  x  /\  x  <_  B ) } )
21eqeq1d 2238 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( A (,] B
)  =  (/)  <->  { x  e.  RR*  |  ( A  <  x  /\  x  <_  B ) }  =  (/) ) )
3 xrltletr 9999 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  x  e.  RR*  /\  B  e. 
RR* )  ->  (
( A  <  x  /\  x  <_  B )  ->  A  <  B
) )
433com23 1233 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  x  e. 
RR* )  ->  (
( A  <  x  /\  x  <_  B )  ->  A  <  B
) )
543expa 1227 . . . . . 6  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  x  e.  RR* )  ->  ( ( A  < 
x  /\  x  <_  B )  ->  A  <  B ) )
65rexlimdva 2648 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( E. x  e.  RR*  ( A  <  x  /\  x  <_  B )  ->  A  <  B ) )
7 qbtwnxr 10472 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B )  ->  E. x  e.  QQ  ( A  < 
x  /\  x  <  B ) )
8 qre 9816 . . . . . . . . . . . 12  |-  ( x  e.  QQ  ->  x  e.  RR )
98rexrd 8192 . . . . . . . . . . 11  |-  ( x  e.  QQ  ->  x  e.  RR* )
109a1i 9 . . . . . . . . . . . . 13  |-  ( ( x  e.  RR*  /\  ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B ) )  -> 
( x  e.  QQ  ->  x  e.  RR* )
)
11 xrltle 9990 . . . . . . . . . . . . . . 15  |-  ( ( x  e.  RR*  /\  B  e.  RR* )  ->  (
x  <  B  ->  x  <_  B ) )
12113ad2antr2 1187 . . . . . . . . . . . . . 14  |-  ( ( x  e.  RR*  /\  ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B ) )  -> 
( x  <  B  ->  x  <_  B )
)
1312anim2d 337 . . . . . . . . . . . . 13  |-  ( ( x  e.  RR*  /\  ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B ) )  -> 
( ( A  < 
x  /\  x  <  B )  ->  ( A  <  x  /\  x  <_  B ) ) )
1410, 13anim12d 335 . . . . . . . . . . . 12  |-  ( ( x  e.  RR*  /\  ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B ) )  -> 
( ( x  e.  QQ  /\  ( A  <  x  /\  x  <  B ) )  -> 
( x  e.  RR*  /\  ( A  <  x  /\  x  <_  B ) ) ) )
1514ex 115 . . . . . . . . . . 11  |-  ( x  e.  RR*  ->  ( ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B )  ->  (
( x  e.  QQ  /\  ( A  <  x  /\  x  <  B ) )  ->  ( x  e.  RR*  /\  ( A  <  x  /\  x  <_  B ) ) ) ) )
169, 15syl 14 . . . . . . . . . 10  |-  ( x  e.  QQ  ->  (
( A  e.  RR*  /\  B  e.  RR*  /\  A  <  B )  ->  (
( x  e.  QQ  /\  ( A  <  x  /\  x  <  B ) )  ->  ( x  e.  RR*  /\  ( A  <  x  /\  x  <_  B ) ) ) ) )
1716adantr 276 . . . . . . . . 9  |-  ( ( x  e.  QQ  /\  ( A  <  x  /\  x  <  B ) )  ->  ( ( A  e.  RR*  /\  B  e. 
RR*  /\  A  <  B )  ->  ( (
x  e.  QQ  /\  ( A  <  x  /\  x  <  B ) )  ->  ( x  e. 
RR*  /\  ( A  <  x  /\  x  <_  B ) ) ) ) )
1817pm2.43b 52 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B )  ->  (
( x  e.  QQ  /\  ( A  <  x  /\  x  <  B ) )  ->  ( x  e.  RR*  /\  ( A  <  x  /\  x  <_  B ) ) ) )
1918reximdv2 2629 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B )  ->  ( E. x  e.  QQ  ( A  <  x  /\  x  <  B )  ->  E. x  e.  RR*  ( A  <  x  /\  x  <_  B ) ) )
207, 19mpd 13 . . . . . 6  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B )  ->  E. x  e.  RR*  ( A  < 
x  /\  x  <_  B ) )
21203expia 1229 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A  <  B  ->  E. x  e.  RR*  ( A  < 
x  /\  x  <_  B ) ) )
226, 21impbid 129 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( E. x  e.  RR*  ( A  <  x  /\  x  <_  B )  <->  A  <  B ) )
2322notbid 671 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( -.  E. x  e.  RR*  ( A  <  x  /\  x  <_  B )  <->  -.  A  <  B ) )
24 rabeq0 3521 . . . . 5  |-  ( { x  e.  RR*  |  ( A  <  x  /\  x  <_  B ) }  =  (/)  <->  A. x  e.  RR*  -.  ( A  <  x  /\  x  <_  B ) )
25 ralnex 2518 . . . . 5  |-  ( A. x  e.  RR*  -.  ( A  <  x  /\  x  <_  B )  <->  -.  E. x  e.  RR*  ( A  < 
x  /\  x  <_  B ) )
2624, 25bitri 184 . . . 4  |-  ( { x  e.  RR*  |  ( A  <  x  /\  x  <_  B ) }  =  (/)  <->  -.  E. x  e.  RR*  ( A  < 
x  /\  x  <_  B ) )
2726a1i 9 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( { x  e.  RR*  |  ( A  <  x  /\  x  <_  B ) }  =  (/)  <->  -.  E. x  e.  RR*  ( A  < 
x  /\  x  <_  B ) ) )
28 xrlenlt 8207 . . . 4  |-  ( ( B  e.  RR*  /\  A  e.  RR* )  ->  ( B  <_  A  <->  -.  A  <  B ) )
2928ancoms 268 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( B  <_  A  <->  -.  A  <  B ) )
3023, 27, 293bitr4d 220 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( { x  e.  RR*  |  ( A  <  x  /\  x  <_  B ) }  =  (/)  <->  B  <_  A ) )
312, 30bitrd 188 1  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( A (,] B
)  =  (/)  <->  B  <_  A ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1002    = wceq 1395    e. wcel 2200   A.wral 2508   E.wrex 2509   {crab 2512   (/)c0 3491   class class class wbr 4082  (class class class)co 6000   RR*cxr 8176    < clt 8177    <_ cle 8178   QQcq 9810   (,]cioc 10081
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-mulrcl 8094  ax-addcom 8095  ax-mulcom 8096  ax-addass 8097  ax-mulass 8098  ax-distr 8099  ax-i2m1 8100  ax-0lt1 8101  ax-1rid 8102  ax-0id 8103  ax-rnegex 8104  ax-precex 8105  ax-cnre 8106  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109  ax-pre-apti 8110  ax-pre-ltadd 8111  ax-pre-mulgt0 8112  ax-pre-mulext 8113  ax-arch 8114
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-po 4386  df-iso 4387  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183  df-sub 8315  df-neg 8316  df-reap 8718  df-ap 8725  df-div 8816  df-inn 9107  df-2 9165  df-n0 9366  df-z 9443  df-uz 9719  df-q 9811  df-rp 9846  df-ioc 10085
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator