[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 ar-elems-update-h0
⊦ n < # ar ∧ n0 ≤ n → ar[n, a] elems n0 = ar elems n0
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
ar-elems-update-h
,
Used by units in proved state:
suffix-array-ops
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
elems-rec
,
elems-base
,
Used spec theorems:
Used simplifier rules:
nat
/
lels-03
bag-basic
/
insert-inj
array
/
cngetput
nat
/
le-add
array
/
Size-put
nat
/
lels
nat
/
succ-01
nat-basic2
/
a
nat-basic2
/
c
nat-basic1
/
lf
nat-basic1
/
trans-1
nat
/
fle
nat
/
le-ls-simp
nat-basic2
/
succ
nat-basic1
/
f
nat
/
fle-01