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

Theorem numaddc 8605
Description: Add two decimal integers  M and  N (with carry). (Contributed by Mario Carneiro, 18-Feb-2014.)
Hypotheses
Ref Expression
numma.1  |-  T  e. 
NN0
numma.2  |-  A  e. 
NN0
numma.3  |-  B  e. 
NN0
numma.4  |-  C  e. 
NN0
numma.5  |-  D  e. 
NN0
numma.6  |-  M  =  ( ( T  x.  A )  +  B
)
numma.7  |-  N  =  ( ( T  x.  C )  +  D
)
numaddc.8  |-  F  e. 
NN0
numaddc.9  |-  ( ( A  +  C )  +  1 )  =  E
numaddc.10  |-  ( B  +  D )  =  ( ( T  x.  1 )  +  F
)
Assertion
Ref Expression
numaddc  |-  ( M  +  N )  =  ( ( T  x.  E )  +  F
)

Proof of Theorem numaddc
StepHypRef Expression
1 numma.6 . . . . . 6  |-  M  =  ( ( T  x.  A )  +  B
)
2 numma.1 . . . . . . 7  |-  T  e. 
NN0
3 numma.2 . . . . . . 7  |-  A  e. 
NN0
4 numma.3 . . . . . . 7  |-  B  e. 
NN0
52, 3, 4numcl 8570 . . . . . 6  |-  ( ( T  x.  A )  +  B )  e. 
NN0
61, 5eqeltri 2152 . . . . 5  |-  M  e. 
NN0
76nn0cni 8367 . . . 4  |-  M  e.  CC
87mulid1i 7183 . . 3  |-  ( M  x.  1 )  =  M
98oveq1i 5553 . 2  |-  ( ( M  x.  1 )  +  N )  =  ( M  +  N
)
10 numma.4 . . 3  |-  C  e. 
NN0
11 numma.5 . . 3  |-  D  e. 
NN0
12 numma.7 . . 3  |-  N  =  ( ( T  x.  C )  +  D
)
13 1nn0 8371 . . 3  |-  1  e.  NN0
14 numaddc.8 . . 3  |-  F  e. 
NN0
153nn0cni 8367 . . . . . 6  |-  A  e.  CC
1615mulid1i 7183 . . . . 5  |-  ( A  x.  1 )  =  A
1716oveq1i 5553 . . . 4  |-  ( ( A  x.  1 )  +  ( C  + 
1 ) )  =  ( A  +  ( C  +  1 ) )
1810nn0cni 8367 . . . . 5  |-  C  e.  CC
19 ax-1cn 7131 . . . . 5  |-  1  e.  CC
2015, 18, 19addassi 7189 . . . 4  |-  ( ( A  +  C )  +  1 )  =  ( A  +  ( C  +  1 ) )
21 numaddc.9 . . . 4  |-  ( ( A  +  C )  +  1 )  =  E
2217, 20, 213eqtr2i 2108 . . 3  |-  ( ( A  x.  1 )  +  ( C  + 
1 ) )  =  E
234nn0cni 8367 . . . . . 6  |-  B  e.  CC
2423mulid1i 7183 . . . . 5  |-  ( B  x.  1 )  =  B
2524oveq1i 5553 . . . 4  |-  ( ( B  x.  1 )  +  D )  =  ( B  +  D
)
26 numaddc.10 . . . 4  |-  ( B  +  D )  =  ( ( T  x.  1 )  +  F
)
2725, 26eqtri 2102 . . 3  |-  ( ( B  x.  1 )  +  D )  =  ( ( T  x.  1 )  +  F
)
282, 3, 4, 10, 11, 1, 12, 13, 14, 13, 22, 27nummac 8602 . 2  |-  ( ( M  x.  1 )  +  N )  =  ( ( T  x.  E )  +  F
)
299, 28eqtr3i 2104 1  |-  ( M  +  N )  =  ( ( T  x.  E )  +  F
)
Colors of variables: wff set class
Syntax hints:    = wceq 1285    e. wcel 1434  (class class class)co 5543   1c1 7044    + caddc 7046    x. cmul 7048   NN0cn0 8355
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2064  ax-sep 3904  ax-pow 3956  ax-pr 3972  ax-setind 4288  ax-cnex 7129  ax-resscn 7130  ax-1cn 7131  ax-1re 7132  ax-icn 7133  ax-addcl 7134  ax-addrcl 7135  ax-mulcl 7136  ax-addcom 7138  ax-mulcom 7139  ax-addass 7140  ax-mulass 7141  ax-distr 7142  ax-i2m1 7143  ax-1rid 7145  ax-0id 7146  ax-rnegex 7147  ax-cnre 7149
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-fal 1291  df-nf 1391  df-sb 1687  df-eu 1945  df-mo 1946  df-clab 2069  df-cleq 2075  df-clel 2078  df-nfc 2209  df-ne 2247  df-ral 2354  df-rex 2355  df-reu 2356  df-rab 2358  df-v 2604  df-sbc 2817  df-dif 2976  df-un 2978  df-in 2980  df-ss 2987  df-pw 3392  df-sn 3412  df-pr 3413  df-op 3415  df-uni 3610  df-int 3645  df-br 3794  df-opab 3848  df-id 4056  df-xp 4377  df-rel 4378  df-cnv 4379  df-co 4380  df-dm 4381  df-iota 4897  df-fun 4934  df-fv 4940  df-riota 5499  df-ov 5546  df-oprab 5547  df-mpt2 5548  df-sub 7348  df-inn 8107  df-n0 8356
This theorem is referenced by:  decaddc  8612
  Copyright terms: Public domain W3C validator