[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 at-explicit
⊦ n ∈ st ∧ inv(st) ∧ st[n] = mkblock(x0 + a ' + x1, lax0 + @(m0, m1) ' + lax1, m2) ∧ # x0 = # lax0 → st[@(n, m0, m1)] = a
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
persistence-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 9
Used lemmas:
in
,
at
,
inv-block
,
inv-store
,
Used spec theorems:
list-del
/
get-append-grt
Used simplifier rules:
list-dup
/laddress-list/
a
list-dup
/laddress-list/
f-01
nat-basic
/
eq-01
list
/laddress-list/
len-05
list
/laddress-list/
len
nat-basic
/
succ
list
/
len-05
list
/
len
list
/laddress-list/
in-10
list
/laddress-list/
in-append
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
list
/laddress-list/
a
list-del
/laddress-list/
pos-y
list-del
/laddress-list/
app-05-neg
ablock
/
sel-02
ablock
/
sel-01
address-data
/
sel-05
address-data
/
sel-04
address-data
/
sel-03
nat
/
lels
nat
/
zero
list-del
/
get-zero-01
list
/
a
list-del
/
get-append-less
nat-basic
/
f
nat-basic
/
lf-02
nat-basic
/
lf-01
list-data
/laddress-list/
l
nat-basic
/
ls-02