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

Theorem iccneg 10223
Description: Membership in a negated closed real interval. (Contributed by Paul Chapman, 26-Nov-2007.)
Assertion
Ref Expression
iccneg  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( C  e.  ( A [,] B )  <->  -u C  e.  ( -u B [,] -u A ) ) )

Proof of Theorem iccneg
StepHypRef Expression
1 renegcl 8439 . . . . 5  |-  ( C  e.  RR  ->  -u C  e.  RR )
2 ax-1 6 . . . . 5  |-  ( C  e.  RR  ->  ( -u C  e.  RR  ->  C  e.  RR ) )
31, 2impbid2 143 . . . 4  |-  ( C  e.  RR  ->  ( C  e.  RR  <->  -u C  e.  RR ) )
433ad2ant3 1046 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( C  e.  RR  <->  -u C  e.  RR ) )
5 ancom 266 . . . 4  |-  ( ( C  <_  B  /\  A  <_  C )  <->  ( A  <_  C  /\  C  <_  B ) )
6 leneg 8644 . . . . . . 7  |-  ( ( C  e.  RR  /\  B  e.  RR )  ->  ( C  <_  B  <->  -u B  <_  -u C ) )
76ancoms 268 . . . . . 6  |-  ( ( B  e.  RR  /\  C  e.  RR )  ->  ( C  <_  B  <->  -u B  <_  -u C ) )
873adant1 1041 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( C  <_  B  <->  -u B  <_  -u C ) )
9 leneg 8644 . . . . . 6  |-  ( ( A  e.  RR  /\  C  e.  RR )  ->  ( A  <_  C  <->  -u C  <_  -u A ) )
1093adant2 1042 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( A  <_  C  <->  -u C  <_  -u A ) )
118, 10anbi12d 473 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( C  <_  B  /\  A  <_  C )  <-> 
( -u B  <_  -u C  /\  -u C  <_  -u A
) ) )
125, 11bitr3id 194 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( A  <_  C  /\  C  <_  B )  <-> 
( -u B  <_  -u C  /\  -u C  <_  -u A
) ) )
134, 12anbi12d 473 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( C  e.  RR  /\  ( A  <_  C  /\  C  <_  B ) )  <->  ( -u C  e.  RR  /\  ( -u B  <_  -u C  /\  -u C  <_ 
-u A ) ) ) )
14 elicc2 10172 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( C  e.  ( A [,] B )  <-> 
( C  e.  RR  /\  A  <_  C  /\  C  <_  B ) ) )
15143adant3 1043 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( C  e.  ( A [,] B )  <->  ( C  e.  RR  /\  A  <_  C  /\  C  <_  B
) ) )
16 3anass 1008 . . 3  |-  ( ( C  e.  RR  /\  A  <_  C  /\  C  <_  B )  <->  ( C  e.  RR  /\  ( A  <_  C  /\  C  <_  B ) ) )
1715, 16bitrdi 196 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( C  e.  ( A [,] B )  <->  ( C  e.  RR  /\  ( A  <_  C  /\  C  <_  B ) ) ) )
18 renegcl 8439 . . . . 5  |-  ( B  e.  RR  ->  -u B  e.  RR )
19 renegcl 8439 . . . . 5  |-  ( A  e.  RR  ->  -u A  e.  RR )
20 elicc2 10172 . . . . 5  |-  ( (
-u B  e.  RR  /\  -u A  e.  RR )  ->  ( -u C  e.  ( -u B [,] -u A )  <->  ( -u C  e.  RR  /\  -u B  <_ 
-u C  /\  -u C  <_ 
-u A ) ) )
2118, 19, 20syl2anr 290 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( -u C  e.  ( -u B [,] -u A )  <->  ( -u C  e.  RR  /\  -u B  <_ 
-u C  /\  -u C  <_ 
-u A ) ) )
22213adant3 1043 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( -u C  e.  ( -u B [,] -u A )  <->  ( -u C  e.  RR  /\  -u B  <_ 
-u C  /\  -u C  <_ 
-u A ) ) )
23 3anass 1008 . . 3  |-  ( (
-u C  e.  RR  /\  -u B  <_  -u C  /\  -u C  <_  -u A
)  <->  ( -u C  e.  RR  /\  ( -u B  <_  -u C  /\  -u C  <_ 
-u A ) ) )
2422, 23bitrdi 196 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( -u C  e.  ( -u B [,] -u A )  <->  ( -u C  e.  RR  /\  ( -u B  <_  -u C  /\  -u C  <_ 
-u A ) ) ) )
2513, 17, 243bitr4d 220 1  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( C  e.  ( A [,] B )  <->  -u C  e.  ( -u B [,] -u A ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1004    e. wcel 2202   class class class wbr 4088  (class class class)co 6017   RRcr 8030    <_ cle 8214   -ucneg 8350   [,]cicc 10125
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-ltadd 8147
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-po 4393  df-iso 4394  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-icc 10129
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator