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

Theorem decrmac 9561
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 9310 . 2  |-  0  e.  NN0
4 decrmanc.n . 2  |-  N  e. 
NN0
5 decrmanc.m . 2  |-  M  = ; A B
64dec0h 9525 . 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 9307 . . . . 5  |-  G  e.  CC
1110addlidi 8215 . . . 4  |-  ( 0  +  G )  =  G
1211oveq2i 5955 . . 3  |-  ( ( A  x.  P )  +  ( 0  +  G ) )  =  ( ( A  x.  P )  +  G
)
13 decrmac.e . . 3  |-  ( ( A  x.  P )  +  G )  =  E
1412, 13eqtri 2226 . 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 9555 1  |-  ( ( M  x.  P )  +  N )  = ; E F
Colors of variables: wff set class
Syntax hints:    = wceq 1373    e. wcel 2176  (class class class)co 5944   0cc0 7925    + caddc 7928    x. cmul 7930   NN0cn0 9295  ;cdc 9504
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253  ax-setind 4585  ax-cnex 8016  ax-resscn 8017  ax-1cn 8018  ax-1re 8019  ax-icn 8020  ax-addcl 8021  ax-addrcl 8022  ax-mulcl 8023  ax-addcom 8025  ax-mulcom 8026  ax-addass 8027  ax-mulass 8028  ax-distr 8029  ax-i2m1 8030  ax-1rid 8032  ax-0id 8033  ax-rnegex 8034  ax-cnre 8036
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-br 4045  df-opab 4106  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-iota 5232  df-fun 5273  df-fv 5279  df-riota 5899  df-ov 5947  df-oprab 5948  df-mpo 5949  df-sub 8245  df-inn 9037  df-2 9095  df-3 9096  df-4 9097  df-5 9098  df-6 9099  df-7 9100  df-8 9101  df-9 9102  df-n0 9296  df-dec 9505
This theorem is referenced by:  2exp16  12760
  Copyright terms: Public domain W3C validator