[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 fillsgn-rec
⊦ # bytes < n ∧ bytes ≠ [] → fillsgn(n, bytes) = (b2i(bytes.first) < 0 ⊃ i2b(~1);i2b(0)) ' + fillsgn(n -1, bytes)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
fix-butlast-longer
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 34
Used lemmas:
bytes2int-neg
,
bytes2int-pos
,
fillsgn-longer
,
fillsgn-pos
,
fillsgn-neg
,
Used spec theorems:
list-last
/bytelist/
mk-rec
Used simplifier rules:
nat
/
cancel-01
nat
/
lep-02
int-abs
/
lels-03
nat-basic2
/
l
list
/bytelist/
len-02
list
/bytelist/
len
int-abs
/
forward-le-02
list
/bytelist/
app-01
list
/bytelist/
c-08
list
/bytelist/
app-02-ant
list
/bytelist/
e-01
list
/bytelist/
c
list-data
/bytelist/
elim-list-c
nat-basic2
/
l-01
nat
/
eq-01
int-abs
/
zero-gels-04
byte
/
num-i2b-equal
nat
/
ler
list
/bytelist/
c-04
list
/bytelist/
app-03
nat
/
ge
nat
/
lels-01
nat-basic1
/
ref-1
nat-basic2
/
z
list-last
/bytelist/
mklist-one
nat
/
le-add
nat
/
lep
nat
/
elim-sub
nat
/
add-01
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
forward-le-01
nat
/
le-ls-simp
nat
/
lels
nat-basic2
/
s
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
nat-basic1
/
f
nat
/
pred-03
int-abs
/
lels
list
/bytelist/
app-05
list
/bytelist/
e
list
/bytelist/
a
nat-basic1
/
less-1
nat
/
elim-pred-c