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

Theorem ioc0 10568
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 10197 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A (,] B )  =  { x  e.  RR*  |  ( A  <  x  /\  x  <_  B ) } )
21eqeq1d 2240 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( A (,] B
)  =  (/)  <->  { x  e.  RR*  |  ( A  <  x  /\  x  <_  B ) }  =  (/) ) )
3 xrltletr 10086 . . . . . . . 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 2651 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( E. x  e.  RR*  ( A  <  x  /\  x  <_  B )  ->  A  <  B ) )
7 qbtwnxr 10563 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B )  ->  E. x  e.  QQ  ( A  < 
x  /\  x  <  B ) )
8 qre 9903 . . . . . . . . . . . 12  |-  ( x  e.  QQ  ->  x  e.  RR )
98rexrd 8271 . . . . . . . . . . 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 10077 . . . . . . . . . . . . . . 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 2632 . . . . . . 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 3526 . . . . 5  |-  ( { x  e.  RR*  |  ( A  <  x  /\  x  <_  B ) }  =  (/)  <->  A. x  e.  RR*  -.  ( A  <  x  /\  x  <_  B ) )
25 ralnex 2521 . . . . 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 8286 . . . 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 2202   A.wral 2511   E.wrex 2512   {crab 2515   (/)c0 3496   class class class wbr 4093  (class class class)co 6028   RR*cxr 8255    < clt 8256    <_ cle 8257   QQcq 9897   (,]cioc 10168
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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-mulrcl 8174  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-i2m1 8180  ax-0lt1 8181  ax-1rid 8182  ax-0id 8183  ax-rnegex 8184  ax-precex 8185  ax-cnre 8186  ax-pre-ltirr 8187  ax-pre-ltwlin 8188  ax-pre-lttrn 8189  ax-pre-apti 8190  ax-pre-ltadd 8191  ax-pre-mulgt0 8192  ax-pre-mulext 8193  ax-arch 8194
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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-po 4399  df-iso 4400  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-pnf 8258  df-mnf 8259  df-xr 8260  df-ltxr 8261  df-le 8262  df-sub 8394  df-neg 8395  df-reap 8797  df-ap 8804  df-div 8895  df-inn 9186  df-2 9244  df-n0 9445  df-z 9524  df-uz 9800  df-q 9898  df-rp 9933  df-ioc 10172
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator