[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 fill-empty
⊦ fillsgn(n, bits) = [] ↔ bits = [] ∧ n = 0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
fill-first
,
fill-lastn-04
,
fill-sgn-03
,
fix-empty
,
Used by units in proved state:
intops
,
int2bits
,
bytes
,
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
fill-fill
,
fillsgn-longer
,
fillsgn-empty
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
ls-02
list
/bitlista/
app-02-ant
nat
/
zero-01
list
/bitlista/
a
nat-basic1
/
f
nat
/
lels-01
list-last
/bitlista/
mk-empty
list-last
/bitlista/
mk-zero
list-data
/bitlista/
size-01
nat
/
lez-01