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

Theorem decma2c 9707
Description: Perform a multiply-add of two numerals  M and  N against a fixed multiplier  P (with carry). (Contributed by Mario Carneiro, 18-Feb-2014.) (Revised by AV, 6-Sep-2021.)
Hypotheses
Ref Expression
decma.a  |-  A  e. 
NN0
decma.b  |-  B  e. 
NN0
decma.c  |-  C  e. 
NN0
decma.d  |-  D  e. 
NN0
decma.m  |-  M  = ; A B
decma.n  |-  N  = ; C D
decma2c.p  |-  P  e. 
NN0
decma2c.f  |-  F  e. 
NN0
decma2c.g  |-  G  e. 
NN0
decma2c.e  |-  ( ( P  x.  A )  +  ( C  +  G ) )  =  E
decma2c.2  |-  ( ( P  x.  B )  +  D )  = ; G F
Assertion
Ref Expression
decma2c  |-  ( ( P  x.  M )  +  N )  = ; E F

Proof of Theorem decma2c
StepHypRef Expression
1 10nn0 9672 . . 3  |- ; 1 0  e.  NN0
2 decma.a . . 3  |-  A  e. 
NN0
3 decma.b . . 3  |-  B  e. 
NN0
4 decma.c . . 3  |-  C  e. 
NN0
5 decma.d . . 3  |-  D  e. 
NN0
6 decma.m . . . 4  |-  M  = ; A B
7 dfdec10 9658 . . . 4  |- ; A B  =  ( (; 1 0  x.  A
)  +  B )
86, 7eqtri 2252 . . 3  |-  M  =  ( (; 1 0  x.  A
)  +  B )
9 decma.n . . . 4  |-  N  = ; C D
10 dfdec10 9658 . . . 4  |- ; C D  =  ( (; 1 0  x.  C
)  +  D )
119, 10eqtri 2252 . . 3  |-  N  =  ( (; 1 0  x.  C
)  +  D )
12 decma2c.p . . 3  |-  P  e. 
NN0
13 decma2c.f . . 3  |-  F  e. 
NN0
14 decma2c.g . . 3  |-  G  e. 
NN0
15 decma2c.e . . 3  |-  ( ( P  x.  A )  +  ( C  +  G ) )  =  E
16 decma2c.2 . . . 4  |-  ( ( P  x.  B )  +  D )  = ; G F
17 dfdec10 9658 . . . 4  |- ; G F  =  ( (; 1 0  x.  G
)  +  F )
1816, 17eqtri 2252 . . 3  |-  ( ( P  x.  B )  +  D )  =  ( (; 1 0  x.  G
)  +  F )
191, 2, 3, 4, 5, 8, 11, 12, 13, 14, 15, 18numma2c 9700 . 2  |-  ( ( P  x.  M )  +  N )  =  ( (; 1 0  x.  E
)  +  F )
20 dfdec10 9658 . 2  |- ; E F  =  ( (; 1 0  x.  E
)  +  F )
2119, 20eqtr4i 2255 1  |-  ( ( P  x.  M )  +  N )  = ; E F
Colors of variables: wff set class
Syntax hints:    = wceq 1398    e. wcel 2202  (class class class)co 6028   0cc0 8075   1c1 8076    + caddc 8078    x. cmul 8080   NN0cn0 9444  ;cdc 9655
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 619  ax-in2 620  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-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  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-i2m1 8180  ax-1rid 8182  ax-0id 8183  ax-rnegex 8184  ax-cnre 8186
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-sub 8394  df-inn 9186  df-2 9244  df-3 9245  df-4 9246  df-5 9247  df-6 9248  df-7 9249  df-8 9250  df-9 9251  df-n0 9445  df-dec 9656
This theorem is referenced by:  2exp16  13073
  Copyright terms: Public domain W3C validator