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

Theorem decma2c 9653
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 9618 . . 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 9604 . . . 4  |- ; A B  =  ( (; 1 0  x.  A
)  +  B )
86, 7eqtri 2250 . . 3  |-  M  =  ( (; 1 0  x.  A
)  +  B )
9 decma.n . . . 4  |-  N  = ; C D
10 dfdec10 9604 . . . 4  |- ; C D  =  ( (; 1 0  x.  C
)  +  D )
119, 10eqtri 2250 . . 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 9604 . . . 4  |- ; G F  =  ( (; 1 0  x.  G
)  +  F )
1816, 17eqtri 2250 . . 3  |-  ( ( P  x.  B )  +  D )  =  ( (; 1 0  x.  G
)  +  F )
191, 2, 3, 4, 5, 8, 11, 12, 13, 14, 15, 18numma2c 9646 . 2  |-  ( ( P  x.  M )  +  N )  =  ( (; 1 0  x.  E
)  +  F )
20 dfdec10 9604 . 2  |- ; E F  =  ( (; 1 0  x.  E
)  +  F )
2119, 20eqtr4i 2253 1  |-  ( ( P  x.  M )  +  N )  = ; E F
Colors of variables: wff set class
Syntax hints:    = wceq 1395    e. wcel 2200  (class class class)co 6013   0cc0 8022   1c1 8023    + caddc 8025    x. cmul 8027   NN0cn0 9392  ;cdc 9601
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-addcom 8122  ax-mulcom 8123  ax-addass 8124  ax-mulass 8125  ax-distr 8126  ax-i2m1 8127  ax-1rid 8129  ax-0id 8130  ax-rnegex 8131  ax-cnre 8133
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-sub 8342  df-inn 9134  df-2 9192  df-3 9193  df-4 9194  df-5 9195  df-6 9196  df-7 9197  df-8 9198  df-9 9199  df-n0 9393  df-dec 9602
This theorem is referenced by:  2exp16  13000
  Copyright terms: Public domain W3C validator