[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-neg
⊦ # bytes < n ∧ bytes2int(bytes) < 0 → fillsgn(n, bytes) = mklist(i2b(~1), n - # bytes) + bytes
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
fillsgn-butlast
,
fillsgn-empty
,
fillsgn-fix
,
fillsgn-length
,
fillsgn-rec
,
fillsgn-short
,
fix-butlast-longer
,
int2bytes-fillsgn-rec
,
rightshift-8-01-01
,
rightshift-8-02
,
setInt-theorem
,
setShort-theorem
,
Used by units in proved state:
Proof exists?: No