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

Theorem numsucc 9816
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 9579 . . . . . . . 8  |-  1  e.  NN0
42, 3nn0addcli 9600 . . . . . . 7  |-  ( Y  +  1 )  e. 
NN0
51, 4eqeltri 2311 . . . . . 6  |-  T  e. 
NN0
65nn0cni 9575 . . . . 5  |-  T  e.  CC
76mulridi 8328 . . . 4  |-  ( T  x.  1 )  =  T
87oveq2i 6096 . . 3  |-  ( ( T  x.  A )  +  ( T  x.  1 ) )  =  ( ( T  x.  A )  +  T
)
9 numsucc.3 . . . . 5  |-  A  e. 
NN0
109nn0cni 9575 . . . 4  |-  A  e.  CC
11 ax-1cn 8272 . . . 4  |-  1  e.  CC
126, 10, 11adddii 8336 . . 3  |-  ( T  x.  ( A  + 
1 ) )  =  ( ( T  x.  A )  +  ( T  x.  1 ) )
131eqcomi 2242 . . . 4  |-  ( Y  +  1 )  =  T
14 numsucc.5 . . . 4  |-  N  =  ( ( T  x.  A )  +  Y
)
155, 9, 2, 13, 14numsuc 9790 . . 3  |-  ( N  +  1 )  =  ( ( T  x.  A )  +  T
)
168, 12, 153eqtr4ri 2270 . 2  |-  ( N  +  1 )  =  ( T  x.  ( A  +  1 ) )
17 numsucc.4 . . 3  |-  ( A  +  1 )  =  B
1817oveq2i 6096 . 2  |-  ( T  x.  ( A  + 
1 ) )  =  ( T  x.  B
)
199, 3nn0addcli 9600 . . . 4  |-  ( A  +  1 )  e. 
NN0
2017, 19eqeltrri 2312 . . 3  |-  B  e. 
NN0
215, 20num0u 9787 . 2  |-  ( T  x.  B )  =  ( ( T  x.  B )  +  0 )
2216, 18, 213eqtri 2263 1  |-  ( N  +  1 )  =  ( ( T  x.  B )  +  0 )
Colors of variables:    wff set class
This proof depends on syntax axioms:    = wceq 1402    e. wcel 2209  (class class class)co 6085   0cc0 8179   1c1 8180    + caddc 8182    x. cmul 8184   NN0cn0 9563
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-sub 8499  df-inn 9305  df-n0 9564
This theorem is used by:  decsucc  9817
  Copyright terms: Public domain W3C validator