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

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

Proof of Theorem ltletr
StepHypRef Expression
1 simprr 537 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <  B  /\  B  <_  C ) )  ->  B  <_  C )
2 simpl2 1032 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <  B  /\  B  <_  C ) )  ->  B  e.  RR )
3 simpl3 1033 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <  B  /\  B  <_  C ) )  ->  C  e.  RR )
4 lenlt 8407 . . . . 5  |-  ( ( B  e.  RR  /\  C  e.  RR )  ->  ( B  <_  C  <->  -.  C  <  B ) )
52, 3, 4syl2anc 415 . . . 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 535 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <  B  /\  B  <_  C ) )  ->  A  <  B )
8 axltwlin 8399 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( A  <  B  ->  ( A  <  C  \/  C  <  B ) ) )
98adantr 276 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <  B  /\  B  <_  C ) )  ->  ( A  <  B  ->  ( A  <  C  \/  C  < 
B ) ) )
107, 9mpd 13 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <  B  /\  B  <_  C ) )  ->  ( A  <  C  \/  C  < 
B ) )
116, 10ecased 1390 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( A  <  B  /\  B  <_  C ) )  ->  A  <  C )
1211ex 115 1  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( A  <  B  /\  B  <_  C )  ->  A  <  C
) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720    /\ w3a 1009    e. wcel 2209   class class class wbr 4131   RRcr 8184    < clt 8366    <_ cle 8367
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-pre-ltwlin 8298
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-xp 4782  df-cnv 4784  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372
This theorem is used by:  ltletri  8439  ltletrd  8758  ltleadd  8781  nngt0  9338  nnrecgt0  9351  elnnnn0c  9619  elnnz1  9678  zltp1le  9710  uz3m2nn  9989  ledivge1le  10144  addlelt  10186  zltaddlt1le  10427  elfz1b  10514  elfzodifsumelfzo  10636  ssfzo12bi  10660  swrdswrd  11499  swrdccatin1  11519  cos01gt0  12555  oddge22np1  12673  nn0seqcvgd  12844  coprm  12948  prmlem1  13251  prmlem2  13263  logdivlti  16111  gausslemma2dlem1a  16382  lealltlt1  16956
  Copyright terms: Public domain W3C validator