[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem bits2uint-succ
⊦ bits ≠ [] → bits2uint(bits +1) = bits2uint(bits) + 1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bits2int-first
,
bits2int-inv
,
bits2int-lasteq
,
bits2int-range
,
bits2int-rec-03
,
bits2int-split-01
,
bits2uint-inv-pos
,
int2uint-inv
,
ubits2bits
,
uint2int-rest
,
uint2uint-inv-01
,
Used by units in proved state:
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 8
Used lemmas:
bits2uint-base
,
bits2uint-one-03
,
bits2uint-zero
,
bits2uint-one
,
Used spec theorems:
list
/bitlista/
lastdiv-rew
bitopsaux
/
succ-rec-01
Used simplifier rules:
bitopsaux
/
succ-empty
list
/bitlista/
len
list
/bitlista/
len-02
nat-basic2
/
s
nat-basic1
/
ref-1
nat-basic2
/
a
nat-basic2
/
c
int-mult
/
eq-pos
int-mult
/
associativity
int-mult
/
succ-rmerge
int-mult
/
commutativity
bitopsaux
/
succ-zero
list
/bitlista/
Last
list
/bitlista/
a
int-basic2
/
add-in
int-basic2
/
add-a
int-basic2
/
add-c