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

Theorem numsucc 9487
Description: The successor of a decimal integer (with carry). (Contributed by Mario Carneiro, 18-Feb-2014.)
Hypotheses
Ref Expression
numsucc.1  |-  Y  e. 
NN0
numsucc.2  |-  T  =  ( Y  +  1 )
numsucc.3  |-  A  e. 
NN0
numsucc.4  |-  ( A  +  1 )  =  B
numsucc.5  |-  N  =  ( ( T  x.  A )  +  Y
)
Assertion
Ref Expression
numsucc  |-  ( N  +  1 )  =  ( ( T  x.  B )  +  0 )

Proof of Theorem numsucc
StepHypRef Expression
1 numsucc.2 . . . . . . 7  |-  T  =  ( Y  +  1 )
2 numsucc.1 . . . . . . . 8  |-  Y  e. 
NN0
3 1nn0 9256 . . . . . . . 8  |-  1  e.  NN0
42, 3nn0addcli 9277 . . . . . . 7  |-  ( Y  +  1 )  e. 
NN0
51, 4eqeltri 2266 . . . . . 6  |-  T  e. 
NN0
65nn0cni 9252 . . . . 5  |-  T  e.  CC
76mulid1i 8021 . . . 4  |-  ( T  x.  1 )  =  T
87oveq2i 5929 . . 3  |-  ( ( T  x.  A )  +  ( T  x.  1 ) )  =  ( ( T  x.  A )  +  T
)
9 numsucc.3 . . . . 5  |-  A  e. 
NN0
109nn0cni 9252 . . . 4  |-  A  e.  CC
11 ax-1cn 7965 . . . 4  |-  1  e.  CC
126, 10, 11adddii 8029 . . 3  |-  ( T  x.  ( A  + 
1 ) )  =  ( ( T  x.  A )  +  ( T  x.  1 ) )
131eqcomi 2197 . . . 4  |-  ( Y  +  1 )  =  T
14 numsucc.5 . . . 4  |-  N  =  ( ( T  x.  A )  +  Y
)
155, 9, 2, 13, 14numsuc 9461 . . 3  |-  ( N  +  1 )  =  ( ( T  x.  A )  +  T
)
168, 12, 153eqtr4ri 2225 . 2  |-  ( N  +  1 )  =  ( T  x.  ( A  +  1 ) )
17 numsucc.4 . . 3  |-  ( A  +  1 )  =  B
1817oveq2i 5929 . 2  |-  ( T  x.  ( A  + 
1 ) )  =  ( T  x.  B
)
199, 3nn0addcli 9277 . . . 4  |-  ( A  +  1 )  e. 
NN0
2017, 19eqeltrri 2267 . . 3  |-  B  e. 
NN0
215, 20num0u 9458 . 2  |-  ( T  x.  B )  =  ( ( T  x.  B )  +  0 )
2216, 18, 213eqtri 2218 1  |-  ( N  +  1 )  =  ( ( T  x.  B )  +  0 )
Colors of variables: wff set class
Syntax hints:    = wceq 1364    e. wcel 2164  (class class class)co 5918   0cc0 7872   1c1 7873    + caddc 7875    x. cmul 7877   NN0cn0 9240
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-addcom 7972  ax-mulcom 7973  ax-addass 7974  ax-mulass 7975  ax-distr 7976  ax-i2m1 7977  ax-1rid 7979  ax-0id 7980  ax-rnegex 7981  ax-cnre 7983
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-iota 5215  df-fun 5256  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-sub 8192  df-inn 8983  df-n0 9241
This theorem is referenced by:  decsucc  9488
  Copyright terms: Public domain W3C validator