[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
⊦ valid(sar, ar) ↔ sar .elems = bag< # ar ∧ (∀ n0, n1. n0 < # sar ∧ n1 < # sar → (suffix(ar, sar[n0]) < suffix(ar, sar[n1]) ↔ n0 < n1))
Type: An axiom
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
valid-sar-at-le
,
valid-sar-at-ls
,
valid-sar-index-exists
,
valid-sar-size
,
valid-sar-twice-same
,
valid-sar-twice-same1
,
valid-suffix-ls
,
Used by units in proved state:
suffix-array-ops
,
Proof exists?: No