[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-03
⊦ bits ≠ [] ∧ m ≤ n → lastn(m, fillsgn(n, bits)) = lastn(m, fillsgn(m, bits))
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
fill-lastn-02
,
Used by units in proved state:
intops
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 25
Used lemmas:
fillsgn-longer
,
fill-lastn
,
fill-fill
,
Used spec theorems:
list-del
/bitlista/
lastn-restn-01
nat
/
prop-01
list-del
/bitlista/
restN-append
Used simplifier rules:
nat
/
add-01
list-last
/bitlista/
mk-plus
list-del
/bitlista/
rest-mklist-03
list-last
/bitlista/
mk-inj-01
list
/bitlista/
app-03
nat
/
ls-03
nat
/
ler
list-del
/bitlista/
restN-zero
nat
/
zero
nat
/
lep
list-last
/bitlista/
mk-len
nat
/
fle
nat
/
sub-ls
nat
/
le-ls-simp
nat
/
let
list
/bitlista/
c
list
/bitlista/
e-01
list
/bitlista/
a
list-last
/bitlista/
mk-last
list
/bitlista/
len
list
/bitlista/
len-02
nat-basic2
/
s
nat
/
lels
nat-basic2
/
l
list-del
/bitlista/
lastN-append-01
list-data
/bitlista/
elim-list-c
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
l-01
nat
/
elim-sub
nat-basic1
/
ls-02
nat
/
lels-03
nat-basic2
/
succ
nat-basic1
/
trans-1
nat-basic1
/
trans
list-data
/bitlista/
l
nat-basic1
/
f
nat
/
lels-01