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

Theorem numaddc 9236
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 9201 . . . . . 6  |-  ( ( T  x.  A )  +  B )  e. 
NN0
61, 5eqeltri 2212 . . . . 5  |-  M  e. 
NN0
76nn0cni 8996 . . . 4  |-  M  e.  CC
87mulid1i 7775 . . 3  |-  ( M  x.  1 )  =  M
98oveq1i 5784 . 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 9000 . . 3  |-  1  e.  NN0
14 numaddc.8 . . 3  |-  F  e. 
NN0
153nn0cni 8996 . . . . . 6  |-  A  e.  CC
1615mulid1i 7775 . . . . 5  |-  ( A  x.  1 )  =  A
1716oveq1i 5784 . . . 4  |-  ( ( A  x.  1 )  +  ( C  + 
1 ) )  =  ( A  +  ( C  +  1 ) )
1810nn0cni 8996 . . . . 5  |-  C  e.  CC
19 ax-1cn 7720 . . . . 5  |-  1  e.  CC
2015, 18, 19addassi 7781 . . . 4  |-  ( ( A  +  C )  +  1 )  =  ( A  +  ( C  +  1 ) )
21 numaddc.9 . . . 4  |-  ( ( A  +  C )  +  1 )  =  E
2217, 20, 213eqtr2i 2166 . . 3  |-  ( ( A  x.  1 )  +  ( C  + 
1 ) )  =  E
234nn0cni 8996 . . . . . 6  |-  B  e.  CC
2423mulid1i 7775 . . . . 5  |-  ( B  x.  1 )  =  B
2524oveq1i 5784 . . . 4  |-  ( ( B  x.  1 )  +  D )  =  ( B  +  D
)
26 numaddc.10 . . . 4  |-  ( B  +  D )  =  ( ( T  x.  1 )  +  F
)
2725, 26eqtri 2160 . . 3  |-  ( ( B  x.  1 )  +  D )  =  ( ( T  x.  1 )  +  F
)
282, 3, 4, 10, 11, 1, 12, 13, 14, 13, 22, 27nummac 9233 . 2  |-  ( ( M  x.  1 )  +  N )  =  ( ( T  x.  E )  +  F
)
299, 28eqtr3i 2162 1  |-  ( M  +  N )  =  ( ( T  x.  E )  +  F
)
Colors of variables: wff set class
Syntax hints:    = wceq 1331    e. wcel 1480  (class class class)co 5774   1c1 7628    + caddc 7630    x. cmul 7632   NN0cn0 8984
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-setind 4452  ax-cnex 7718  ax-resscn 7719  ax-1cn 7720  ax-1re 7721  ax-icn 7722  ax-addcl 7723  ax-addrcl 7724  ax-mulcl 7725  ax-addcom 7727  ax-mulcom 7728  ax-addass 7729  ax-mulass 7730  ax-distr 7731  ax-i2m1 7732  ax-1rid 7734  ax-0id 7735  ax-rnegex 7736  ax-cnre 7738
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-br 3930  df-opab 3990  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-iota 5088  df-fun 5125  df-fv 5131  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-sub 7942  df-inn 8728  df-n0 8985
This theorem is referenced by:  decaddc  9243
  Copyright terms: Public domain W3C validator