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

Theorem numsucc 8516
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 8304 . . . . . . . 8  |-  1  e.  NN0
42, 3nn0addcli 8325 . . . . . . 7  |-  ( Y  +  1 )  e. 
NN0
51, 4eqeltri 2151 . . . . . 6  |-  T  e. 
NN0
65nn0cni 8300 . . . . 5  |-  T  e.  CC
76mulid1i 7121 . . . 4  |-  ( T  x.  1 )  =  T
87oveq2i 5543 . . 3  |-  ( ( T  x.  A )  +  ( T  x.  1 ) )  =  ( ( T  x.  A )  +  T
)
9 numsucc.3 . . . . 5  |-  A  e. 
NN0
109nn0cni 8300 . . . 4  |-  A  e.  CC
11 ax-1cn 7069 . . . 4  |-  1  e.  CC
126, 10, 11adddii 7129 . . 3  |-  ( T  x.  ( A  + 
1 ) )  =  ( ( T  x.  A )  +  ( T  x.  1 ) )
131eqcomi 2085 . . . 4  |-  ( Y  +  1 )  =  T
14 numsucc.5 . . . 4  |-  N  =  ( ( T  x.  A )  +  Y
)
155, 9, 2, 13, 14numsuc 8490 . . 3  |-  ( N  +  1 )  =  ( ( T  x.  A )  +  T
)
168, 12, 153eqtr4ri 2112 . 2  |-  ( N  +  1 )  =  ( T  x.  ( A  +  1 ) )
17 numsucc.4 . . 3  |-  ( A  +  1 )  =  B
1817oveq2i 5543 . 2  |-  ( T  x.  ( A  + 
1 ) )  =  ( T  x.  B
)
199, 3nn0addcli 8325 . . . 4  |-  ( A  +  1 )  e. 
NN0
2017, 19eqeltrri 2152 . . 3  |-  B  e. 
NN0
215, 20num0u 8487 . 2  |-  ( T  x.  B )  =  ( ( T  x.  B )  +  0 )
2216, 18, 213eqtri 2105 1  |-  ( N  +  1 )  =  ( ( T  x.  B )  +  0 )
Colors of variables: wff set class
Syntax hints:    = wceq 1284    e. wcel 1433  (class class class)co 5532   0cc0 6981   1c1 6982    + caddc 6984    x. cmul 6986   NN0cn0 8288
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-setind 4280  ax-cnex 7067  ax-resscn 7068  ax-1cn 7069  ax-1re 7070  ax-icn 7071  ax-addcl 7072  ax-addrcl 7073  ax-mulcl 7074  ax-addcom 7076  ax-mulcom 7077  ax-addass 7078  ax-mulass 7079  ax-distr 7080  ax-i2m1 7081  ax-1rid 7083  ax-0id 7084  ax-rnegex 7085  ax-cnre 7087
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-br 3786  df-opab 3840  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-iota 4887  df-fun 4924  df-fv 4930  df-riota 5488  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-sub 7281  df-inn 8040  df-n0 8289
This theorem is referenced by:  decsucc  8517
  Copyright terms: Public domain W3C validator