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

Theorem nummac 9568
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
)
nummac.8  |-  P  e. 
NN0
nummac.9  |-  F  e. 
NN0
nummac.10  |-  G  e. 
NN0
nummac.11  |-  ( ( A  x.  P )  +  ( C  +  G ) )  =  E
nummac.12  |-  ( ( B  x.  P )  +  D )  =  ( ( T  x.  G )  +  F
)
Assertion
Ref Expression
nummac  |-  ( ( M  x.  P )  +  N )  =  ( ( T  x.  E )  +  F
)

Proof of Theorem nummac
StepHypRef Expression
1 numma.1 . . . . 5  |-  T  e. 
NN0
21nn0cni 9327 . . . 4  |-  T  e.  CC
3 numma.2 . . . . . . . . 9  |-  A  e. 
NN0
43nn0cni 9327 . . . . . . . 8  |-  A  e.  CC
5 nummac.8 . . . . . . . . 9  |-  P  e. 
NN0
65nn0cni 9327 . . . . . . . 8  |-  P  e.  CC
74, 6mulcli 8097 . . . . . . 7  |-  ( A  x.  P )  e.  CC
8 numma.4 . . . . . . . 8  |-  C  e. 
NN0
98nn0cni 9327 . . . . . . 7  |-  C  e.  CC
10 nummac.10 . . . . . . . 8  |-  G  e. 
NN0
1110nn0cni 9327 . . . . . . 7  |-  G  e.  CC
127, 9, 11addassi 8100 . . . . . 6  |-  ( ( ( A  x.  P
)  +  C )  +  G )  =  ( ( A  x.  P )  +  ( C  +  G ) )
13 nummac.11 . . . . . 6  |-  ( ( A  x.  P )  +  ( C  +  G ) )  =  E
1412, 13eqtri 2227 . . . . 5  |-  ( ( ( A  x.  P
)  +  C )  +  G )  =  E
157, 9addcli 8096 . . . . . 6  |-  ( ( A  x.  P )  +  C )  e.  CC
1615, 11addcli 8096 . . . . 5  |-  ( ( ( A  x.  P
)  +  C )  +  G )  e.  CC
1714, 16eqeltrri 2280 . . . 4  |-  E  e.  CC
182, 17, 11subdii 8499 . . 3  |-  ( T  x.  ( E  -  G ) )  =  ( ( T  x.  E )  -  ( T  x.  G )
)
1918oveq1i 5967 . 2  |-  ( ( T  x.  ( E  -  G ) )  +  ( ( T  x.  G )  +  F ) )  =  ( ( ( T  x.  E )  -  ( T  x.  G
) )  +  ( ( T  x.  G
)  +  F ) )
20 numma.3 . . 3  |-  B  e. 
NN0
21 numma.5 . . 3  |-  D  e. 
NN0
22 numma.6 . . 3  |-  M  =  ( ( T  x.  A )  +  B
)
23 numma.7 . . 3  |-  N  =  ( ( T  x.  C )  +  D
)
2417, 11, 15subadd2i 8380 . . . . 5  |-  ( ( E  -  G )  =  ( ( A  x.  P )  +  C )  <->  ( (
( A  x.  P
)  +  C )  +  G )  =  E )
2514, 24mpbir 146 . . . 4  |-  ( E  -  G )  =  ( ( A  x.  P )  +  C
)
2625eqcomi 2210 . . 3  |-  ( ( A  x.  P )  +  C )  =  ( E  -  G
)
27 nummac.12 . . 3  |-  ( ( B  x.  P )  +  D )  =  ( ( T  x.  G )  +  F
)
281, 3, 20, 8, 21, 22, 23, 5, 26, 27numma 9567 . 2  |-  ( ( M  x.  P )  +  N )  =  ( ( T  x.  ( E  -  G
) )  +  ( ( T  x.  G
)  +  F ) )
292, 17mulcli 8097 . . . . 5  |-  ( T  x.  E )  e.  CC
302, 11mulcli 8097 . . . . 5  |-  ( T  x.  G )  e.  CC
31 npcan 8301 . . . . 5  |-  ( ( ( T  x.  E
)  e.  CC  /\  ( T  x.  G
)  e.  CC )  ->  ( ( ( T  x.  E )  -  ( T  x.  G ) )  +  ( T  x.  G
) )  =  ( T  x.  E ) )
3229, 30, 31mp2an 426 . . . 4  |-  ( ( ( T  x.  E
)  -  ( T  x.  G ) )  +  ( T  x.  G ) )  =  ( T  x.  E
)
3332oveq1i 5967 . . 3  |-  ( ( ( ( T  x.  E )  -  ( T  x.  G )
)  +  ( T  x.  G ) )  +  F )  =  ( ( T  x.  E )  +  F
)
3429, 30subcli 8368 . . . 4  |-  ( ( T  x.  E )  -  ( T  x.  G ) )  e.  CC
35 nummac.9 . . . . 5  |-  F  e. 
NN0
3635nn0cni 9327 . . . 4  |-  F  e.  CC
3734, 30, 36addassi 8100 . . 3  |-  ( ( ( ( T  x.  E )  -  ( T  x.  G )
)  +  ( T  x.  G ) )  +  F )  =  ( ( ( T  x.  E )  -  ( T  x.  G
) )  +  ( ( T  x.  G
)  +  F ) )
3833, 37eqtr3i 2229 . 2  |-  ( ( T  x.  E )  +  F )  =  ( ( ( T  x.  E )  -  ( T  x.  G
) )  +  ( ( T  x.  G
)  +  F ) )
3919, 28, 383eqtr4i 2237 1  |-  ( ( M  x.  P )  +  N )  =  ( ( T  x.  E )  +  F
)
Colors of variables: wff set class
Syntax hints:    = wceq 1373    e. wcel 2177  (class class class)co 5957   CCcc 7943    + caddc 7948    x. cmul 7950    - cmin 8263   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-14 2180  ax-ext 2188  ax-sep 4170  ax-pow 4226  ax-pr 4261  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-addcom 8045  ax-mulcom 8046  ax-addass 8047  ax-mulass 8048  ax-distr 8049  ax-i2m1 8050  ax-0id 8053  ax-rnegex 8054  ax-cnre 8056
This theorem depends on definitions:  df-bi 117  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-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-sub 8265  df-inn 9057  df-n0 9316
This theorem is referenced by:  numma2c  9569  numaddc  9571  nummul1c  9572  decmac  9575
  Copyright terms: Public domain W3C validator