[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-sgn
⊦ n = # bits → fillsgn(n, sgn(bits)) = bits
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
lastn-fill-sgn
,
Used by units in proved state:
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 13
Used lemmas:
sgn-mklist
,
sgn-ex
,
sgn-first-01
,
fillsgn-empty
,
sgn-empty
,
sgn-empty-01
,
sgn-length-01
,
fill-fill
,
Used spec theorems:
list
/bitlista/
len-05
Used simplifier rules:
nat-basic2
/
eq-01
nat
/
eq-01
nat-basic2
/
a
nat-basic2
/
c
list-last
/bitlista/
mk-len
nat-basic2
/
succ
list-last
/bitlista/
mk-in
list
/bitlista/
in-append
list
/bitlista/
in-14
list
/bitlista/
e
list
/bitlista/
app-02-ant
list
/bitlista/
c-08
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
c
list-data
/bitlista/
elim-list-c
list-last
/bitlista/
mk-zero
list-data
/bitlista/
size-01