Theorem numma2c 9822

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

Step	Hyp	Ref	Expression
1		numma2c.8	. . . . 5 |- P e. NN0
2	1	nn0cni 9575	. . . 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
7	4, 5, 6	numcl 9789	. . . . . 6 |- ( ( T x. A ) + B ) e. NN0
8	3, 7	eqeltri 2311	. . . . 5 |- M e. NN0
9	8	nn0cni 9575	. . . 4 |- M e. CC
10	2, 9	mulcomi 8332	. . 3 |- ( P x. M ) = ( M x. P )
11	10	oveq1i 6095	. 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
17	5	nn0cni 9575	. . . . . 6 |- A e. CC
18	17, 2	mulcomi 8332	. . . . 5 |- ( A x. P ) = ( P x. A )
19	18	oveq1i 6095	. . . 4 |- ( ( A x. P ) + ( C + G ) ) = ( ( P x. A ) + ( C + G ) )
20		numma2c.11	. . . 4 |- ( ( P x. A ) + ( C + G ) ) = E
21	19, 20	eqtri 2259	. . 3 |- ( ( A x. P ) + ( C + G ) ) = E
22	6	nn0cni 9575	. . . . . 6 |- B e. CC
23	22, 2	mulcomi 8332	. . . . 5 |- ( B x. P ) = ( P x. B )
24	23	oveq1i 6095	. . . 4 |- ( ( B x. P ) + D ) = ( ( P x. B ) + D )
25		numma2c.12	. . . 4 |- ( ( P x. B ) + D ) = ( ( T x. G ) + F )
26	24, 25	eqtri 2259	. . 3 |- ( ( B x. P ) + D ) = ( ( T x. G ) + F )
27	4, 5, 6, 12, 13, 3, 14, 1, 15, 16, 21, 26	nummac 9821	. 2 |- ( ( M x. P ) + N ) = ( ( T x. E ) + F )
28	11, 27	eqtri 2259	1 |- ( ( P x. M ) + N ) = ( ( T x. E ) + F )

This proof depends on syntax axioms:   = wceq 1402   e. wcel 2209  (class class class)co 6085   + caddc 8182   x. cmul 8184   NN0cn0 9563

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-sub 8499  df-inn 9305  df-n0 9564

This theorem is used by:  decma2c  9829