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

Theorem decmul1 9449
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 9403 . . 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 9389 . . . 4  |- ; A B  =  ( (; 1 0  x.  A
)  +  B )
75, 6eqtri 2198 . . 3  |-  N  =  ( (; 1 0  x.  A
)  +  B )
8 decmul1.0 . . 3  |-  D  e. 
NN0
9 0nn0 9193 . . 3  |-  0  e.  NN0
103, 2nn0mulcli 9216 . . . . . 6  |-  ( A  x.  P )  e. 
NN0
1110nn0cni 9190 . . . . 5  |-  ( A  x.  P )  e.  CC
1211addid1i 8101 . . . 4  |-  ( ( A  x.  P )  +  0 )  =  ( A  x.  P
)
13 decmul1.c . . . 4  |-  ( A  x.  P )  =  C
1412, 13eqtri 2198 . . 3  |-  ( ( A  x.  P )  +  0 )  =  C
15 decmul1.d . . . . 5  |-  ( B  x.  P )  =  D
1615oveq2i 5888 . . . 4  |-  ( 0  +  ( B  x.  P ) )  =  ( 0  +  D
)
174, 2nn0mulcli 9216 . . . . . 6  |-  ( B  x.  P )  e. 
NN0
1817nn0cni 9190 . . . . 5  |-  ( B  x.  P )  e.  CC
1918addid2i 8102 . . . 4  |-  ( 0  +  ( B  x.  P ) )  =  ( B  x.  P
)
201nn0cni 9190 . . . . . . 7  |- ; 1 0  e.  CC
2120mul01i 8350 . . . . . 6  |-  (; 1 0  x.  0 )  =  0
2221eqcomi 2181 . . . . 5  |-  0  =  (; 1 0  x.  0 )
2322oveq1i 5887 . . . 4  |-  ( 0  +  D )  =  ( (; 1 0  x.  0 )  +  D )
2416, 19, 233eqtr3i 2206 . . 3  |-  ( B  x.  P )  =  ( (; 1 0  x.  0 )  +  D )
251, 2, 3, 4, 7, 8, 9, 14, 24nummul1c 9434 . 2  |-  ( N  x.  P )  =  ( (; 1 0  x.  C
)  +  D )
26 dfdec10 9389 . 2  |- ; C D  =  ( (; 1 0  x.  C
)  +  D )
2725, 26eqtr4i 2201 1  |-  ( N  x.  P )  = ; C D
Colors of variables: wff set class
Syntax hints:    = wceq 1353    e. wcel 2148  (class class class)co 5877   0cc0 7813   1c1 7814    + caddc 7816    x. cmul 7818   NN0cn0 9178  ;cdc 9386
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 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-addcom 7913  ax-mulcom 7914  ax-addass 7915  ax-mulass 7916  ax-distr 7917  ax-i2m1 7918  ax-1rid 7920  ax-0id 7921  ax-rnegex 7922  ax-cnre 7924
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-br 4006  df-opab 4067  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-iota 5180  df-fun 5220  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-sub 8132  df-inn 8922  df-2 8980  df-3 8981  df-4 8982  df-5 8983  df-6 8984  df-7 8985  df-8 8986  df-9 8987  df-n0 9179  df-dec 9387
This theorem is referenced by:  sq10  10694
  Copyright terms: Public domain W3C validator