[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-one-02
⊦ 0 < i → fillsgn(i→n(i), boolvar ') = mklist(boolvar, i→n(i))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
intops
,
int2bits
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
fill-fill
,
Used spec theorems:
Used simplifier rules:
int-basic1
/
lf-02
int-basic1
/
lf-03
intnat
/
abs-zero
list-last
/bitlista/
mk-plus
list-last
/bitlista/
mklist-one
nat-basic2
/
a
nat-basic2
/
c
list
/bitlista/
app-01
nat
/
elim-pred-c
list
/bitlista/
a
list-last
/bitlista/
mk-last
list
/bitlista/
first
list
/bitlista/
len-02
int-basic1
/
ls-01
int-abs
/
lels-01
intnat
/
num-i2n-le-02
int-abs
/
leone
int-abs
/
lels
int-abs
/
lels-03
list
/bitlista/
e