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

Theorem elioc2 10338
Description: Membership in an open-below, closed-above real interval. (Contributed by Paul Chapman, 30-Dec-2007.) (Revised by Mario Carneiro, 14-Jun-2014.)
Assertion
Ref Expression
elioc2  |-  ( ( A  e.  RR*  /\  B  e.  RR )  ->  ( C  e.  ( A (,] B )  <->  ( C  e.  RR  /\  A  < 
C  /\  C  <_  B ) ) )

Proof of Theorem elioc2
StepHypRef Expression
1 rexr 8371 . . 3  |-  ( B  e.  RR  ->  B  e.  RR* )
2 elioc1 10324 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( C  e.  ( A (,] B )  <->  ( C  e.  RR*  /\  A  < 
C  /\  C  <_  B ) ) )
31, 2sylan2 286 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR )  ->  ( C  e.  ( A (,] B )  <->  ( C  e.  RR*  /\  A  < 
C  /\  C  <_  B ) ) )
4 mnfxr 8382 . . . . . . . 8  |- -oo  e.  RR*
54a1i 9 . . . . . . 7  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  ( C  e. 
RR*  /\  A  <  C  /\  C  <_  B
) )  -> -oo  e.  RR* )
6 simpll 531 . . . . . . 7  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  ( C  e. 
RR*  /\  A  <  C  /\  C  <_  B
) )  ->  A  e.  RR* )
7 simpr1 1034 . . . . . . 7  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  ( C  e. 
RR*  /\  A  <  C  /\  C  <_  B
) )  ->  C  e.  RR* )
8 mnfle 10194 . . . . . . . 8  |-  ( A  e.  RR*  -> -oo  <_  A )
98ad2antrr 492 . . . . . . 7  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  ( C  e. 
RR*  /\  A  <  C  /\  C  <_  B
) )  -> -oo  <_  A )
10 simpr2 1035 . . . . . . 7  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  ( C  e. 
RR*  /\  A  <  C  /\  C  <_  B
) )  ->  A  <  C )
115, 6, 7, 9, 10xrlelttrd 10212 . . . . . 6  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  ( C  e. 
RR*  /\  A  <  C  /\  C  <_  B
) )  -> -oo  <  C )
121ad2antlr 493 . . . . . . 7  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  ( C  e. 
RR*  /\  A  <  C  /\  C  <_  B
) )  ->  B  e.  RR* )
13 pnfxr 8378 . . . . . . . 8  |- +oo  e.  RR*
1413a1i 9 . . . . . . 7  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  ( C  e. 
RR*  /\  A  <  C  /\  C  <_  B
) )  -> +oo  e.  RR* )
15 simpr3 1036 . . . . . . 7  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  ( C  e. 
RR*  /\  A  <  C  /\  C  <_  B
) )  ->  C  <_  B )
16 ltpnf 10182 . . . . . . . 8  |-  ( B  e.  RR  ->  B  < +oo )
1716ad2antlr 493 . . . . . . 7  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  ( C  e. 
RR*  /\  A  <  C  /\  C  <_  B
) )  ->  B  < +oo )
187, 12, 14, 15, 17xrlelttrd 10212 . . . . . 6  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  ( C  e. 
RR*  /\  A  <  C  /\  C  <_  B
) )  ->  C  < +oo )
19 xrrebnd 10221 . . . . . . 7  |-  ( C  e.  RR*  ->  ( C  e.  RR  <->  ( -oo  <  C  /\  C  < +oo ) ) )
207, 19syl 14 . . . . . 6  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  ( C  e. 
RR*  /\  A  <  C  /\  C  <_  B
) )  ->  ( C  e.  RR  <->  ( -oo  <  C  /\  C  < +oo ) ) )
2111, 18, 20mpbir2and 957 . . . . 5  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  ( C  e. 
RR*  /\  A  <  C  /\  C  <_  B
) )  ->  C  e.  RR )
2221, 10, 153jca 1208 . . . 4  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  ( C  e. 
RR*  /\  A  <  C  /\  C  <_  B
) )  ->  ( C  e.  RR  /\  A  <  C  /\  C  <_  B ) )
2322ex 115 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR )  ->  (
( C  e.  RR*  /\  A  <  C  /\  C  <_  B )  -> 
( C  e.  RR  /\  A  <  C  /\  C  <_  B ) ) )
24 rexr 8371 . . . 4  |-  ( C  e.  RR  ->  C  e.  RR* )
25243anim1i 1216 . . 3  |-  ( ( C  e.  RR  /\  A  <  C  /\  C  <_  B )  ->  ( C  e.  RR*  /\  A  <  C  /\  C  <_  B ) )
2623, 25impbid1 142 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR )  ->  (
( C  e.  RR*  /\  A  <  C  /\  C  <_  B )  <->  ( C  e.  RR  /\  A  < 
C  /\  C  <_  B ) ) )
273, 26bitrd 188 1  |-  ( ( A  e.  RR*  /\  B  e.  RR )  ->  ( C  e.  ( A (,] B )  <->  ( C  e.  RR  /\  A  < 
C  /\  C  <_  B ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    e. wcel 2209   class class class wbr 4130  (class class class)co 6085   RRcr 8178   +oocpnf 8357   -oocmnf 8358   RR*cxr 8359    < clt 8360    <_ cle 8361   (,]cioc 10291
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293
This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-ioc 10295
This theorem is used by:  iocssre  10355  ef01bndlem  12523  sin01bnd  12524  cos01bnd  12525  cos1bnd  12526  sinltxirr  12528  sin01gt0  12529  cos01gt0  12530  sin02gt0  12531  sincos1sgn  12532  sincos2sgn  12533  cos12dec  12535  sin0pilem1  15882  sin0pilem2  15883  sinhalfpilem  15892  sincosq1lem  15926  coseq0negpitopi  15937  tangtx  15939  sincos4thpi  15941  pigt3  15945  repiecelem  17074  repiecele0  17075
  Copyright terms: Public domain W3C validator