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

Theorem numadd 9755
Description: Add two decimal integers  M and  N (no 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
)
numadd.8  |-  ( A  +  C )  =  E
numadd.9  |-  ( B  +  D )  =  F
Assertion
Ref Expression
numadd  |-  ( M  +  N )  =  ( ( T  x.  E )  +  F
)

Proof of Theorem numadd
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 9721 . . . . . 6  |-  ( ( T  x.  A )  +  B )  e. 
NN0
61, 5eqeltri 2305 . . . . 5  |-  M  e. 
NN0
76nn0cni 9508 . . . 4  |-  M  e.  CC
87mulridi 8276 . . 3  |-  ( M  x.  1 )  =  M
98oveq1i 6060 . 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 9512 . . 3  |-  1  e.  NN0
143nn0cni 9508 . . . . . 6  |-  A  e.  CC
1514mulridi 8276 . . . . 5  |-  ( A  x.  1 )  =  A
1615oveq1i 6060 . . . 4  |-  ( ( A  x.  1 )  +  C )  =  ( A  +  C
)
17 numadd.8 . . . 4  |-  ( A  +  C )  =  E
1816, 17eqtri 2253 . . 3  |-  ( ( A  x.  1 )  +  C )  =  E
194nn0cni 9508 . . . . . 6  |-  B  e.  CC
2019mulridi 8276 . . . . 5  |-  ( B  x.  1 )  =  B
2120oveq1i 6060 . . . 4  |-  ( ( B  x.  1 )  +  D )  =  ( B  +  D
)
22 numadd.9 . . . 4  |-  ( B  +  D )  =  F
2321, 22eqtri 2253 . . 3  |-  ( ( B  x.  1 )  +  D )  =  F
242, 3, 4, 10, 11, 1, 12, 13, 18, 23numma 9752 . 2  |-  ( ( M  x.  1 )  +  N )  =  ( ( T  x.  E )  +  F
)
259, 24eqtr3i 2255 1  |-  ( M  +  N )  =  ( ( T  x.  E )  +  F
)
Colors of variables: wff set class
Syntax hints:    = wceq 1398    e. wcel 2203  (class class class)co 6050   1c1 8128    + caddc 8130    x. cmul 8132   NN0cn0 9496
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-cnre 8238
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-sub 8446  df-inn 9238  df-n0 9497
This theorem is referenced by:  decadd  9762
  Copyright terms: Public domain W3C validator