[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-recs-in-nonempty-sqns
m < # apebs, # wlar = # apebs ⊦ valid-recs(subarray(apebs, 0, m), subarray(wlar, 0, m), recs) ∧ valid-wl(subarray(apebs, 0, m), subarray(wlar, 0, m)) ∧ v × n ∈ recs → valid-sqns(v, n, apebs, m) ≠ ∅
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
ubi-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 14
Used lemmas:
valid-recs
,
Used spec theorems:
ubi-base
/
valid-wl
sqns
/
valid-peb-in-sqnums-h
Used simplifier rules:
array-copy
/apebs/
size-subarray
nat-basic
/
f
lebadress
/
sel-01
lebadress
/
sel-02
recovery-entry
/
elim
nat-basic
/
succ
oelem
/nat-set/
transitivity
nat-basic
/
lf
nat-basic
/
lf-01
apeb
/
elim
wlentry
/
elim-02
sqns
/
valid-sqns-subarray
array-copy
/apebs/
subarray-at
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
array-copy
/wlarray-base/
subarray-at
array-copy
/wlarray-base/
size-subarray
wlstatus
/
disj-01
wlentry
/
sel-05
apeb
/
sel-04
wlstatus
/
disj-03
valid-peb
/
valid-peb-leb
valid-peb
/
valid-peb-vol
apeb
/
sel-05
apeb
/
sel-08
wlstatus
/
disj-02
wlentry
/
sel-04
valid-peb
/
valid-peb-unique
bag-max
/
bag-empty-notin
nat
/
lels-03