[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-first
⊦ bits ≠ [] → (fillsgn(n, bits).first ↔ bits.first)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
int2bits
,
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 8
Used lemmas:
fillsgn-longer
,
fill-rec
,
fill-empty
,
Used spec theorems:
Used simplifier rules:
nat
/
lels-01
nat
/
fle
nat-basic2
/
c
nat
/
fle-01
nat-basic1
/
f
nat-basic2
/
l
nat-basic1
/
ref-1
nat-basic2
/
a
nat
/
lels
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
c-08
nat
/
pred-03
list
/bitlista/
c-06
list
/bitlista/
in-17
list
/bitlista/
in-append
list
/bitlista/
in-14
list
/bitlista/
app-02-ant
list
/bitlista/
e
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
c
list-data
/bitlista/
elim-list-c