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

Theorem ioc0 10646
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 10270 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A (,] B )  =  { x  e.  RR*  |  ( A  <  x  /\  x  <_  B ) } )
21eqeq1d 2243 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( A (,] B
)  =  (/)  <->  { x  e.  RR*  |  ( A  <  x  /\  x  <_  B ) }  =  (/) ) )
3 xrltletr 10159 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  x  e.  RR*  /\  B  e. 
RR* )  ->  (
( A  <  x  /\  x  <_  B )  ->  A  <  B
) )
433com23 1236 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  x  e. 
RR* )  ->  (
( A  <  x  /\  x  <_  B )  ->  A  <  B
) )
543expa 1230 . . . . . 6  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  x  e.  RR* )  ->  ( ( A  < 
x  /\  x  <_  B )  ->  A  <  B ) )
65rexlimdva 2662 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( E. x  e.  RR*  ( A  <  x  /\  x  <_  B )  ->  A  <  B ) )
7 qbtwnxr 10641 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B )  ->  E. x  e.  QQ  ( A  < 
x  /\  x  <  B ) )
8 qre 9975 . . . . . . . . . . . 12  |-  ( x  e.  QQ  ->  x  e.  RR )
98rexrd 8339 . . . . . . . . . . 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 10150 . . . . . . . . . . . . . . 15  |-  ( ( x  e.  RR*  /\  B  e.  RR* )  ->  (
x  <  B  ->  x  <_  B ) )
12113ad2antr2 1190 . . . . . . . . . . . . . 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 2643 . . . . . . 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 1232 . . . . 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 673 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( -.  E. x  e.  RR*  ( A  <  x  /\  x  <_  B )  <->  -.  A  <  B ) )
24 rabeq0 3542 . . . . 5  |-  ( { x  e.  RR*  |  ( A  <  x  /\  x  <_  B ) }  =  (/)  <->  A. x  e.  RR*  -.  ( A  <  x  /\  x  <_  B ) )
25 ralnex 2532 . . . . 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 8354 . . . 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 1005    = wceq 1398    e. wcel 2205   A.wral 2522   E.wrex 2523   {crab 2526   (/)c0 3512   class class class wbr 4114  (class class class)co 6058   RR*cxr 8323    < clt 8324    <_ cle 8325   QQcq 9969   (,]cioc 10241
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260  ax-pre-mulext 8261  ax-arch 8262
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-po 4422  df-iso 4423  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-reap 8866  df-ap 8873  df-div 8964  df-inn 9255  df-2 9313  df-n0 9514  df-z 9595  df-uz 9872  df-q 9970  df-rp 10005  df-ioc 10245
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator