[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-wl-next-bad
m < # apebs, # apebs = # wlar ⊦ valid-wl(subarray(apebs, 0, m), subarray(wlar, 0, m)) → (valid-wl(subarray(apebs, 0, m + 1), subarray(wlar[m, wl-entry(m0, erroneous)], 0, m + 1)) ↔ apebs[m].bad)
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: 2
Proof steps: 16
Used lemmas:
ls-at-subarray-pebs
,
ls-at-subarray-wlar
,
valid-wl
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
ls-02
oelem
/nat-set/
transitivity
nat-basic
/
lf-02
nat
/
le-def
sqns
/
valid-sqns-rec
sqns
/
valid-sqns-subarray
nat
/
le-ls-simp
array-copy
/apebs/
subarray-at
nat-basic
/
add-base
array-copy
/wlarray-base/
subarray-at
nat
/
succ-01
array
/wlarray-base/
Size-put
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
array-copy
/wlarray-base/
size-subarray
apeb
/
elim
oelem
/nat-set/
irreflexivity
nat
/
fle-01
bag-union
/nat-bag/
union-com
bag-union
/nat-bag/
union-ass
bag-union
/nat-bag/
union-empty
valid-peb
/
valid-peb-bad
nat
/
lels
array
/wlarray-base/
cngetput
wlentry
/
elim-02
array
/wlarray-base/
Put-same
nat
/
ler
apeb
/
inj
wlstatus
/
disj-04
nat-basic
/
lf-01
nat-basic
/
succ
wlentry
/
inj-03
nat-basic
/
lf
nat-basic
/
f
nat
/
lels-02
array
/wlarray-base/
Put-other
wlentry
/
sel-04
apeb
/
sel-08
apeb
/
sel-05
apeb
/
sel-04
wlentry
/
sel-05
wlstatus
/
disj-02
wlstatus
/
disj-01
valid-peb
/
valid-peb-unique