[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-eraseq-stronger-next-append-lref
m < # apebs ⊦ valid-eraseq-stronger(subarray(apebs, 0, m), q) → ( valid-eraseq-stronger(subarray(apebs, 0, m + 1), q + eq-entry(m, v × n) ') ↔ valid-peb(v, n, apebs[m]) ∧ apebs[m].vidhdr.sqn ≠ valid-sqns(v, n, apebs, m + 1).max)
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: 6
Proof steps: 25
Used lemmas:
valid-eraseq-stronger-rec
,
valid-eraseq-stronger-base
,
valid-eraseq-stronger-one
,
Used spec theorems:
erasequeue
/
in-append
array-copy
/apebs/
subarray-at
Used simplifier rules:
apeb
/
elim
lebref
/
sel-01
lebref
/
sel-02
lebref
/
disj
list
/erasequeue-base/
Nil
bag-max
/
max-add-one-different
nat-basic
/
lf-02
nat-basic
/
lf-01
apeb
/
sel-05
nat
/
lels-03
array-copy
/apebs/
subarray-at
sqns
/
valid-sqns-rec
sqns
/
valid-sqns-subarray
nat
/
ls-le-simp
nat
/
lels
nat
/
succ-01
nat-basic
/
s-04
array-copy
/apebs/
size-subarray
list
/erasequeue-base/
a
list
/erasequeue-base/
c
erasequeueentry
/
elim
nat-basic
/
succ
oelem
/nat-set/
transitivity
nat-basic
/
lf
nat-basic
/
f
oelem
/nat-set/
irreflexivity
oelem
/nat-set/
sls
nat-basic
/
ls-02
array-copy
/apebs/
subarray-elim
valid-peb
/
valid-peb-bad
valid-peb
/
valid-peb-unique
apeb
/
inj
nat-basic
/
neq-04
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
bag-union
/nat-bag/
union-empty
bag-union
/nat-bag/
union-ass
bag-union
/nat-bag/
union-com
bag-max
/
bag-union-one
bag-max
/
max-rec-simp
nat
/
gr-def