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

Theorem numma 9494
Description: Perform a multiply-add of two decimal integers  M and  N against a fixed multiplicand  P (no carry). (Contributed by Mario Carneiro, 18-Feb-2014.)
Hypotheses
Ref Expression
numma.1  |-  T  e. 
NN0
numma.2  |-  A  e. 
NN0
numma.3  |-  B  e. 
NN0
numma.4  |-  C  e. 
NN0
numma.5  |-  D  e. 
NN0
numma.6  |-  M  =  ( ( T  x.  A )  +  B
)
numma.7  |-  N  =  ( ( T  x.  C )  +  D
)
numma.8  |-  P  e. 
NN0
numma.9  |-  ( ( A  x.  P )  +  C )  =  E
numma.10  |-  ( ( B  x.  P )  +  D )  =  F
Assertion
Ref Expression
numma  |-  ( ( M  x.  P )  +  N )  =  ( ( T  x.  E )  +  F
)

Proof of Theorem numma
StepHypRef Expression
1 numma.6 . . . 4  |-  M  =  ( ( T  x.  A )  +  B
)
21oveq1i 5929 . . 3  |-  ( M  x.  P )  =  ( ( ( T  x.  A )  +  B )  x.  P
)
3 numma.7 . . 3  |-  N  =  ( ( T  x.  C )  +  D
)
42, 3oveq12i 5931 . 2  |-  ( ( M  x.  P )  +  N )  =  ( ( ( ( T  x.  A )  +  B )  x.  P )  +  ( ( T  x.  C
)  +  D ) )
5 numma.1 . . . . . . 7  |-  T  e. 
NN0
65nn0cni 9255 . . . . . 6  |-  T  e.  CC
7 numma.2 . . . . . . . 8  |-  A  e. 
NN0
87nn0cni 9255 . . . . . . 7  |-  A  e.  CC
9 numma.8 . . . . . . . 8  |-  P  e. 
NN0
109nn0cni 9255 . . . . . . 7  |-  P  e.  CC
118, 10mulcli 8026 . . . . . 6  |-  ( A  x.  P )  e.  CC
12 numma.4 . . . . . . 7  |-  C  e. 
NN0
1312nn0cni 9255 . . . . . 6  |-  C  e.  CC
146, 11, 13adddii 8031 . . . . 5  |-  ( T  x.  ( ( A  x.  P )  +  C ) )  =  ( ( T  x.  ( A  x.  P
) )  +  ( T  x.  C ) )
156, 8, 10mulassi 8030 . . . . . 6  |-  ( ( T  x.  A )  x.  P )  =  ( T  x.  ( A  x.  P )
)
1615oveq1i 5929 . . . . 5  |-  ( ( ( T  x.  A
)  x.  P )  +  ( T  x.  C ) )  =  ( ( T  x.  ( A  x.  P
) )  +  ( T  x.  C ) )
1714, 16eqtr4i 2217 . . . 4  |-  ( T  x.  ( ( A  x.  P )  +  C ) )  =  ( ( ( T  x.  A )  x.  P )  +  ( T  x.  C ) )
1817oveq1i 5929 . . 3  |-  ( ( T  x.  ( ( A  x.  P )  +  C ) )  +  ( ( B  x.  P )  +  D ) )  =  ( ( ( ( T  x.  A )  x.  P )  +  ( T  x.  C
) )  +  ( ( B  x.  P
)  +  D ) )
196, 8mulcli 8026 . . . . . 6  |-  ( T  x.  A )  e.  CC
20 numma.3 . . . . . . 7  |-  B  e. 
NN0
2120nn0cni 9255 . . . . . 6  |-  B  e.  CC
2219, 21, 10adddiri 8032 . . . . 5  |-  ( ( ( T  x.  A
)  +  B )  x.  P )  =  ( ( ( T  x.  A )  x.  P )  +  ( B  x.  P ) )
2322oveq1i 5929 . . . 4  |-  ( ( ( ( T  x.  A )  +  B
)  x.  P )  +  ( ( T  x.  C )  +  D ) )  =  ( ( ( ( T  x.  A )  x.  P )  +  ( B  x.  P
) )  +  ( ( T  x.  C
)  +  D ) )
2419, 10mulcli 8026 . . . . 5  |-  ( ( T  x.  A )  x.  P )  e.  CC
256, 13mulcli 8026 . . . . 5  |-  ( T  x.  C )  e.  CC
2621, 10mulcli 8026 . . . . 5  |-  ( B  x.  P )  e.  CC
27 numma.5 . . . . . 6  |-  D  e. 
NN0
2827nn0cni 9255 . . . . 5  |-  D  e.  CC
2924, 25, 26, 28add4i 8186 . . . 4  |-  ( ( ( ( T  x.  A )  x.  P
)  +  ( T  x.  C ) )  +  ( ( B  x.  P )  +  D ) )  =  ( ( ( ( T  x.  A )  x.  P )  +  ( B  x.  P
) )  +  ( ( T  x.  C
)  +  D ) )
3023, 29eqtr4i 2217 . . 3  |-  ( ( ( ( T  x.  A )  +  B
)  x.  P )  +  ( ( T  x.  C )  +  D ) )  =  ( ( ( ( T  x.  A )  x.  P )  +  ( T  x.  C
) )  +  ( ( B  x.  P
)  +  D ) )
3118, 30eqtr4i 2217 . 2  |-  ( ( T  x.  ( ( A  x.  P )  +  C ) )  +  ( ( B  x.  P )  +  D ) )  =  ( ( ( ( T  x.  A )  +  B )  x.  P )  +  ( ( T  x.  C
)  +  D ) )
32 numma.9 . . . 4  |-  ( ( A  x.  P )  +  C )  =  E
3332oveq2i 5930 . . 3  |-  ( T  x.  ( ( A  x.  P )  +  C ) )  =  ( T  x.  E
)
34 numma.10 . . 3  |-  ( ( B  x.  P )  +  D )  =  F
3533, 34oveq12i 5931 . 2  |-  ( ( T  x.  ( ( A  x.  P )  +  C ) )  +  ( ( B  x.  P )  +  D ) )  =  ( ( T  x.  E )  +  F
)
364, 31, 353eqtr2i 2220 1  |-  ( ( M  x.  P )  +  N )  =  ( ( T  x.  E )  +  F
)
Colors of variables: wff set class
Syntax hints:    = wceq 1364    e. wcel 2164  (class class class)co 5919    + caddc 7877    x. cmul 7879   NN0cn0 9243
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-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175  ax-sep 4148  ax-cnex 7965  ax-resscn 7966  ax-1re 7968  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-addcom 7974  ax-mulcom 7975  ax-addass 7976  ax-mulass 7977  ax-distr 7978  ax-rnegex 7983
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-un 3158  df-in 3160  df-ss 3167  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-br 4031  df-iota 5216  df-fv 5263  df-ov 5922  df-inn 8985  df-n0 9244
This theorem is referenced by:  nummac  9495  numadd  9497  decma  9501
  Copyright terms: Public domain W3C validator