[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-put
⊦ m < # ar ∧ n ≤ m → (arr2list(ar, m)[n, bv]) = arr2list(ar[n, bv], m)
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: 8
Proof steps: 18
Used lemmas:
arr2list-mod-high
,
arr2list-len
,
arr2list-rec
,
arr2list-base
,
Used spec theorems:
list-del
/boollist/
put-app-left
list-del
/boollist/
put-app-right
array
/boolarr/
Put-other
Used simplifier rules:
nat
/
lels-02
list
/boollist/
app-03
nat-basic2
/
l
list-data
/boollist/
l
nat
/
cancel-01
nat
/
zero
list
/boollist/
app-01
list
/boollist/
a
nat-basic1
/
ref-1
nat-basic2
/
s
array
/boolarr/
Put-same
nat-basic2
/
oz
nat-basic1
/
trans-1
nat-basic1
/
lf
nat-basic1
/
lf-01
nat
/
eqle-one
nat
/
lep-02
nat
/
succ-01
nat
/
anti
nat-basic2
/
nls-fst
nat
/
let
nat
/
lels
nat
/
ls-le-simp
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
succ
array
/boolarr/
Size-put
array
/boolarr/
cgetput
list
/boollist/
c-04
list-del
/boollist/
put-one
nat-basic1
/
lf-02
nat-basic1
/
zero
nat
/
lez-01
nat-basic1
/
f
nat
/
fle-01