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

Theorem ico0 10368
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 10011 . . 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 9898 . . . . . . . 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 10364 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B )  ->  E. x  e.  QQ  ( A  < 
x  /\  x  <  B ) )
8 qre 9716 . . . . . . . . . . . 12  |-  ( x  e.  QQ  ->  x  e.  RR )
98rexrd 8093 . . . . . . . . . . 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 9890 . . . . . . . . . . . . . . 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 3481 . . . . 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 8108 . . . 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 3451   class class class wbr 4034  (class class class)co 5925   RR*cxr 8077    < clt 8078    <_ cle 8079   QQcq 9710   [,)cico 9982
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 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-mulrcl 7995  ax-addcom 7996  ax-mulcom 7997  ax-addass 7998  ax-mulass 7999  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-1rid 8003  ax-0id 8004  ax-rnegex 8005  ax-precex 8006  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-apti 8011  ax-pre-ltadd 8012  ax-pre-mulgt0 8013  ax-pre-mulext 8014  ax-arch 8015
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 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-po 4332  df-iso 4333  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-reap 8619  df-ap 8626  df-div 8717  df-inn 9008  df-2 9066  df-n0 9267  df-z 9344  df-uz 9619  df-q 9711  df-rp 9746  df-ico 9986
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator