[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-last
⊦ bytes ≠ [] ∧ n ≠ 0 → fix(n, bytes).last = bytes.last
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 8
Used lemmas:
fix-pos-le
,
fix-neg-le
,
fix-longer
,
Used spec theorems:
list-del
/bytelist/
lastn-rec
Used simplifier rules:
nat
/
pred-03
list
/bytelist/
Last
list-last
/bytelist/
last-def
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
forward-le-01
int-abs
/
lels
nat-basic1
/
ls-02
list-last
/bytelist/
lapp
list
/bytelist/
a
nat-basic1
/
f
nat
/
lels-01
nat
/
ge