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

Theorem numltc 9626
Description: Comparing two decimal integers (unequal higher places). (Contributed by Mario Carneiro, 18-Feb-2014.)
Hypotheses
Ref Expression
numlt.1  |-  T  e.  NN
numlt.2  |-  A  e. 
NN0
numlt.3  |-  B  e. 
NN0
numltc.3  |-  C  e. 
NN0
numltc.4  |-  D  e. 
NN0
numltc.5  |-  C  < 
T
numltc.6  |-  A  < 
B
Assertion
Ref Expression
numltc  |-  ( ( T  x.  A )  +  C )  < 
( ( T  x.  B )  +  D
)

Proof of Theorem numltc
StepHypRef Expression
1 numlt.1 . . . . 5  |-  T  e.  NN
2 numlt.2 . . . . 5  |-  A  e. 
NN0
3 numltc.3 . . . . 5  |-  C  e. 
NN0
4 numltc.5 . . . . 5  |-  C  < 
T
51, 2, 3, 1, 4numlt 9625 . . . 4  |-  ( ( T  x.  A )  +  C )  < 
( ( T  x.  A )  +  T
)
61nnrei 9142 . . . . . . 7  |-  T  e.  RR
76recni 8181 . . . . . 6  |-  T  e.  CC
82nn0rei 9403 . . . . . . 7  |-  A  e.  RR
98recni 8181 . . . . . 6  |-  A  e.  CC
10 ax-1cn 8115 . . . . . 6  |-  1  e.  CC
117, 9, 10adddii 8179 . . . . 5  |-  ( T  x.  ( A  + 
1 ) )  =  ( ( T  x.  A )  +  ( T  x.  1 ) )
127mulridi 8171 . . . . . 6  |-  ( T  x.  1 )  =  T
1312oveq2i 6024 . . . . 5  |-  ( ( T  x.  A )  +  ( T  x.  1 ) )  =  ( ( T  x.  A )  +  T
)
1411, 13eqtri 2250 . . . 4  |-  ( T  x.  ( A  + 
1 ) )  =  ( ( T  x.  A )  +  T
)
155, 14breqtrri 4113 . . 3  |-  ( ( T  x.  A )  +  C )  < 
( T  x.  ( A  +  1 ) )
16 numltc.6 . . . . 5  |-  A  < 
B
17 numlt.3 . . . . . 6  |-  B  e. 
NN0
18 nn0ltp1le 9532 . . . . . 6  |-  ( ( A  e.  NN0  /\  B  e.  NN0 )  -> 
( A  <  B  <->  ( A  +  1 )  <_  B ) )
192, 17, 18mp2an 426 . . . . 5  |-  ( A  <  B  <->  ( A  +  1 )  <_  B )
2016, 19mpbi 145 . . . 4  |-  ( A  +  1 )  <_  B
211nngt0i 9163 . . . . 5  |-  0  <  T
22 peano2re 8305 . . . . . . 7  |-  ( A  e.  RR  ->  ( A  +  1 )  e.  RR )
238, 22ax-mp 5 . . . . . 6  |-  ( A  +  1 )  e.  RR
2417nn0rei 9403 . . . . . 6  |-  B  e.  RR
2523, 24, 6lemul2i 9095 . . . . 5  |-  ( 0  <  T  ->  (
( A  +  1 )  <_  B  <->  ( T  x.  ( A  +  1 ) )  <_  ( T  x.  B )
) )
2621, 25ax-mp 5 . . . 4  |-  ( ( A  +  1 )  <_  B  <->  ( T  x.  ( A  +  1 ) )  <_  ( T  x.  B )
)
2720, 26mpbi 145 . . 3  |-  ( T  x.  ( A  + 
1 ) )  <_ 
( T  x.  B
)
286, 8remulcli 8183 . . . . 5  |-  ( T  x.  A )  e.  RR
293nn0rei 9403 . . . . 5  |-  C  e.  RR
3028, 29readdcli 8182 . . . 4  |-  ( ( T  x.  A )  +  C )  e.  RR
316, 23remulcli 8183 . . . 4  |-  ( T  x.  ( A  + 
1 ) )  e.  RR
326, 24remulcli 8183 . . . 4  |-  ( T  x.  B )  e.  RR
3330, 31, 32ltletri 8276 . . 3  |-  ( ( ( ( T  x.  A )  +  C
)  <  ( T  x.  ( A  +  1 ) )  /\  ( T  x.  ( A  +  1 ) )  <_  ( T  x.  B ) )  -> 
( ( T  x.  A )  +  C
)  <  ( T  x.  B ) )
3415, 27, 33mp2an 426 . 2  |-  ( ( T  x.  A )  +  C )  < 
( T  x.  B
)
35 numltc.4 . . 3  |-  D  e. 
NN0
3632, 35nn0addge1i 9440 . 2  |-  ( T  x.  B )  <_ 
( ( T  x.  B )  +  D
)
3735nn0rei 9403 . . . 4  |-  D  e.  RR
3832, 37readdcli 8182 . . 3  |-  ( ( T  x.  B )  +  D )  e.  RR
3930, 32, 38ltletri 8276 . 2  |-  ( ( ( ( T  x.  A )  +  C
)  <  ( T  x.  B )  /\  ( T  x.  B )  <_  ( ( T  x.  B )  +  D
) )  ->  (
( T  x.  A
)  +  C )  <  ( ( T  x.  B )  +  D ) )
4034, 36, 39mp2an 426 1  |-  ( ( T  x.  A )  +  C )  < 
( ( T  x.  B )  +  D
)
Colors of variables: wff set class
Syntax hints:    <-> wb 105    e. wcel 2200   class class class wbr 4086  (class class class)co 6013   RRcr 8021   0cc0 8022   1c1 8023    + caddc 8025    x. cmul 8027    < clt 8204    <_ cle 8205   NNcn 9133   NN0cn0 9392
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-mulrcl 8121  ax-addcom 8122  ax-mulcom 8123  ax-addass 8124  ax-mulass 8125  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-1rid 8129  ax-0id 8130  ax-rnegex 8131  ax-precex 8132  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-ltadd 8138  ax-pre-mulgt0 8139
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-inn 9134  df-n0 9393  df-z 9470
This theorem is referenced by:  decltc  9629  numlti  9637
  Copyright terms: Public domain W3C validator