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

Theorem lelttr 8049
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 529 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  A  <_  B )
2 simpl1 1000 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  A  e.  RR )
3 simpl2 1001 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  B  e.  RR )
4 lenlt 8036 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  <_  B  <->  -.  B  <  A ) )
52, 3, 4syl2anc 411 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  ( A  <_  B  <->  -.  B  <  A ) )
61, 5mpbid 147 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  -.  B  <  A )
76pm2.21d 619 . . 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 531 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  B  <  C )
10 simpl3 1002 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  C  e.  RR )
11 axltwlin 8028 . . . . 5  |-  ( ( B  e.  RR  /\  C  e.  RR  /\  A  e.  RR )  ->  ( B  <  C  ->  ( B  <  A  \/  A  <  C ) ) )
123, 10, 2, 11syl3anc 1238 . . . 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 718 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <_  B  /\  B  <  C ) )  ->  A  <  C )
1514ex 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 708    /\ w3a 978    e. wcel 2148   class class class wbr 4005   RRcr 7813    < clt 7995    <_ cle 7996
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7905  ax-resscn 7906  ax-pre-ltwlin 7927
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2741  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-xp 4634  df-cnv 4636  df-pnf 7997  df-mnf 7998  df-xr 7999  df-ltxr 8000  df-le 8001
This theorem is referenced by:  lelttri  8066  lelttrd  8085  letrp1  8808  ltmul12a  8820  bndndx  9178  uzind  9367  fnn0ind  9372  elfzo0z  10187  fzofzim  10191  elfzodifsumelfzo  10204  flqge  10285  modfzo0difsn  10398  expnlbnd2  10649  caubnd2  11129  mulcn2  11323  cn1lem  11325  climsqz  11346  climsqz2  11347  climcvg1nlem  11360  ltoddhalfle  11901  algcvgblem  12052  pclemub  12290  metss2lem  14158  logdivlti  14463
  Copyright terms: Public domain W3C validator