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

Theorem decrmac 9834
Description: Perform a multiply-add of two numerals  M and  N against a fixed multiplicand  P (with carry). (Contributed by AV, 16-Sep-2021.)
Hypotheses
Ref Expression
decrmanc.a  |-  A  e. 
NN0
decrmanc.b  |-  B  e. 
NN0
decrmanc.n  |-  N  e. 
NN0
decrmanc.m  |-  M  = ; A B
decrmanc.p  |-  P  e. 
NN0
decrmac.f  |-  F  e. 
NN0
decrmac.g  |-  G  e. 
NN0
decrmac.e  |-  ( ( A  x.  P )  +  G )  =  E
decrmac.2  |-  ( ( B  x.  P )  +  N )  = ; G F
Assertion
Ref Expression
decrmac  |-  ( ( M  x.  P )  +  N )  = ; E F

Proof of Theorem decrmac
StepHypRef Expression
1 decrmanc.a . 2  |-  A  e. 
NN0
2 decrmanc.b . 2  |-  B  e. 
NN0
3 0nn0 9578 . 2  |-  0  e.  NN0
4 decrmanc.n . 2  |-  N  e. 
NN0
5 decrmanc.m . 2  |-  M  = ; A B
64dec0h 9798 . 2  |-  N  = ; 0 N
7 decrmanc.p . 2  |-  P  e. 
NN0
8 decrmac.f . 2  |-  F  e. 
NN0
9 decrmac.g . 2  |-  G  e. 
NN0
109nn0cni 9575 . . . . 5  |-  G  e.  CC
1110addlidi 8469 . . . 4  |-  ( 0  +  G )  =  G
1211oveq2i 6096 . . 3  |-  ( ( A  x.  P )  +  ( 0  +  G ) )  =  ( ( A  x.  P )  +  G
)
13 decrmac.e . . 3  |-  ( ( A  x.  P )  +  G )  =  E
1412, 13eqtri 2259 . 2  |-  ( ( A  x.  P )  +  ( 0  +  G ) )  =  E
15 decrmac.2 . 2  |-  ( ( B  x.  P )  +  N )  = ; G F
161, 2, 3, 4, 5, 6, 7, 8, 9, 14, 15decmac 9828 1  |-  ( ( M  x.  P )  +  N )  = ; E F
Colors of variables:    wff set class
This proof depends on syntax axioms:    = wceq 1402    e. wcel 2209  (class class class)co 6085   0cc0 8179    + caddc 8182    x. cmul 8184   NN0cn0 9563  ;cdc 9777
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-2 9363  df-3 9364  df-4 9365  df-5 9366  df-6 9367  df-7 9368  df-8 9369  df-9 9370  df-n0 9564  df-dec 9778
This theorem is used by:  2exp16  13216  log2ublog2  16086
  Copyright terms: Public domain W3C validator