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

Theorem xrletr 9900
Description: Transitive law for ordering on extended reals. (Contributed by NM, 9-Feb-2006.)
Assertion
Ref Expression
xrletr  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  (
( A  <_  B  /\  B  <_  C )  ->  A  <_  C
) )

Proof of Theorem xrletr
StepHypRef Expression
1 xrltso 9888 . . . . . 6  |-  <  Or  RR*
2 sowlin 4356 . . . . . 6  |-  ( (  <  Or  RR*  /\  ( C  e.  RR*  /\  A  e.  RR*  /\  B  e. 
RR* ) )  -> 
( C  <  A  ->  ( C  <  B  \/  B  <  A ) ) )
31, 2mpan 424 . . . . 5  |-  ( ( C  e.  RR*  /\  A  e.  RR*  /\  B  e. 
RR* )  ->  ( C  <  A  ->  ( C  <  B  \/  B  <  A ) ) )
433coml 1212 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( C  <  A  ->  ( C  <  B  \/  B  <  A ) ) )
5 orcom 729 . . . 4  |-  ( ( C  <  B  \/  B  <  A )  <->  ( B  <  A  \/  C  < 
B ) )
64, 5imbitrdi 161 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( C  <  A  ->  ( B  <  A  \/  C  <  B ) ) )
76con3d 632 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( -.  ( B  <  A  \/  C  <  B )  ->  -.  C  <  A ) )
8 xrlenlt 8108 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A  <_  B  <->  -.  B  <  A ) )
983adant3 1019 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( A  <_  B  <->  -.  B  <  A ) )
10 xrlenlt 8108 . . . . 5  |-  ( ( B  e.  RR*  /\  C  e.  RR* )  ->  ( B  <_  C  <->  -.  C  <  B ) )
11103adant1 1017 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( B  <_  C  <->  -.  C  <  B ) )
129, 11anbi12d 473 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  (
( A  <_  B  /\  B  <_  C )  <-> 
( -.  B  < 
A  /\  -.  C  <  B ) ) )
13 ioran 753 . . 3  |-  ( -.  ( B  <  A  \/  C  <  B )  <-> 
( -.  B  < 
A  /\  -.  C  <  B ) )
1412, 13bitr4di 198 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  (
( A  <_  B  /\  B  <_  C )  <->  -.  ( B  <  A  \/  C  <  B ) ) )
15 xrlenlt 8108 . . 3  |-  ( ( A  e.  RR*  /\  C  e.  RR* )  ->  ( A  <_  C  <->  -.  C  <  A ) )
16153adant2 1018 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( A  <_  C  <->  -.  C  <  A ) )
177, 14, 163imtr4d 203 1  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  (
( A  <_  B  /\  B  <_  C )  ->  A  <_  C
) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 709    /\ w3a 980    e. wcel 2167   class class class wbr 4034    Or wor 4331   RR*cxr 8077    < clt 8078    <_ cle 8079
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-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010
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-rab 2484  df-v 2765  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-po 4332  df-iso 4333  df-xp 4670  df-cnv 4672  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084
This theorem is referenced by:  xrletrd  9904  xle2add  9971  icc0r  10018  iccss  10033  icossico  10035  iccss2  10036  iccssico  10037  bdxmet  14821
  Copyright terms: Public domain W3C validator