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

Theorem numma2c 9801
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 9554 . . . 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 9768 . . . . . 6  |-  ( ( T  x.  A )  +  B )  e. 
NN0
83, 7eqeltri 2311 . . . . 5  |-  M  e. 
NN0
98nn0cni 9554 . . . 4  |-  M  e.  CC
102, 9mulcomi 8322 . . 3  |-  ( P  x.  M )  =  ( M  x.  P
)
1110oveq1i 6085 . 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 9554 . . . . . 6  |-  A  e.  CC
1817, 2mulcomi 8322 . . . . 5  |-  ( A  x.  P )  =  ( P  x.  A
)
1918oveq1i 6085 . . . 4  |-  ( ( A  x.  P )  +  ( C  +  G ) )  =  ( ( P  x.  A )  +  ( C  +  G ) )
20 numma2c.11 . . . 4  |-  ( ( P  x.  A )  +  ( C  +  G ) )  =  E
2119, 20eqtri 2259 . . 3  |-  ( ( A  x.  P )  +  ( C  +  G ) )  =  E
226nn0cni 9554 . . . . . 6  |-  B  e.  CC
2322, 2mulcomi 8322 . . . . 5  |-  ( B  x.  P )  =  ( P  x.  B
)
2423oveq1i 6085 . . . 4  |-  ( ( B  x.  P )  +  D )  =  ( ( P  x.  B )  +  D
)
25 numma2c.12 . . . 4  |-  ( ( P  x.  B )  +  D )  =  ( ( T  x.  G )  +  F
)
2624, 25eqtri 2259 . . 3  |-  ( ( B  x.  P )  +  D )  =  ( ( T  x.  G )  +  F
)
274, 5, 6, 12, 13, 3, 14, 1, 15, 16, 21, 26nummac 9800 . 2  |-  ( ( M  x.  P )  +  N )  =  ( ( T  x.  E )  +  F
)
2811, 27eqtri 2259 1  |-  ( ( P  x.  M )  +  N )  =  ( ( T  x.  E )  +  F
)
Colors of variables: wff set class
Syntax hints:    = wceq 1402    e. wcel 2209  (class class class)co 6075    + caddc 8172    x. cmul 8174   NN0cn0 9542
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 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 4244  ax-pow 4306  ax-pr 4341  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280
This theorem 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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-sub 8489  df-inn 9284  df-n0 9543
This theorem is referenced by:  decma2c  9808
  Copyright terms: Public domain W3C validator