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

Theorem numma 9698
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 6038 . . 3  |-  ( M  x.  P )  =  ( ( ( T  x.  A )  +  B )  x.  P
)
3 numma.7 . . 3  |-  N  =  ( ( T  x.  C )  +  D
)
42, 3oveq12i 6040 . 2  |-  ( ( M  x.  P )  +  N )  =  ( ( ( ( T  x.  A )  +  B )  x.  P )  +  ( ( T  x.  C
)  +  D ) )
5 numma.1 . . . . . . 7  |-  T  e. 
NN0
65nn0cni 9456 . . . . . 6  |-  T  e.  CC
7 numma.2 . . . . . . . 8  |-  A  e. 
NN0
87nn0cni 9456 . . . . . . 7  |-  A  e.  CC
9 numma.8 . . . . . . . 8  |-  P  e. 
NN0
109nn0cni 9456 . . . . . . 7  |-  P  e.  CC
118, 10mulcli 8227 . . . . . 6  |-  ( A  x.  P )  e.  CC
12 numma.4 . . . . . . 7  |-  C  e. 
NN0
1312nn0cni 9456 . . . . . 6  |-  C  e.  CC
146, 11, 13adddii 8232 . . . . 5  |-  ( T  x.  ( ( A  x.  P )  +  C ) )  =  ( ( T  x.  ( A  x.  P
) )  +  ( T  x.  C ) )
156, 8, 10mulassi 8231 . . . . . 6  |-  ( ( T  x.  A )  x.  P )  =  ( T  x.  ( A  x.  P )
)
1615oveq1i 6038 . . . . 5  |-  ( ( ( T  x.  A
)  x.  P )  +  ( T  x.  C ) )  =  ( ( T  x.  ( A  x.  P
) )  +  ( T  x.  C ) )
1714, 16eqtr4i 2255 . . . 4  |-  ( T  x.  ( ( A  x.  P )  +  C ) )  =  ( ( ( T  x.  A )  x.  P )  +  ( T  x.  C ) )
1817oveq1i 6038 . . 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 8227 . . . . . 6  |-  ( T  x.  A )  e.  CC
20 numma.3 . . . . . . 7  |-  B  e. 
NN0
2120nn0cni 9456 . . . . . 6  |-  B  e.  CC
2219, 21, 10adddiri 8233 . . . . 5  |-  ( ( ( T  x.  A
)  +  B )  x.  P )  =  ( ( ( T  x.  A )  x.  P )  +  ( B  x.  P ) )
2322oveq1i 6038 . . . 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 8227 . . . . 5  |-  ( ( T  x.  A )  x.  P )  e.  CC
256, 13mulcli 8227 . . . . 5  |-  ( T  x.  C )  e.  CC
2621, 10mulcli 8227 . . . . 5  |-  ( B  x.  P )  e.  CC
27 numma.5 . . . . . 6  |-  D  e. 
NN0
2827nn0cni 9456 . . . . 5  |-  D  e.  CC
2924, 25, 26, 28add4i 8386 . . . 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 2255 . . 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 2255 . 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 6039 . . 3  |-  ( T  x.  ( ( A  x.  P )  +  C ) )  =  ( T  x.  E
)
34 numma.10 . . 3  |-  ( ( B  x.  P )  +  D )  =  F
3533, 34oveq12i 6040 . 2  |-  ( ( T  x.  ( ( A  x.  P )  +  C ) )  +  ( ( B  x.  P )  +  D ) )  =  ( ( T  x.  E )  +  F
)
364, 31, 353eqtr2i 2258 1  |-  ( ( M  x.  P )  +  N )  =  ( ( T  x.  E )  +  F
)
Colors of variables: wff set class
Syntax hints:    = wceq 1398    e. wcel 2202  (class class class)co 6028    + caddc 8078    x. cmul 8080   NN0cn0 9444
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213  ax-sep 4212  ax-cnex 8166  ax-resscn 8167  ax-1re 8169  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-rnegex 8184
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-iota 5293  df-fv 5341  df-ov 6031  df-inn 9186  df-n0 9445
This theorem is referenced by:  nummac  9699  numadd  9701  decma  9705
  Copyright terms: Public domain W3C validator