Users' Mathboxes Mathbox for Jeff Hankins < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elicc3 Structured version   Unicode version

Theorem elicc3 26358
Description: An equivalent membership condition for closed intervals. (Contributed by Jeff Hankins, 14-Jul-2009.)
Assertion
Ref Expression
elicc3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( C  e.  ( A [,] B )  <->  ( C  e.  RR*  /\  A  <_  B  /\  ( C  =  A  \/  ( A  <  C  /\  C  <  B )  \/  C  =  B ) ) ) )

Proof of Theorem elicc3
StepHypRef Expression
1 elicc1 10991 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( C  e.  ( A [,] B )  <->  ( C  e.  RR*  /\  A  <_  C  /\  C  <_  B
) ) )
2 simp1 958 . . . . 5  |-  ( ( C  e.  RR*  /\  A  <_  C  /\  C  <_  B )  ->  C  e.  RR* )
32a1i 11 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( C  e.  RR*  /\  A  <_  C  /\  C  <_  B )  ->  C  e.  RR* ) )
4 xrletr 10779 . . . . . . 7  |-  ( ( A  e.  RR*  /\  C  e.  RR*  /\  B  e. 
RR* )  ->  (
( A  <_  C  /\  C  <_  B )  ->  A  <_  B
) )
54exp5o 1173 . . . . . 6  |-  ( A  e.  RR*  ->  ( C  e.  RR*  ->  ( B  e.  RR*  ->  ( A  <_  C  ->  ( C  <_  B  ->  A  <_  B ) ) ) ) )
65com23 75 . . . . 5  |-  ( A  e.  RR*  ->  ( B  e.  RR*  ->  ( C  e.  RR*  ->  ( A  <_  C  ->  ( C  <_  B  ->  A  <_  B ) ) ) ) )
76imp5q 26353 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( C  e.  RR*  /\  A  <_  C  /\  C  <_  B )  ->  A  <_  B ) )
8 df-ne 2607 . . . . . . . . . 10  |-  ( C  =/=  A  <->  -.  C  =  A )
9 xrleltne 10769 . . . . . . . . . . 11  |-  ( ( A  e.  RR*  /\  C  e.  RR*  /\  A  <_  C )  ->  ( A  <  C  <->  C  =/=  A ) )
109biimprd 216 . . . . . . . . . 10  |-  ( ( A  e.  RR*  /\  C  e.  RR*  /\  A  <_  C )  ->  ( C  =/=  A  ->  A  <  C ) )
118, 10syl5bir 211 . . . . . . . . 9  |-  ( ( A  e.  RR*  /\  C  e.  RR*  /\  A  <_  C )  ->  ( -.  C  =  A  ->  A  <  C ) )
12113adant3r3 1165 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  ( C  e.  RR*  /\  A  <_  C  /\  C  <_  B ) )  -> 
( -.  C  =  A  ->  A  <  C ) )
1312adantlr 697 . . . . . . 7  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  A  <_  C  /\  C  <_  B ) )  ->  ( -.  C  =  A  ->  A  < 
C ) )
14 eqcom 2444 . . . . . . . . . . . . . 14  |-  ( C  =  B  <->  B  =  C )
1514necon3bbii 2638 . . . . . . . . . . . . 13  |-  ( -.  C  =  B  <->  B  =/=  C )
16 xrleltne 10769 . . . . . . . . . . . . . 14  |-  ( ( C  e.  RR*  /\  B  e.  RR*  /\  C  <_  B )  ->  ( C  <  B  <->  B  =/=  C ) )
1716biimprd 216 . . . . . . . . . . . . 13  |-  ( ( C  e.  RR*  /\  B  e.  RR*  /\  C  <_  B )  ->  ( B  =/=  C  ->  C  <  B ) )
1815, 17syl5bi 210 . . . . . . . . . . . 12  |-  ( ( C  e.  RR*  /\  B  e.  RR*  /\  C  <_  B )  ->  ( -.  C  =  B  ->  C  <  B ) )
19183exp 1153 . . . . . . . . . . 11  |-  ( C  e.  RR*  ->  ( B  e.  RR*  ->  ( C  <_  B  ->  ( -.  C  =  B  ->  C  <  B ) ) ) )
2019com12 30 . . . . . . . . . 10  |-  ( B  e.  RR*  ->  ( C  e.  RR*  ->  ( C  <_  B  ->  ( -.  C  =  B  ->  C  <  B ) ) ) )
2120imp32 424 . . . . . . . . 9  |-  ( ( B  e.  RR*  /\  ( C  e.  RR*  /\  C  <_  B ) )  -> 
( -.  C  =  B  ->  C  <  B ) )
22213adantr2 1118 . . . . . . . 8  |-  ( ( B  e.  RR*  /\  ( C  e.  RR*  /\  A  <_  C  /\  C  <_  B ) )  -> 
( -.  C  =  B  ->  C  <  B ) )
2322adantll 696 . . . . . . 7  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  A  <_  C  /\  C  <_  B ) )  ->  ( -.  C  =  B  ->  C  < 
B ) )
2413, 23anim12d 548 . . . . . 6  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  A  <_  C  /\  C  <_  B ) )  ->  ( ( -.  C  =  A  /\  -.  C  =  B
)  ->  ( A  <  C  /\  C  < 
B ) ) )
2524ex 425 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( C  e.  RR*  /\  A  <_  C  /\  C  <_  B )  -> 
( ( -.  C  =  A  /\  -.  C  =  B )  ->  ( A  <  C  /\  C  <  B ) ) ) )
26 df-or 361 . . . . . 6  |-  ( ( C  =  A  \/  ( ( A  < 
C  /\  C  <  B )  \/  C  =  B ) )  <->  ( -.  C  =  A  ->  ( ( A  <  C  /\  C  <  B )  \/  C  =  B ) ) )
27 3orass 940 . . . . . 6  |-  ( ( C  =  A  \/  ( A  <  C  /\  C  <  B )  \/  C  =  B )  <-> 
( C  =  A  \/  ( ( A  <  C  /\  C  <  B )  \/  C  =  B ) ) )
28 pm5.6 880 . . . . . . 7  |-  ( ( ( -.  C  =  A  /\  -.  C  =  B )  ->  ( A  <  C  /\  C  <  B ) )  <->  ( -.  C  =  A  ->  ( C  =  B  \/  ( A  <  C  /\  C  <  B ) ) ) )
29 orcom 378 . . . . . . . 8  |-  ( ( C  =  B  \/  ( A  <  C  /\  C  <  B ) )  <-> 
( ( A  < 
C  /\  C  <  B )  \/  C  =  B ) )
3029imbi2i 305 . . . . . . 7  |-  ( ( -.  C  =  A  ->  ( C  =  B  \/  ( A  <  C  /\  C  <  B ) ) )  <-> 
( -.  C  =  A  ->  ( ( A  <  C  /\  C  <  B )  \/  C  =  B ) ) )
3128, 30bitri 242 . . . . . 6  |-  ( ( ( -.  C  =  A  /\  -.  C  =  B )  ->  ( A  <  C  /\  C  <  B ) )  <->  ( -.  C  =  A  ->  ( ( A  <  C  /\  C  <  B )  \/  C  =  B ) ) )
3226, 27, 313bitr4ri 271 . . . . 5  |-  ( ( ( -.  C  =  A  /\  -.  C  =  B )  ->  ( A  <  C  /\  C  <  B ) )  <->  ( C  =  A  \/  ( A  <  C  /\  C  <  B )  \/  C  =  B ) )
3325, 32syl6ib 219 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( C  e.  RR*  /\  A  <_  C  /\  C  <_  B )  -> 
( C  =  A  \/  ( A  < 
C  /\  C  <  B )  \/  C  =  B ) ) )
343, 7, 333jcad 1136 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( C  e.  RR*  /\  A  <_  C  /\  C  <_  B )  -> 
( C  e.  RR*  /\  A  <_  B  /\  ( C  =  A  \/  ( A  <  C  /\  C  <  B )  \/  C  =  B ) ) ) )
35 simp1 958 . . . . 5  |-  ( ( C  e.  RR*  /\  A  <_  B  /\  ( C  =  A  \/  ( A  <  C  /\  C  <  B )  \/  C  =  B ) )  ->  C  e.  RR* )
3635a1i 11 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( C  e.  RR*  /\  A  <_  B  /\  ( C  =  A  \/  ( A  <  C  /\  C  <  B )  \/  C  =  B ) )  ->  C  e.  RR* ) )
37 xrleid 10774 . . . . . . . . 9  |-  ( A  e.  RR*  ->  A  <_  A )
3837ad3antrrr 712 . . . . . . . 8  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  C  e. 
RR* )  /\  A  <_  B )  ->  A  <_  A )
39 breq2 4241 . . . . . . . 8  |-  ( C  =  A  ->  ( A  <_  C  <->  A  <_  A ) )
4038, 39syl5ibrcom 215 . . . . . . 7  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  C  e. 
RR* )  /\  A  <_  B )  ->  ( C  =  A  ->  A  <_  C ) )
41 xrltle 10773 . . . . . . . . . 10  |-  ( ( A  e.  RR*  /\  C  e.  RR* )  ->  ( A  <  C  ->  A  <_  C ) )
4241adantr 453 . . . . . . . . 9  |-  ( ( ( A  e.  RR*  /\  C  e.  RR* )  /\  A  <_  B )  ->  ( A  < 
C  ->  A  <_  C ) )
4342adantllr 701 . . . . . . . 8  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  C  e. 
RR* )  /\  A  <_  B )  ->  ( A  <  C  ->  A  <_  C ) )
4443adantrd 456 . . . . . . 7  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  C  e. 
RR* )  /\  A  <_  B )  ->  (
( A  <  C  /\  C  <  B )  ->  A  <_  C
) )
45 simpr 449 . . . . . . . 8  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  C  e. 
RR* )  /\  A  <_  B )  ->  A  <_  B )
46 breq2 4241 . . . . . . . 8  |-  ( C  =  B  ->  ( A  <_  C  <->  A  <_  B ) )
4745, 46syl5ibrcom 215 . . . . . . 7  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  C  e. 
RR* )  /\  A  <_  B )  ->  ( C  =  B  ->  A  <_  C ) )
4840, 44, 473jaod 1249 . . . . . 6  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  C  e. 
RR* )  /\  A  <_  B )  ->  (
( C  =  A  \/  ( A  < 
C  /\  C  <  B )  \/  C  =  B )  ->  A  <_  C ) )
4948exp31 589 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( C  e.  RR*  ->  ( A  <_  B  ->  (
( C  =  A  \/  ( A  < 
C  /\  C  <  B )  \/  C  =  B )  ->  A  <_  C ) ) ) )
50493impd 1168 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( C  e.  RR*  /\  A  <_  B  /\  ( C  =  A  \/  ( A  <  C  /\  C  <  B )  \/  C  =  B ) )  ->  A  <_  C ) )
51 breq1 4240 . . . . . . . 8  |-  ( C  =  A  ->  ( C  <_  B  <->  A  <_  B ) )
5245, 51syl5ibrcom 215 . . . . . . 7  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  C  e. 
RR* )  /\  A  <_  B )  ->  ( C  =  A  ->  C  <_  B ) )
53 xrltle 10773 . . . . . . . . . . 11  |-  ( ( C  e.  RR*  /\  B  e.  RR* )  ->  ( C  <  B  ->  C  <_  B ) )
5453ancoms 441 . . . . . . . . . 10  |-  ( ( B  e.  RR*  /\  C  e.  RR* )  ->  ( C  <  B  ->  C  <_  B ) )
5554adantld 455 . . . . . . . . 9  |-  ( ( B  e.  RR*  /\  C  e.  RR* )  ->  (
( A  <  C  /\  C  <  B )  ->  C  <_  B
) )
5655adantll 696 . . . . . . . 8  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  C  e.  RR* )  ->  ( ( A  < 
C  /\  C  <  B )  ->  C  <_  B ) )
5756adantr 453 . . . . . . 7  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  C  e. 
RR* )  /\  A  <_  B )  ->  (
( A  <  C  /\  C  <  B )  ->  C  <_  B
) )
58 xrleid 10774 . . . . . . . . 9  |-  ( B  e.  RR*  ->  B  <_  B )
5958ad3antlr 713 . . . . . . . 8  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  C  e. 
RR* )  /\  A  <_  B )  ->  B  <_  B )
60 breq1 4240 . . . . . . . 8  |-  ( C  =  B  ->  ( C  <_  B  <->  B  <_  B ) )
6159, 60syl5ibrcom 215 . . . . . . 7  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  C  e. 
RR* )  /\  A  <_  B )  ->  ( C  =  B  ->  C  <_  B ) )
6252, 57, 613jaod 1249 . . . . . 6  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  C  e. 
RR* )  /\  A  <_  B )  ->  (
( C  =  A  \/  ( A  < 
C  /\  C  <  B )  \/  C  =  B )  ->  C  <_  B ) )
6362exp31 589 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( C  e.  RR*  ->  ( A  <_  B  ->  (
( C  =  A  \/  ( A  < 
C  /\  C  <  B )  \/  C  =  B )  ->  C  <_  B ) ) ) )
64633impd 1168 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( C  e.  RR*  /\  A  <_  B  /\  ( C  =  A  \/  ( A  <  C  /\  C  <  B )  \/  C  =  B ) )  ->  C  <_  B ) )
6536, 50, 643jcad 1136 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( C  e.  RR*  /\  A  <_  B  /\  ( C  =  A  \/  ( A  <  C  /\  C  <  B )  \/  C  =  B ) )  ->  ( C  e.  RR*  /\  A  <_  C  /\  C  <_  B ) ) )
6634, 65impbid 185 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( C  e.  RR*  /\  A  <_  C  /\  C  <_  B )  <->  ( C  e.  RR*  /\  A  <_  B  /\  ( C  =  A  \/  ( A  <  C  /\  C  <  B )  \/  C  =  B ) ) ) )
671, 66bitrd 246 1  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( C  e.  ( A [,] B )  <->  ( C  e.  RR*  /\  A  <_  B  /\  ( C  =  A  \/  ( A  <  C  /\  C  <  B )  \/  C  =  B ) ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 178    \/ wo 359    /\ wa 360    \/ w3o 936    /\ w3a 937    = wceq 1653    e. wcel 1727    =/= wne 2605   class class class wbr 4237  (class class class)co 6110   RR*cxr 9150    < clt 9151    <_ cle 9152   [,]cicc 10950
This theorem is referenced by:  ivthALT  26376
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1668  ax-8 1689  ax-13 1729  ax-14 1731  ax-6 1746  ax-7 1751  ax-11 1763  ax-12 1953  ax-ext 2423  ax-sep 4355  ax-nul 4363  ax-pow 4406  ax-pr 4432  ax-un 4730  ax-cnex 9077  ax-resscn 9078  ax-pre-lttri 9095  ax-pre-lttrn 9096
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 938  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2291  df-mo 2292  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2567  df-ne 2607  df-nel 2608  df-ral 2716  df-rex 2717  df-rab 2720  df-v 2964  df-sbc 3168  df-csb 3268  df-dif 3309  df-un 3311  df-in 3313  df-ss 3320  df-nul 3614  df-if 3764  df-pw 3825  df-sn 3844  df-pr 3845  df-op 3847  df-uni 4040  df-br 4238  df-opab 4292  df-mpt 4293  df-id 4527  df-po 4532  df-so 4533  df-xp 4913  df-rel 4914  df-cnv 4915  df-co 4916  df-dm 4917  df-rn 4918  df-res 4919  df-ima 4920  df-iota 5447  df-fun 5485  df-fn 5486  df-f 5487  df-f1 5488  df-fo 5489  df-f1o 5490  df-fv 5491  df-ov 6113  df-oprab 6114  df-mpt2 6115  df-er 6934  df-en 7139  df-dom 7140  df-sdom 7141  df-pnf 9153  df-mnf 9154  df-xr 9155  df-ltxr 9156  df-le 9157  df-icc 10954
  Copyright terms: Public domain W3C validator