[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 lastn-fill-sgn
⊦ bits ≠ [] → lastn(n, fillsgn(n, sgn(bits))) = lastn(n, fillsgn(n, bits))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
intops
,
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 31
Used lemmas:
sgn-lastn-01
,
sgn-rec
,
sgn-base-03
,
fill-sgn-04
,
sgn-base-01
,
sgn-rec-01
,
sgn-append-05
,
sgn-append-04
,
sgn-append-01
,
fill-length
,
fillsgn-longer
,
fill-sgn
,
fill-lastn
,
fill-sgn-01
,
Used spec theorems:
list-del
/bitlista/
lastN-all
list
/bitlista/
split-rest
list-del
/bitlista/
lastN-append
Used simplifier rules:
nat-basic2
/
eq-01
list
/bitlista/
app-02-ant
list
/bitlista/
e
nat
/
lels-03
nat
/
lels
nat-basic2
/
s
list
/bitlista/
c
list
/bitlista/
len-02
list
/bitlista/
e-01
list
/bitlista/
e-03
nat
/
l-num-04
list-data
/bitlista/
elim-list-c
nat-basic2
/
l
nat-basic2
/
l-02
nat-basic1
/
lf-01
nat-basic2
/
l-01
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq
list
/bitlista/
a
list
/bitlista/
len
nat-basic1
/
ls-02
nat-basic2
/
succ
nat-basic1
/
trans-1
nat-basic1
/
trans
list-data
/bitlista/
l
nat-basic1
/
f
nat
/
lels-01