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

Theorem ltleletr 7839
Description: Transitive law, weaker form of  ( A  < 
B  /\  B  <_  C )  ->  A  <  C. (Contributed by AV, 14-Oct-2018.)
Assertion
Ref Expression
ltleletr  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( A  <  B  /\  B  <_  C )  ->  A  <_  C
) )

Proof of Theorem ltleletr
StepHypRef Expression
1 lttr 7831 . . . . . 6  |-  ( ( C  e.  RR  /\  A  e.  RR  /\  B  e.  RR )  ->  (
( C  <  A  /\  A  <  B )  ->  C  <  B
) )
213coml 1188 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( C  <  A  /\  A  <  B )  ->  C  <  B
) )
32expcomd 1417 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( A  <  B  ->  ( C  <  A  ->  C  <  B ) ) )
4 con3 631 . . . 4  |-  ( ( C  <  A  ->  C  <  B )  -> 
( -.  C  < 
B  ->  -.  C  <  A ) )
53, 4syl6 33 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( A  <  B  ->  ( -.  C  <  B  ->  -.  C  <  A ) ) )
6 lenlt 7833 . . . . 5  |-  ( ( B  e.  RR  /\  C  e.  RR )  ->  ( B  <_  C  <->  -.  C  <  B ) )
763adant1 999 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( B  <_  C  <->  -.  C  <  B ) )
8 lenlt 7833 . . . . 5  |-  ( ( A  e.  RR  /\  C  e.  RR )  ->  ( A  <_  C  <->  -.  C  <  A ) )
983adant2 1000 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( A  <_  C  <->  -.  C  <  A ) )
107, 9imbi12d 233 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( B  <_  C  ->  A  <_  C )  <->  ( -.  C  <  B  ->  -.  C  <  A
) ) )
115, 10sylibrd 168 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( A  <  B  ->  ( B  <_  C  ->  A  <_  C ) ) )
1211impd 252 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    /\ w3a 962    e. wcel 1480   class class class wbr 3924   RRcr 7612    < clt 7793    <_ cle 7794
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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-cnex 7704  ax-resscn 7705  ax-pre-lttrn 7727
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-nel 2402  df-ral 2419  df-rex 2420  df-rab 2423  df-v 2683  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-xp 4540  df-cnv 4542  df-pnf 7795  df-mnf 7796  df-xr 7797  df-ltxr 7798  df-le 7799
This theorem is referenced by:  nn0ge2m1nn  9030  lbzbi  9401  iseqf1olemqk  10260
  Copyright terms: Public domain W3C validator