[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 arr2list-get
⊦ m < # ar ∧ n ≤ m → (arr2list(ar, m)[n] ↔ ar[n])
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
2-way-sort
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 11
Used lemmas:
arr2list-len
,
arr2list-rec
,
arr2list-base
,
Used spec theorems:
list-del
/boollist/
get-append-grt
Used simplifier rules:
list-del
/boollist/
get-append-less
nat
/
le-ls-simp
nat
/
lels
nat-basic2
/
s
nat
/
lels-02
nat-basic2
/
nls-fst
list-del
/boollist/
get-last
list
/boollist/
a
nat
/
lep-02
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
succ
nat
/
lez-01
nat-basic1
/
zero
nat-basic1
/
lf-02
list-del
/boollist/
one-03
nat-basic1
/
f
nat
/
fle-01