[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 succ-prefix
⊦ (bits + false ' + bits0)+1 = bits + (false ' + bits0)+1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
sgn-negint
,
succ-ex
,
succ-exinv
,
succ-inv2x
,
succ-len
,
Used by units in proved state:
int2bits
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
succ-rec
,
succ-one
,
succ-zero
,
Used spec theorems:
list
/bitlista/
lastdiv
Used simplifier rules:
nat-basic1
/
ref-1
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
s
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
app-03
list
/bitlista/
in-17
list
/bitlista/
in-append
list
/bitlista/
e-02
list
/bitlista/
in-15
list
/bitlista/
app-01
list
/bitlista/
Last
list
/bitlista/
a
list
/bitlista/
app