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