[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
⊦ 1 < # bytes ∧ n ≠ 0 → fix(n, bytes.butlast) = fix(n + 1, 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: 12
Used lemmas:
fillsgn-butlast
,
fix-longer
,
fix-fillsgn
,
Used spec theorems:
list-del
/bytelist/
lastn-rec
Used simplifier rules:
nat
/
ls-01
nat
/
le-ls-simp
nat-basic2
/
pred
list
/bytelist/
Last
list-last
/bytelist/
butlast-def
list
/bytelist/
a
nat-basic2
/
oz
nat
/
lels-02
list-last
/bytelist/
lb
nat
/
ge
nat-basic1
/
one-01
nat
/
lels-01
nat
/
ls-02
nat
/
succ-01
nat
/
lels
nat
/
ls-le-simp
nat-basic1
/
f
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
s
list-data
/bytelist/
l
nat-basic1
/
one