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

Theorem decmul1 9840
Description: The product of a numeral with a number (no carry). (Contributed by AV, 22-Jul-2021.) (Revised by AV, 6-Sep-2021.)
Hypotheses
Ref Expression
decmul1.p  |-  P  e. 
NN0
decmul1.a  |-  A  e. 
NN0
decmul1.b  |-  B  e. 
NN0
decmul1.n  |-  N  = ; A B
decmul1.0  |-  D  e. 
NN0
decmul1.c  |-  ( A  x.  P )  =  C
decmul1.d  |-  ( B  x.  P )  =  D
Assertion
Ref Expression
decmul1  |-  ( N  x.  P )  = ; C D

Proof of Theorem decmul1
StepHypRef Expression
1 10nn0 9794 . . 3  |- ; 1 0  e.  NN0
2 decmul1.p . . 3  |-  P  e. 
NN0
3 decmul1.a . . 3  |-  A  e. 
NN0
4 decmul1.b . . 3  |-  B  e. 
NN0
5 decmul1.n . . . 4  |-  N  = ; A B
6 dfdec10 9780 . . . 4  |- ; A B  =  ( (; 1 0  x.  A
)  +  B )
75, 6eqtri 2259 . . 3  |-  N  =  ( (; 1 0  x.  A
)  +  B )
8 decmul1.0 . . 3  |-  D  e. 
NN0
9 0nn0 9578 . . 3  |-  0  e.  NN0
103, 2nn0mulcli 9601 . . . . . 6  |-  ( A  x.  P )  e. 
NN0
1110nn0cni 9575 . . . . 5  |-  ( A  x.  P )  e.  CC
1211addridi 8468 . . . 4  |-  ( ( A  x.  P )  +  0 )  =  ( A  x.  P
)
13 decmul1.c . . . 4  |-  ( A  x.  P )  =  C
1412, 13eqtri 2259 . . 3  |-  ( ( A  x.  P )  +  0 )  =  C
15 decmul1.d . . . . 5  |-  ( B  x.  P )  =  D
1615oveq2i 6096 . . . 4  |-  ( 0  +  ( B  x.  P ) )  =  ( 0  +  D
)
174, 2nn0mulcli 9601 . . . . . 6  |-  ( B  x.  P )  e. 
NN0
1817nn0cni 9575 . . . . 5  |-  ( B  x.  P )  e.  CC
1918addlidi 8469 . . . 4  |-  ( 0  +  ( B  x.  P ) )  =  ( B  x.  P
)
201nn0cni 9575 . . . . . . 7  |- ; 1 0  e.  CC
2120mul01i 8718 . . . . . 6  |-  (; 1 0  x.  0 )  =  0
2221eqcomi 2242 . . . . 5  |-  0  =  (; 1 0  x.  0 )
2322oveq1i 6095 . . . 4  |-  ( 0  +  D )  =  ( (; 1 0  x.  0 )  +  D )
2416, 19, 233eqtr3i 2267 . . 3  |-  ( B  x.  P )  =  ( (; 1 0  x.  0 )  +  D )
251, 2, 3, 4, 7, 8, 9, 14, 24nummul1c 9825 . 2  |-  ( N  x.  P )  =  ( (; 1 0  x.  C
)  +  D )
26 dfdec10 9780 . 2  |- ; C D  =  ( (; 1 0  x.  C
)  +  D )
2725, 26eqtr4i 2262 1  |-  ( N  x.  P )  = ; C D
Colors of variables:    wff set class
This proof depends on syntax axioms:    = wceq 1402    e. wcel 2209  (class class class)co 6085   0cc0 8179   1c1 8180    + 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:  sq10  11150  2exp7  13213  log2ublem3  16085  log2ublog2  16086
  Copyright terms: Public domain W3C validator