[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-atleast-ind
⊦ inv(ixs + ix ', # x) ∧ precedes∃(ixs + ix ', x) → (∀ n. n ∈ ix → (∃ ix0. # ix0 = # ixs ∧ ascsubseq(ix0 + n, x)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
theoremx-atleast
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 13
Used lemmas:
ascsubseq-append
,
inv-butlast
,
precedesex-rev-rec1
,
allls-in
,
inv-single
,
ascsubseq-single
,
precedesex-rec0
,
Used spec theorems:
list
/indexseq-stackseq/
lastdiv-rew
Used simplifier rules:
list
/indexseq/
Last
nat
/
lels
list
/indexseq/
Nil
list-data
/indexseq/
l
list-data
/indexseq-stackseq/
size-01
list
/indexseq-stackseq/
Nil
list
/indexseq-stackseq/
Last
list
/indexseq-stackseq/
a
list
/indexseq-stackseq/
len
list
/indexseq-stackseq/
len-02
nat-basic2
/
s
oelem
/indexseq/
irreflexivity
list
/indexseq/
len
list
/indexseq/
len-02
list
/indexseq/
a
nat-basic2
/
eq-01
nat-basic2
/
a
nat-basic2
/
c