[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
⊦ ∃ ix. # ix = # solix(x) ∧ ascsubseq(ix, x)
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: 5
Proof steps: 12
Used lemmas:
inv-last-nonempty
,
theoremx-atleast-ind
,
ascsubseq-base
,
inv-base
,
precedesex-base
,
solix-def
,
solix-inv
,
precedesex-solix
,
Used spec theorems:
Used simplifier rules:
list-data
/indexseq-stackseq/
size-01
list-data
/indexseq/
l
list
/indexseq/
Last
list-last
/indexseq-stackseq/
lb
list
/indexseq-stackseq/
a
list-last
/indexseq-stackseq/
butlast-last
nat
/
elim-pred-c
list-data
/indexseq-stackseq/
l
list
/indexseq/
in-08
list-data
/indexseq/
elim-list-c
list
/indexseq/
in-17
list
/indexseq/
in-append
list
/indexseq/
in-14
list
/indexseq/
c
list
/indexseq/
len
list
/indexseq/
len-02
list
/indexseq/
a
nat-basic2
/
eq-01
nat-basic2
/
a
nat-basic2
/
c