[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 int2bits-fill-rest
⊦ j < 0 ∧ ~(2 ^ (i - 1)) < j ∧ 0 < i → fillsgn(i→n(i + 1), int2bits(j)).rest = fillsgn(i→n(i), int2bits(j))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
int2bits-first-01
,
uint2bits-one
,
int2bits-neg-num
,
int2bits-lslen-05
,
int2bits-not-empty
,
Used spec theorems:
bitopsaux
/
fill-rec
Used simplifier rules:
int-basic1
/
ls-01
int-abs
/
lels-01
intnat
/
i2i-pos
int-abs
/
lels
int-abs
/
mone-08
list
/bitlista/
Two
bitopsaux
/
invert-zero
bitopsaux
/
inv-one-01
list
/bitlista/
c
bitopsaux
/
succ-zero
list
/bitlista/
Last
bitopsaux
/
sgn-two-01
bitopsaux
/
fill-one-01
list-last
/bitlista/
mk-plus
bitlista
/
mklist-num-01
list-last
/bitlista/
mk-zero
list
/bitlista/
app
list-last
/bitlista/
mk-last
bitopsaux
/
fill-one-02
list-last
/bitlista/
mk-inj-01
list-data
/bitlista/
l
nat-basic1
/
f
nat-basic2
/
s
int-abs
/
forward-le-02
int-abs
/
forward-le-05
int-abs
/
neg-13
int-basic2
/
add-c
int-basic2
/
add-a
intnat
/
abs-succ-03
nat-basic2
/
pred
nat-basic2
/
a
nat-basic2
/
c
list
/bitlista/
c-07
list
/bitlista/
a