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

Theorem numma2c 9502
Description: Perform a multiply-add of two decimal integers  M and  N against a fixed multiplicand  P (with 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
)
numma2c.8  |-  P  e. 
NN0
numma2c.9  |-  F  e. 
NN0
numma2c.10  |-  G  e. 
NN0
numma2c.11  |-  ( ( P  x.  A )  +  ( C  +  G ) )  =  E
numma2c.12  |-  ( ( P  x.  B )  +  D )  =  ( ( T  x.  G )  +  F
)
Assertion
Ref Expression
numma2c  |-  ( ( P  x.  M )  +  N )  =  ( ( T  x.  E )  +  F
)

Proof of Theorem numma2c
StepHypRef Expression
1 numma2c.8 . . . . 5  |-  P  e. 
NN0
21nn0cni 9261 . . . 4  |-  P  e.  CC
3 numma.6 . . . . . 6  |-  M  =  ( ( T  x.  A )  +  B
)
4 numma.1 . . . . . . 7  |-  T  e. 
NN0
5 numma.2 . . . . . . 7  |-  A  e. 
NN0
6 numma.3 . . . . . . 7  |-  B  e. 
NN0
74, 5, 6numcl 9469 . . . . . 6  |-  ( ( T  x.  A )  +  B )  e. 
NN0
83, 7eqeltri 2269 . . . . 5  |-  M  e. 
NN0
98nn0cni 9261 . . . 4  |-  M  e.  CC
102, 9mulcomi 8032 . . 3  |-  ( P  x.  M )  =  ( M  x.  P
)
1110oveq1i 5932 . 2  |-  ( ( P  x.  M )  +  N )  =  ( ( M  x.  P )  +  N
)
12 numma.4 . . 3  |-  C  e. 
NN0
13 numma.5 . . 3  |-  D  e. 
NN0
14 numma.7 . . 3  |-  N  =  ( ( T  x.  C )  +  D
)
15 numma2c.9 . . 3  |-  F  e. 
NN0
16 numma2c.10 . . 3  |-  G  e. 
NN0
175nn0cni 9261 . . . . . 6  |-  A  e.  CC
1817, 2mulcomi 8032 . . . . 5  |-  ( A  x.  P )  =  ( P  x.  A
)
1918oveq1i 5932 . . . 4  |-  ( ( A  x.  P )  +  ( C  +  G ) )  =  ( ( P  x.  A )  +  ( C  +  G ) )
20 numma2c.11 . . . 4  |-  ( ( P  x.  A )  +  ( C  +  G ) )  =  E
2119, 20eqtri 2217 . . 3  |-  ( ( A  x.  P )  +  ( C  +  G ) )  =  E
226nn0cni 9261 . . . . . 6  |-  B  e.  CC
2322, 2mulcomi 8032 . . . . 5  |-  ( B  x.  P )  =  ( P  x.  B
)
2423oveq1i 5932 . . . 4  |-  ( ( B  x.  P )  +  D )  =  ( ( P  x.  B )  +  D
)
25 numma2c.12 . . . 4  |-  ( ( P  x.  B )  +  D )  =  ( ( T  x.  G )  +  F
)
2624, 25eqtri 2217 . . 3  |-  ( ( B  x.  P )  +  D )  =  ( ( T  x.  G )  +  F
)
274, 5, 6, 12, 13, 3, 14, 1, 15, 16, 21, 26nummac 9501 . 2  |-  ( ( M  x.  P )  +  N )  =  ( ( T  x.  E )  +  F
)
2811, 27eqtri 2217 1  |-  ( ( P  x.  M )  +  N )  =  ( ( T  x.  E )  +  F
)
Colors of variables: wff set class
Syntax hints:    = wceq 1364    e. wcel 2167  (class class class)co 5922    + caddc 7882    x. cmul 7884   NN0cn0 9249
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-addcom 7979  ax-mulcom 7980  ax-addass 7981  ax-mulass 7982  ax-distr 7983  ax-i2m1 7984  ax-1rid 7986  ax-0id 7987  ax-rnegex 7988  ax-cnre 7990
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-br 4034  df-opab 4095  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-iota 5219  df-fun 5260  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-sub 8199  df-inn 8991  df-n0 9250
This theorem is referenced by:  decma2c  9509
  Copyright terms: Public domain W3C validator