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

Theorem numltc 9549
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 9548 . . . 4  |-  ( ( T  x.  A )  +  C )  < 
( ( T  x.  A )  +  T
)
61nnrei 9065 . . . . . . 7  |-  T  e.  RR
76recni 8104 . . . . . 6  |-  T  e.  CC
82nn0rei 9326 . . . . . . 7  |-  A  e.  RR
98recni 8104 . . . . . 6  |-  A  e.  CC
10 ax-1cn 8038 . . . . . 6  |-  1  e.  CC
117, 9, 10adddii 8102 . . . . 5  |-  ( T  x.  ( A  + 
1 ) )  =  ( ( T  x.  A )  +  ( T  x.  1 ) )
127mulridi 8094 . . . . . 6  |-  ( T  x.  1 )  =  T
1312oveq2i 5968 . . . . 5  |-  ( ( T  x.  A )  +  ( T  x.  1 ) )  =  ( ( T  x.  A )  +  T
)
1411, 13eqtri 2227 . . . 4  |-  ( T  x.  ( A  + 
1 ) )  =  ( ( T  x.  A )  +  T
)
155, 14breqtrri 4078 . . 3  |-  ( ( T  x.  A )  +  C )  < 
( T  x.  ( A  +  1 ) )
16 numltc.6 . . . . 5  |-  A  < 
B
17 numlt.3 . . . . . 6  |-  B  e. 
NN0
18 nn0ltp1le 9455 . . . . . 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 9086 . . . . 5  |-  0  <  T
22 peano2re 8228 . . . . . . 7  |-  ( A  e.  RR  ->  ( A  +  1 )  e.  RR )
238, 22ax-mp 5 . . . . . 6  |-  ( A  +  1 )  e.  RR
2417nn0rei 9326 . . . . . 6  |-  B  e.  RR
2523, 24, 6lemul2i 9018 . . . . 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 8106 . . . . 5  |-  ( T  x.  A )  e.  RR
293nn0rei 9326 . . . . 5  |-  C  e.  RR
3028, 29readdcli 8105 . . . 4  |-  ( ( T  x.  A )  +  C )  e.  RR
316, 23remulcli 8106 . . . 4  |-  ( T  x.  ( A  + 
1 ) )  e.  RR
326, 24remulcli 8106 . . . 4  |-  ( T  x.  B )  e.  RR
3330, 31, 32ltletri 8199 . . 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 9363 . 2  |-  ( T  x.  B )  <_ 
( ( T  x.  B )  +  D
)
3735nn0rei 9326 . . . 4  |-  D  e.  RR
3832, 37readdcli 8105 . . 3  |-  ( ( T  x.  B )  +  D )  e.  RR
3930, 32, 38ltletri 8199 . 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 2177   class class class wbr 4051  (class class class)co 5957   RRcr 7944   0cc0 7945   1c1 7946    + caddc 7948    x. cmul 7950    < clt 8127    <_ cle 8128   NNcn 9056   NN0cn0 9315
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-sep 4170  ax-pow 4226  ax-pr 4261  ax-un 4488  ax-setind 4593  ax-cnex 8036  ax-resscn 8037  ax-1cn 8038  ax-1re 8039  ax-icn 8040  ax-addcl 8041  ax-addrcl 8042  ax-mulcl 8043  ax-mulrcl 8044  ax-addcom 8045  ax-mulcom 8046  ax-addass 8047  ax-mulass 8048  ax-distr 8049  ax-i2m1 8050  ax-0lt1 8051  ax-1rid 8052  ax-0id 8053  ax-rnegex 8054  ax-precex 8055  ax-cnre 8056  ax-pre-ltirr 8057  ax-pre-ltwlin 8058  ax-pre-lttrn 8059  ax-pre-ltadd 8061  ax-pre-mulgt0 8062
This theorem depends on definitions:  df-bi 117  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rab 2494  df-v 2775  df-sbc 3003  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3857  df-int 3892  df-br 4052  df-opab 4114  df-id 4348  df-xp 4689  df-rel 4690  df-cnv 4691  df-co 4692  df-dm 4693  df-iota 5241  df-fun 5282  df-fv 5288  df-riota 5912  df-ov 5960  df-oprab 5961  df-mpo 5962  df-pnf 8129  df-mnf 8130  df-xr 8131  df-ltxr 8132  df-le 8133  df-sub 8265  df-neg 8266  df-inn 9057  df-n0 9316  df-z 9393
This theorem is referenced by:  decltc  9552  numlti  9560
  Copyright terms: Public domain W3C validator