[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 theoremx-atmost-h
⊦ ascsubseq(ix, x) ∧ # ixs < # ix ∧ covers(ixs, ix) → (∃ n0, n1, n. n0 ∈ ix ∧ n1 ∈ ix ∧ precedes(n0, n1, x) ∧ n < # ixs ∧ n0 ∈ ixs[n] ∧ n1 ∈ ixs[n])
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
theoremx
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 18
Proof steps: 38
Used lemmas:
coversi-append
,
ascsubseq-single
,
ascsubseq-nodups
,
covers-rem
,
ascsubseq-rem
,
precedes-ascsubseq-2
,
coversi-empty
,
Used spec theorems:
list
/indexseq/
firstoc-rew
Used simplifier rules:
list-data
/indexseq/
l
list
/indexseq-stackseq/
len-02
list
/indexseq-stackseq/
len
list
/indexseq-stackseq/
c
list-del
/indexseq-stackseq/
get-zero-01
list
/indexseq/
in-01
nat-basic2
/
l
list
/indexseq/
len-02
list
/indexseq/
e-03
list
/indexseq/
len
list
/indexseq/
in-17
list
/indexseq/
in-append
list
/indexseq/
app-02-ant
list
/indexseq/
a
list
/indexseq/
Nil
list
/indexseq/
app
list-data
/indexseq/
size-01
nat-basic1
/
zero-01
nat-basic2
/
succ
oelem
/indexseq/
transitivity
nat-basic1
/
lf
nat-basic2
/
nls-fst
list-data
/indexseq-stackseq/
l
nat-basic1
/
f
nat-basic2
/
s
nat-basic2
/
a
nat-basic2
/
c
list-del
/indexseq-stackseq/
get-succ
list
/indexseq-stackseq/
a