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

Theorem ico0 10421
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 10056 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A [,) B )  =  { x  e.  RR*  |  ( A  <_  x  /\  x  <  B ) } )
21eqeq1d 2215 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( A [,) B
)  =  (/)  <->  { x  e.  RR*  |  ( A  <_  x  /\  x  <  B ) }  =  (/) ) )
3 xrlelttr 9943 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  x  e.  RR*  /\  B  e. 
RR* )  ->  (
( A  <_  x  /\  x  <  B )  ->  A  <  B
) )
433com23 1212 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  x  e. 
RR* )  ->  (
( A  <_  x  /\  x  <  B )  ->  A  <  B
) )
543expa 1206 . . . . . 6  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  x  e.  RR* )  ->  ( ( A  <_  x  /\  x  <  B
)  ->  A  <  B ) )
65rexlimdva 2624 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( E. x  e.  RR*  ( A  <_  x  /\  x  <  B )  ->  A  <  B ) )
7 qbtwnxr 10417 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  A  < 
B )  ->  E. x  e.  QQ  ( A  < 
x  /\  x  <  B ) )
8 qre 9761 . . . . . . . . . . . 12  |-  ( x  e.  QQ  ->  x  e.  RR )
98rexrd 8137 . . . . . . . . . . 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 1006 . . . . . . . . . . . . . . 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 9935 . . . . . . . . . . . . . . 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 2606 . . . . . . 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 1208 . . . . 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 669 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( -.  E. x  e.  RR*  ( A  <_  x  /\  x  <  B )  <->  -.  A  <  B ) )
26 rabeq0 3494 . . . . 5  |-  ( { x  e.  RR*  |  ( A  <_  x  /\  x  <  B ) }  =  (/)  <->  A. x  e.  RR*  -.  ( A  <_  x  /\  x  <  B ) )
27 ralnex 2495 . . . . 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 8152 . . . 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 981    = wceq 1373    e. wcel 2177   A.wral 2485   E.wrex 2486   {crab 2489   (/)c0 3464   class class class wbr 4050  (class class class)co 5956   RR*cxr 8121    < clt 8122    <_ cle 8123   QQcq 9755   [,)cico 10027
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-sep 4169  ax-pow 4225  ax-pr 4260  ax-un 4487  ax-setind 4592  ax-cnex 8031  ax-resscn 8032  ax-1cn 8033  ax-1re 8034  ax-icn 8035  ax-addcl 8036  ax-addrcl 8037  ax-mulcl 8038  ax-mulrcl 8039  ax-addcom 8040  ax-mulcom 8041  ax-addass 8042  ax-mulass 8043  ax-distr 8044  ax-i2m1 8045  ax-0lt1 8046  ax-1rid 8047  ax-0id 8048  ax-rnegex 8049  ax-precex 8050  ax-cnre 8051  ax-pre-ltirr 8052  ax-pre-ltwlin 8053  ax-pre-lttrn 8054  ax-pre-apti 8055  ax-pre-ltadd 8056  ax-pre-mulgt0 8057  ax-pre-mulext 8058  ax-arch 8059
This theorem depends on definitions:  df-bi 117  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-nul 3465  df-pw 3622  df-sn 3643  df-pr 3644  df-op 3646  df-uni 3856  df-int 3891  df-iun 3934  df-br 4051  df-opab 4113  df-mpt 4114  df-id 4347  df-po 4350  df-iso 4351  df-xp 4688  df-rel 4689  df-cnv 4690  df-co 4691  df-dm 4692  df-rn 4693  df-res 4694  df-ima 4695  df-iota 5240  df-fun 5281  df-fn 5282  df-f 5283  df-fv 5287  df-riota 5911  df-ov 5959  df-oprab 5960  df-mpo 5961  df-1st 6238  df-2nd 6239  df-pnf 8124  df-mnf 8125  df-xr 8126  df-ltxr 8127  df-le 8128  df-sub 8260  df-neg 8261  df-reap 8663  df-ap 8670  df-div 8761  df-inn 9052  df-2 9110  df-n0 9311  df-z 9388  df-uz 9664  df-q 9756  df-rp 9791  df-ico 10031
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator