[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-next-samerecs
m < # apebs, # wlar = # apebs, stat ≠ used ⊦ valid-recs(subarray(apebs, 0, m), subarray(wlar, 0, m), recs) → valid-recs(subarray(apebs, 0, m + 1), subarray(wlar[m, wl-entry(m0, stat)], 0, m + 1), recs)
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: 5
Proof steps: 21
Used lemmas:
valid-recs
,
Used spec theorems:
array-copy
/wlarray-base/
at-subarray
Used simplifier rules:
array-copy
/wlarray-base/
subarray-at
array-copy
/apebs/
size-subarray
lebadress
/
elim
recovery-entry
/
elim
apeb
/
elim
wlentry
/
elim-02
oelem
/nat-set/
transitivity
oelem
/nat-set/
ls-le
apeb
/
inj
nat-basic
/
ls-02
array
/wlarray-base/
ngp-09
nat
/
fle-01
nat
/
fle
oelem
/nat-set/
irreflexivity
array-copy
/wlarray-base/
subarray-elim
array
/wlarray-base/
ngp-07
array-copy
/apebs/
subarray-elim
nat
/
le-ls-simp
nat-basic
/
s-04
nat
/
succ-01
array
/wlarray-base/
Size-put
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
array-copy
/apebs/
subarray-at
nat
/
lels
nat
/
ls-le-simp
array
/wlarray-base/
cgetput
wlentry
/
inj-03
nat-basic
/
lf-01
nat-basic
/
succ
nat-basic
/
lf
nat-basic
/
f
nat
/
lels-02
array
/wlarray-base/
Put-other
lebadress
/
sel-02
lebadress
/
sel-01
recovery-entry
/
sel-02
wlentry
/
sel-04
apeb
/
sel-05