[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 valid-eraseqp-invalidate
m < # apebs ⊦ ¬ valid-peb(apeb) ∧ valid-eraseq(apebs, q) → valid-eraseq(apebs[m, apeb], q)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss,
Comment:
Used by:
Used by units in proved state:
ubi-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 25
Used lemmas:
valid-eraseqp-rec
,
valid-eraseqp-base
,
Used spec theorems:
array
/apebs/
Put-other
Used simplifier rules:
nat-basic
/
f
list
/erasequeue-base/
a
list
/erasequeue-base/
c
erasequeueentry
/
elim
apeb
/
elim
nat
/
lels
nat
/
ls-le-simp
array
/apebs/
Size-put
array
/apebs/
Put-same
apeb
/
inj
array
/apebs/
Put-other