[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-lcp
⊦ n0 ≤ # ar ∧ n1 ≤ # ar ∧ n2 ≤ # ar ∧ suffix(ar, n0) < suffix(ar, n1) ∧ suffix(ar, n1) < suffix(ar, n2) → (lcp(ar, n0, n1) < lcp(ar, n0, n2) ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
Used by units in proved state:
lrs-ops
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 16
Used lemmas:
Used spec theorems:
lcp
/
lcp-def
suffix
/
lexicographic-suffix-next
Used simplifier rules:
oelem
/
nen
oelem
/
seq
oelem
/
ls-le
nat
/
succ-01
nat-basic1
/
ref-1
oelem
/
transitivity
oelem
/
lel
oelem
/
irreflexivity
nat
/
lels-03
nat
/
lez
nat
/
ler
suffix
/
suffix-end
suffix
/
lexicographic-emparray
nat-basic1
/
ls-02
nat
/
lels-02
nat-basic2
/
eq-01
nat
/
le-ls-simp
nat-basic2
/
oz
nat
/
anti
nat
/
ge
nat
/
lels
nat-basic2
/
s
nat-basic2
/
c
nat-basic2
/
a
nat-basic1
/
lf-01
nat-basic2
/
succ
nat-basic1
/
f