[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-lastn-04
⊦ m + 1 = n ∧ # bits0 < n → lastn(m, bits + fillsgn(n, bits0).rest) = fillsgn(n -1, bits0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 9
Used lemmas:
fill-rec
,
fill-length
,
fillsgn-empty
,
fill-fill
,
fill-empty
,
Used spec theorems:
list-del
/bitlista/
lastN-append-01
list-data
/bitlista/
length-rest
list-del
/bitlista/
lastN-all
Used simplifier rules:
nat
/
ler
nat
/
let
nat
/
fle-01
nat-basic1
/
ref-1
list-del
/bitlista/
lastn-mklist-03
nat
/
lep-02
nat
/
le
list-last
/bitlista/
mk-len
list
/bitlista/
len-02
list
/bitlista/
len
nat
/
add-01
list-last
/bitlista/
mk-plus
list-last
/bitlista/
mklist-one
list-last
/bitlista/
mk-last
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
c-07
list-del
/bitlista/
lastn-mklist-01
list-last
/bitlista/
mk-inj-01
nat
/
lep-01
nat
/
fle
nat-basic2
/
l-02
nat
/
ls-01
nat-basic1
/
one-01
list-data
/bitlista/
l
nat
/
pred-03
nat-basic2
/
oz
nat-basic1
/
f
nat
/
lels-01
nat
/
lels
nat-basic2
/
s
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
pred