[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 bytes2int-fillsgn-zero
⊦ fillsgn(n, i2b(0) ') ≠ bytes ∧ bytes ≠ [] ∧ n = # bytes → bytes2int(bytes) ≠ 0
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: 10
Proof steps: 22
Used lemmas:
fillsgn-longer
,
bytes2int-zero
,
fillsgn-pos
,
bytes2int-zero-06
,
Used spec theorems:
list-last
/bytelist/
mklist-last
list-del
/bytelist/
extension
list-del
/bytelist/
get-in
byte
/
i2b-noteq
list-del
/bytelist/
get-butlast
Used simplifier rules:
list-del
/bytelist/
get-mklist-01
list-del
/bytelist/
get-append-grt
nat
/
anti
nat
/
zero
list-del
/bytelist/
one-03
byte
/
ibi
nat
/
le-ls-simp
nat-basic2
/
oz
nat-basic1
/
f
nat-basic1
/
lf-01
nat
/
let
nat
/
eq
nat
/
le-add
nat
/
lels
nat-basic2
/
s
list-last
/bytelist/
mk-len
list-last
/bytelist/
mklist-one
list-last
/bytelist/
mk-plus
nat-basic2
/
one
nat
/
elim-pred-c
list
/bytelist/
c-04
byte
/
byte-equal-01
list
/bytelist/
app
list
/bytelist/
e-01
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
one-03
list
/bytelist/
a
list
/bytelist/
len
list
/bytelist/
c
list-data
/bytelist/
elim-list-c
list
/bytelist/
in-08
list-data
/bytelist/
l
nat-basic1
/
one
list
/bytelist/
len-02