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

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

Proof of Theorem ico0
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 icoval 9994 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A [,) B )  =  { x  e.  RR*  |  ( A  <_  x  /\  x  <  B ) } )
21eqeq1d 2205 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( A [,) B
)  =  (/)  <->  { x  e.  RR*  |  ( A  <_  x  /\  x  <  B ) }  =  (/) ) )
3 xrlelttr 9881 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  x  e.  RR*  /\  B  e. 
RR* )  ->  (
( A  <_  x  /\  x  <  B )  ->  A  <  B
) )
433com23 1211 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  x  e. 
RR* )  ->  (
( A  <_  x  /\  x  <  B )  ->  A  <  B
) )
543expa 1205 . . . . . 6  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  x  e.  RR* )  ->  ( ( A  <_  x  /\  x  <  B
)  ->  A  <  B ) )
65rexlimdva 2614 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( E. x  e.  RR*  ( A  <_  x  /\  x  <  B )  ->  A  <  B ) )
7 qbtwnxr 10347 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B )  ->  E. x  e.  QQ  ( A  < 
x  /\  x  <  B ) )
8 qre 9699 . . . . . . . . . . . 12  |-  ( x  e.  QQ  ->  x  e.  RR )
98rexrd 8076 . . . . . . . . . . 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 simpr1 1005 . . . . . . . . . . . . . . 15  |-  ( ( x  e.  RR*  /\  ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B ) )  ->  A  e.  RR* )
12 simpl 109 . . . . . . . . . . . . . . 15  |-  ( ( x  e.  RR*  /\  ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B ) )  ->  x  e.  RR* )
13 xrltle 9873 . . . . . . . . . . . . . . 15  |-  ( ( A  e.  RR*  /\  x  e.  RR* )  ->  ( A  <  x  ->  A  <_  x ) )
1411, 12, 13syl2anc 411 . . . . . . . . . . . . . 14  |-  ( ( x  e.  RR*  /\  ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B ) )  -> 
( A  <  x  ->  A  <_  x )
)
1514anim1d 336 . . . . . . . . . . . . 13  |-  ( ( x  e.  RR*  /\  ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B ) )  -> 
( ( A  < 
x  /\  x  <  B )  ->  ( A  <_  x  /\  x  < 
B ) ) )
1610, 15anim12d 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 ) ) ) )
1716ex 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 ) ) ) ) )
189, 17syl 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 ) ) ) ) )
1918adantr 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 ) ) ) ) )
2019pm2.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 ) ) ) )
2120reximdv2 2596 . . . . . . 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 ) ) )
227, 21mpd 13 . . . . . 6  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B )  ->  E. x  e.  RR*  ( A  <_  x  /\  x  <  B
) )
23223expia 1207 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A  <  B  ->  E. x  e.  RR*  ( A  <_  x  /\  x  <  B
) ) )
246, 23impbid 129 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( E. x  e.  RR*  ( A  <_  x  /\  x  <  B )  <->  A  <  B ) )
2524notbid 668 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( -.  E. x  e.  RR*  ( A  <_  x  /\  x  <  B )  <->  -.  A  <  B ) )
26 rabeq0 3480 . . . . 5  |-  ( { x  e.  RR*  |  ( A  <_  x  /\  x  <  B ) }  =  (/)  <->  A. x  e.  RR*  -.  ( A  <_  x  /\  x  <  B ) )
27 ralnex 2485 . . . . 5  |-  ( A. x  e.  RR*  -.  ( A  <_  x  /\  x  <  B )  <->  -.  E. x  e.  RR*  ( A  <_  x  /\  x  <  B
) )
2826, 27bitri 184 . . . 4  |-  ( { x  e.  RR*  |  ( A  <_  x  /\  x  <  B ) }  =  (/)  <->  -.  E. x  e.  RR*  ( A  <_  x  /\  x  <  B
) )
2928a1i 9 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( { x  e.  RR*  |  ( A  <_  x  /\  x  <  B ) }  =  (/)  <->  -.  E. x  e.  RR*  ( A  <_  x  /\  x  <  B
) ) )
30 xrlenlt 8091 . . . 4  |-  ( ( B  e.  RR*  /\  A  e.  RR* )  ->  ( B  <_  A  <->  -.  A  <  B ) )
3130ancoms 268 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( B  <_  A  <->  -.  A  <  B ) )
3225, 29, 313bitr4d 220 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( { x  e.  RR*  |  ( A  <_  x  /\  x  <  B ) }  =  (/)  <->  B  <_  A ) )
332, 32bitrd 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 980    = wceq 1364    e. wcel 2167   A.wral 2475   E.wrex 2476   {crab 2479   (/)c0 3450   class class class wbr 4033  (class class class)co 5922   RR*cxr 8060    < clt 8061    <_ cle 8062   QQcq 9693   [,)cico 9965
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 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-mulrcl 7978  ax-addcom 7979  ax-mulcom 7980  ax-addass 7981  ax-mulass 7982  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-1rid 7986  ax-0id 7987  ax-rnegex 7988  ax-precex 7989  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-apti 7994  ax-pre-ltadd 7995  ax-pre-mulgt0 7996  ax-pre-mulext 7997  ax-arch 7998
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-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-po 4331  df-iso 4332  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-reap 8602  df-ap 8609  df-div 8700  df-inn 8991  df-2 9049  df-n0 9250  df-z 9327  df-uz 9602  df-q 9694  df-rp 9729  df-ico 9969
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator