[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-short
⊦ bytes ≠ [] → (fillsgn(2, int2bytes(bytes2int(bytes))) = bytes ↔ 2 ≤ # bytes ∧ (2 < # bytes → int2bytes(bytes2int(bytes)) = bytes))
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: 11
Proof steps: 25
Used lemmas:
fillsgn-pos
,
fillsgn-neg
,
int2bytes-byte-01
,
bytes2int-one
,
bytes2bytes-fillsgn
,
fillsgn-length-01
,
fillsgn-longer
,
int2bytes-empty
,
fillsgn-length
,
Used spec theorems:
list-data
/bytelist/
length-neq
list-data
/bytelist/
lf-01
Used simplifier rules:
int-abs
/
lels-04
int-abs
/
lels-01
int-abs
/
forward-le-01
int-abs
/
lels
list
/bytelist/
len-02
list-last
/bytelist/
mklist-one
list
/bytelist/
e
list
/bytelist/
in-17
list
/bytelist/
in-14
list
/bytelist/
e-01
list
/bytelist/
c-03
list-data
/bytelist/
elim-list-c
list
/bytelist/
a
list
/bytelist/
app
list
/bytelist/
c
nat-basic1
/
lstwo
nat
/
ls-le-simp
nat
/
anti
nat-basic2
/
a
nat-basic2
/
twols
nat-basic1
/
lf-02
nat-basic1
/
lf-01
nat-basic2
/
c
nat
/
ler
nat-basic2
/
succ
nat-basic1
/
trans-1
nat-basic1
/
f
nat-basic1
/
trans
nat
/
ge
nat
/
fle
nat
/
lels-03
list-data
/bytelist/
l
nat
/
let
nat
/
not-zero
nat
/
lels
nat
/
lels-01