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

Theorem numsucc 9496
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 9265 . . . . . . . 8  |-  1  e.  NN0
42, 3nn0addcli 9286 . . . . . . 7  |-  ( Y  +  1 )  e. 
NN0
51, 4eqeltri 2269 . . . . . 6  |-  T  e. 
NN0
65nn0cni 9261 . . . . 5  |-  T  e.  CC
76mulridi 8028 . . . 4  |-  ( T  x.  1 )  =  T
87oveq2i 5933 . . 3  |-  ( ( T  x.  A )  +  ( T  x.  1 ) )  =  ( ( T  x.  A )  +  T
)
9 numsucc.3 . . . . 5  |-  A  e. 
NN0
109nn0cni 9261 . . . 4  |-  A  e.  CC
11 ax-1cn 7972 . . . 4  |-  1  e.  CC
126, 10, 11adddii 8036 . . 3  |-  ( T  x.  ( A  + 
1 ) )  =  ( ( T  x.  A )  +  ( T  x.  1 ) )
131eqcomi 2200 . . . 4  |-  ( Y  +  1 )  =  T
14 numsucc.5 . . . 4  |-  N  =  ( ( T  x.  A )  +  Y
)
155, 9, 2, 13, 14numsuc 9470 . . 3  |-  ( N  +  1 )  =  ( ( T  x.  A )  +  T
)
168, 12, 153eqtr4ri 2228 . 2  |-  ( N  +  1 )  =  ( T  x.  ( A  +  1 ) )
17 numsucc.4 . . 3  |-  ( A  +  1 )  =  B
1817oveq2i 5933 . 2  |-  ( T  x.  ( A  + 
1 ) )  =  ( T  x.  B
)
199, 3nn0addcli 9286 . . . 4  |-  ( A  +  1 )  e. 
NN0
2017, 19eqeltrri 2270 . . 3  |-  B  e. 
NN0
215, 20num0u 9467 . 2  |-  ( T  x.  B )  =  ( ( T  x.  B )  +  0 )
2216, 18, 213eqtri 2221 1  |-  ( N  +  1 )  =  ( ( T  x.  B )  +  0 )
Colors of variables: wff set class
Syntax hints:    = wceq 1364    e. wcel 2167  (class class class)co 5922   0cc0 7879   1c1 7880    + caddc 7882    x. cmul 7884   NN0cn0 9249
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-addcom 7979  ax-mulcom 7980  ax-addass 7981  ax-mulass 7982  ax-distr 7983  ax-i2m1 7984  ax-1rid 7986  ax-0id 7987  ax-rnegex 7988  ax-cnre 7990
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-br 4034  df-opab 4095  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-iota 5219  df-fun 5260  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-sub 8199  df-inn 8991  df-n0 9250
This theorem is referenced by:  decsucc  9497
  Copyright terms: Public domain W3C validator