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

Theorem decmul1 9418
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 9372 . . 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 9358 . . . 4  |- ; A B  =  ( (; 1 0  x.  A
)  +  B )
75, 6eqtri 2196 . . 3  |-  N  =  ( (; 1 0  x.  A
)  +  B )
8 decmul1.0 . . 3  |-  D  e. 
NN0
9 0nn0 9162 . . 3  |-  0  e.  NN0
103, 2nn0mulcli 9185 . . . . . 6  |-  ( A  x.  P )  e. 
NN0
1110nn0cni 9159 . . . . 5  |-  ( A  x.  P )  e.  CC
1211addid1i 8073 . . . 4  |-  ( ( A  x.  P )  +  0 )  =  ( A  x.  P
)
13 decmul1.c . . . 4  |-  ( A  x.  P )  =  C
1412, 13eqtri 2196 . . 3  |-  ( ( A  x.  P )  +  0 )  =  C
15 decmul1.d . . . . 5  |-  ( B  x.  P )  =  D
1615oveq2i 5876 . . . 4  |-  ( 0  +  ( B  x.  P ) )  =  ( 0  +  D
)
174, 2nn0mulcli 9185 . . . . . 6  |-  ( B  x.  P )  e. 
NN0
1817nn0cni 9159 . . . . 5  |-  ( B  x.  P )  e.  CC
1918addid2i 8074 . . . 4  |-  ( 0  +  ( B  x.  P ) )  =  ( B  x.  P
)
201nn0cni 9159 . . . . . . 7  |- ; 1 0  e.  CC
2120mul01i 8322 . . . . . 6  |-  (; 1 0  x.  0 )  =  0
2221eqcomi 2179 . . . . 5  |-  0  =  (; 1 0  x.  0 )
2322oveq1i 5875 . . . 4  |-  ( 0  +  D )  =  ( (; 1 0  x.  0 )  +  D )
2416, 19, 233eqtr3i 2204 . . 3  |-  ( B  x.  P )  =  ( (; 1 0  x.  0 )  +  D )
251, 2, 3, 4, 7, 8, 9, 14, 24nummul1c 9403 . 2  |-  ( N  x.  P )  =  ( (; 1 0  x.  C
)  +  D )
26 dfdec10 9358 . 2  |- ; C D  =  ( (; 1 0  x.  C
)  +  D )
2725, 26eqtr4i 2199 1  |-  ( N  x.  P )  = ; C D
Colors of variables: wff set class
Syntax hints:    = wceq 1353    e. wcel 2146  (class class class)co 5865   0cc0 7786   1c1 7787    + caddc 7789    x. cmul 7791   NN0cn0 9147  ;cdc 9355
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 614  ax-in2 615  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203  ax-setind 4530  ax-cnex 7877  ax-resscn 7878  ax-1cn 7879  ax-1re 7880  ax-icn 7881  ax-addcl 7882  ax-addrcl 7883  ax-mulcl 7884  ax-addcom 7886  ax-mulcom 7887  ax-addass 7888  ax-mulass 7889  ax-distr 7890  ax-i2m1 7891  ax-1rid 7893  ax-0id 7894  ax-rnegex 7895  ax-cnre 7897
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ne 2346  df-ral 2458  df-rex 2459  df-reu 2460  df-rab 2462  df-v 2737  df-sbc 2961  df-dif 3129  df-un 3131  df-in 3133  df-ss 3140  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-int 3841  df-br 3999  df-opab 4060  df-id 4287  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-iota 5170  df-fun 5210  df-fv 5216  df-riota 5821  df-ov 5868  df-oprab 5869  df-mpo 5870  df-sub 8104  df-inn 8891  df-2 8949  df-3 8950  df-4 8951  df-5 8952  df-6 8953  df-7 8954  df-8 8955  df-9 8956  df-n0 9148  df-dec 9356
This theorem is referenced by:  sq10  10658
  Copyright terms: Public domain W3C validator