[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 pos-at
⊦ n < # str ∧ ¬ dups(s→l(str)) → pos(s→l(str)[n], str) = n
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 12
Used lemmas:
s2l-length
,
s2l-one
,
s2l-app
,
Used spec theorems:
list-del
/charlist/
get-numrec
string-less
/
Pos-rec
list-del
/charlist/
get-in
Used simplifier rules:
nat-basic2
/
eq-01
nat
/
ls-le-simp
nat
/
succ-01
nat-basic2
/
oz
nat
/
elim-pred-c
nat
/
pred-03
list-del
/charlist/
get-zero-01
string-less
/
Pos-found
nat
/
lels
list
/charlist/
a
list-dup
/charlist/
dups-cons
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
s
string-less
/
Length-rec
string-append
/
assoc
string-append
/
chartostring-01
string-less
/
len-zero
nat-basic1
/
f