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

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

Proof of Theorem xrltletr
StepHypRef Expression
1 simprr 531 . . . 4  |-  ( ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e.  RR* )  /\  ( A  <  B  /\  B  <_  C ) )  ->  B  <_  C )
2 simpl2 1003 . . . . 5  |-  ( ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e.  RR* )  /\  ( A  <  B  /\  B  <_  C ) )  ->  B  e.  RR* )
3 simpl3 1004 . . . . 5  |-  ( ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e.  RR* )  /\  ( A  <  B  /\  B  <_  C ) )  ->  C  e.  RR* )
4 xrlenlt 8086 . . . . 5  |-  ( ( B  e.  RR*  /\  C  e.  RR* )  ->  ( B  <_  C  <->  -.  C  <  B ) )
52, 3, 4syl2anc 411 . . . 4  |-  ( ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e.  RR* )  /\  ( A  <  B  /\  B  <_  C ) )  -> 
( B  <_  C  <->  -.  C  <  B ) )
61, 5mpbid 147 . . 3  |-  ( ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e.  RR* )  /\  ( A  <  B  /\  B  <_  C ) )  ->  -.  C  <  B )
7 simprl 529 . . . 4  |-  ( ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e.  RR* )  /\  ( A  <  B  /\  B  <_  C ) )  ->  A  <  B )
8 xrltso 9865 . . . . . 6  |-  <  Or  RR*
9 sowlin 4352 . . . . . 6  |-  ( (  <  Or  RR*  /\  ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* ) )  -> 
( A  <  B  ->  ( A  <  C  \/  C  <  B ) ) )
108, 9mpan 424 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e. 
RR* )  ->  ( A  <  B  ->  ( A  <  C  \/  C  <  B ) ) )
1110adantr 276 . . . 4  |-  ( ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e.  RR* )  /\  ( A  <  B  /\  B  <_  C ) )  -> 
( A  <  B  ->  ( A  <  C  \/  C  <  B ) ) )
127, 11mpd 13 . . 3  |-  ( ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e.  RR* )  /\  ( A  <  B  /\  B  <_  C ) )  -> 
( A  <  C  \/  C  <  B ) )
136, 12ecased 1360 . 2  |-  ( ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e.  RR* )  /\  ( A  <  B  /\  B  <_  C ) )  ->  A  <  C )
1413ex 115 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 2164   class class class wbr 4030    Or wor 4327   RR*cxr 8055    < clt 8056    <_ cle 8057
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-pre-ltirr 7986  ax-pre-ltwlin 7987  ax-pre-lttrn 7988
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-po 4328  df-iso 4329  df-xp 4666  df-cnv 4668  df-pnf 8058  df-mnf 8059  df-xr 8060  df-ltxr 8061  df-le 8062
This theorem is referenced by:  xrltletrd  9880  xrre2  9890  xrre3  9891  ge0gtmnf  9892  iooss2  9986  iccssioo  10011  icossico  10012  icossioo  10033  ioossioo  10034  ioc0  10334
  Copyright terms: Public domain W3C validator