[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-01
⊦ # bits ≤ n → fillsgn(n, sgn(bits)) = fillsgn(n, bits)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
fill-sgn-03
,
lastn-fill-sgn
,
Used by units in proved state:
intops
,
int2bits
,
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 17
Proof steps: 31
Used lemmas:
sgn-in
,
sgn-base
,
sgn-append
,
sgn-first
,
sgn-length
,
sgn-not-empty-01
,
fill-fill
,
fillsgn-fill
,
fillsgn-empty
,
sgn-empty
,
Used spec theorems:
list
/bitlista/
firstoc
bitlista
/
mklist-intro
list-last
/bitlista/
mk-succ
list-last
/bitlista/
mk-plus
list-last
/bitlista/
mk-inj-01
Used simplifier rules:
nat-basic2
/
s
nat
/
le-num-02
nat
/
lep
nat
/
lep-02
list
/bitlista/
in-17
list
/bitlista/
in-append
list
/bitlista/
app-03
list-last
/bitlista/
mk-last
nat
/
add-num-01
nat-basic2
/
eq-01
list
/bitlista/
in-13
nat
/
lels
nat
/
fle
nat-basic2
/
l
nat-basic1
/
one-01
list-data
/bitlista/
l
nat-basic2
/
l-01
nat
/
lels-03
nat-basic1
/
ls-02
nat
/
elim-sub
nat-basic1
/
f
nat
/
lels-01
nat-basic2
/
c
nat-basic2
/
a
nat
/
succ-01
list
/bitlista/
a
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
c