[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-empty
⊦ fillsgn(n, bytes) = [] ↔ n = 0 ∧ bytes = []
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
fix-butlast-longer
,
fix-empty
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 5
Used lemmas:
fillsgn-neg
,
fillsgn-pos
,
fillsgn-longer
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels-03
int-abs
/
lels
int-abs
/
forward-le-02
int-abs
/
lels-01
nat
/
ls-le-simp
nat
/
lels
list
/bytelist/
app-02-ant
nat
/
sub-base
list-last
/bytelist/
mk-empty
list
/bytelist/
a
nat-basic1
/
f
nat
/
lels-01
nat
/
ge
list-data
/bytelist/
size-01
nat
/
lez-01