[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 orderedl-at
⊦ n < # ixs ∧ ordered(ixs, x) → ordered(ixs[n], 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: 1
Proof steps: 10
Used lemmas:
orderedl-base
,
orderedl-rec
,
Used spec theorems:
list-del
/indexseq-stackseq/
get-rec
Used simplifier rules:
nat
/
lels
nat-basic2
/
s
list
/indexseq-stackseq/
len-02
list
/indexseq-stackseq/
len
list
/indexseq-stackseq/
c
list-data
/indexseq-stackseq/
size-01
nat
/
lez-01
list
/indexseq-stackseq/
app
nat-basic1
/
zero-01
list-del
/indexseq-stackseq/
one-03
nat
/
lez
list-del
/indexseq-stackseq/
get-zero-01
list
/indexseq-stackseq/
c-07
list
/indexseq-stackseq/
a
list
/indexseq-stackseq/
e-01
nat
/
elim-pred-c
list-data
/indexseq-stackseq/
l
nat-basic1
/
f
nat
/
succ-01
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz