[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 suffix-same
n0 ≤ # ar, n1 ≤ # ar ⊦ suffix(ar, n0) = suffix(ar, n1) ↔ n0 = n1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp,
Comment:
Used by:
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: 6
Used lemmas:
ls-at-subarray
,
suffix
,
Used spec theorems:
array
/gearray/
Extension
Used simplifier rules:
array-copy
/
size-subarray
nat-basic1
/gearray/
ref-1
nat
/
lep-02
nat-basic2
/
eq-01
nat-basic2
/
c
nat-basic2
/
a
nat
/
lep
nat
/
lels-01
nat
/
le-ls-simp
nat
/
elim-sub