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

Theorem numltc 9635
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 9634 . . . 4  |-  ( ( T  x.  A )  +  C )  < 
( ( T  x.  A )  +  T
)
61nnrei 9151 . . . . . . 7  |-  T  e.  RR
76recni 8190 . . . . . 6  |-  T  e.  CC
82nn0rei 9412 . . . . . . 7  |-  A  e.  RR
98recni 8190 . . . . . 6  |-  A  e.  CC
10 ax-1cn 8124 . . . . . 6  |-  1  e.  CC
117, 9, 10adddii 8188 . . . . 5  |-  ( T  x.  ( A  + 
1 ) )  =  ( ( T  x.  A )  +  ( T  x.  1 ) )
127mulridi 8180 . . . . . 6  |-  ( T  x.  1 )  =  T
1312oveq2i 6028 . . . . 5  |-  ( ( T  x.  A )  +  ( T  x.  1 ) )  =  ( ( T  x.  A )  +  T
)
1411, 13eqtri 2252 . . . 4  |-  ( T  x.  ( A  + 
1 ) )  =  ( ( T  x.  A )  +  T
)
155, 14breqtrri 4115 . . 3  |-  ( ( T  x.  A )  +  C )  < 
( T  x.  ( A  +  1 ) )
16 numltc.6 . . . . 5  |-  A  < 
B
17 numlt.3 . . . . . 6  |-  B  e. 
NN0
18 nn0ltp1le 9541 . . . . . 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 9172 . . . . 5  |-  0  <  T
22 peano2re 8314 . . . . . . 7  |-  ( A  e.  RR  ->  ( A  +  1 )  e.  RR )
238, 22ax-mp 5 . . . . . 6  |-  ( A  +  1 )  e.  RR
2417nn0rei 9412 . . . . . 6  |-  B  e.  RR
2523, 24, 6lemul2i 9104 . . . . 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 8192 . . . . 5  |-  ( T  x.  A )  e.  RR
293nn0rei 9412 . . . . 5  |-  C  e.  RR
3028, 29readdcli 8191 . . . 4  |-  ( ( T  x.  A )  +  C )  e.  RR
316, 23remulcli 8192 . . . 4  |-  ( T  x.  ( A  + 
1 ) )  e.  RR
326, 24remulcli 8192 . . . 4  |-  ( T  x.  B )  e.  RR
3330, 31, 32ltletri 8285 . . 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 9449 . 2  |-  ( T  x.  B )  <_ 
( ( T  x.  B )  +  D
)
3735nn0rei 9412 . . . 4  |-  D  e.  RR
3832, 37readdcli 8191 . . 3  |-  ( ( T  x.  B )  +  D )  e.  RR
3930, 32, 38ltletri 8285 . 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 2202   class class class wbr 4088  (class class class)co 6017   RRcr 8030   0cc0 8031   1c1 8032    + caddc 8034    x. cmul 8036    < clt 8213    <_ cle 8214   NNcn 9142   NN0cn0 9401
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-ltadd 8147  ax-pre-mulgt0 8148
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-inn 9143  df-n0 9402  df-z 9479
This theorem is referenced by:  decltc  9638  numlti  9646
  Copyright terms: Public domain W3C validator