[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 fillsgn-butlast
⊦ 1 < # bytes → fillsgn(n, bytes.butlast) = fillsgn(n + 1, bytes).butlast
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
fix-butlast
,
fix-butlast-longer
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 26
Used lemmas:
bytes2int-neg
,
bytes2int-pos
,
fillsgn-pos
,
fillsgn-neg
,
fillsgn-longer
,
Used spec theorems:
Used simplifier rules:
nat
/
ls-le-simp
nat
/
lels-02
list
/bytelist/
app-02-ant
list
/bytelist/
e-02
list
/bytelist/
first-01
int-abs
/
lels-03
list-last
/bytelist/
last-elim
list
/bytelist/
c
list
/bytelist/
c-03
list
/bytelist/
len
list
/bytelist/
len-02
nat-basic2
/
one
list-data
/bytelist/
elim-list-c
list-last
/bytelist/
b-01
int-abs
/
zero-gels-01
int-abs
/
forward-le-02
int-abs
/
forward-lsle
nat
/
ls-01
list
/bytelist/
app-03
list-last
/bytelist/
mk-inj-01
nat
/
eq-02
nat-basic2
/
l-02
nat-basic1
/
f
nat
/
fle
nat
/
ls-03
nat-basic2
/
eq-01
list
/bytelist/
a
list-last
/bytelist/
bapp
nat
/
add-01
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
forward-le-01
int-abs
/
lels
nat
/
le-ls-simp
nat-basic2
/
s
nat-basic2
/
c
nat-basic2
/
a
nat
/
lels
nat
/
succ-01
nat
/
ls-02
nat
/
lels-01
nat-basic1
/
one-01
nat
/
ge
list-last
/bytelist/
lb
list-data
/bytelist/
l
nat-basic1
/
one