[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-pos-le
⊦ # bytes ≤ n ∧ 0 ≤ bytes2int(bytes) → fix(n, bytes) = mklist(i2b(0), n - # bytes) + bytes
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
fix-last
,
fix-rec-pos
,
fix2rest-last
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
fix-pos
,
fix-longer
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
neq-01
nat-basic1
/
ls-02
int-abs
/
lels-01
int-abs
/
lels-04
nat-basic1
/
f
nat
/
lels-02
int-abs
/
forward-le-01
nat
/
ge
nat
/
anti
list-del
/bytelist/
lastN-all
list
/bytelist/
app-05
list-last
/bytelist/
mk-empty
nat
/
zero-02
list
/bytelist/
a