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

Theorem lelttr 7876
Description: Transitive law. Part of Definition 11.2.7(vi) of [HoTT], p. (varies). (Contributed by NM, 23-May-1999.)
Assertion
Ref Expression
lelttr  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( A  <_  B  /\  B  <  C )  ->  A  <  C
) )

Proof of Theorem lelttr
StepHypRef Expression
1 simprl 521 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  A  <_  B )
2 simpl1 985 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  A  e.  RR )
3 simpl2 986 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  B  e.  RR )
4 lenlt 7864 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  <_  B  <->  -.  B  <  A ) )
52, 3, 4syl2anc 409 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  ( A  <_  B  <->  -.  B  <  A ) )
61, 5mpbid 146 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  -.  B  <  A )
76pm2.21d 609 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  ( B  <  A  ->  A  <  C ) )
8 idd 21 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  ( A  <  C  ->  A  <  C ) )
9 simprr 522 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  B  <  C )
10 simpl3 987 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  C  e.  RR )
11 axltwlin 7856 . . . . 5  |-  ( ( B  e.  RR  /\  C  e.  RR  /\  A  e.  RR )  ->  ( B  <  C  ->  ( B  <  A  \/  A  <  C ) ) )
123, 10, 2, 11syl3anc 1217 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  ( B  <  C  ->  ( B  <  A  \/  A  < 
C ) ) )
139, 12mpd 13 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  ( B  <  A  \/  A  < 
C ) )
147, 8, 13mpjaod 708 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  A  <  C )
1514ex 114 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 103    <-> wb 104    \/ wo 698    /\ w3a 963    e. wcel 1481   class class class wbr 3937   RRcr 7643    < clt 7824    <_ cle 7825
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-cnex 7735  ax-resscn 7736  ax-pre-ltwlin 7757
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-nel 2405  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-xp 4553  df-cnv 4555  df-pnf 7826  df-mnf 7827  df-xr 7828  df-ltxr 7829  df-le 7830
This theorem is referenced by:  lelttri  7893  lelttrd  7911  letrp1  8630  ltmul12a  8642  bndndx  9000  uzind  9186  fnn0ind  9191  elfzo0z  9992  fzofzim  9996  elfzodifsumelfzo  10009  flqge  10086  modfzo0difsn  10199  expnlbnd2  10448  caubnd2  10921  mulcn2  11113  cn1lem  11115  climsqz  11136  climsqz2  11137  climcvg1nlem  11150  ltoddhalfle  11626  algcvgblem  11766  metss2lem  12705  logdivlti  13010
  Copyright terms: Public domain W3C validator