[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 blockstore-prefix
⊦ st0 ⊑ st ↔ dom st0 ⊆ dom st ∧ (∀ n. n ∈ st0 ∧ n ∈ st → st0[n].list ⊑ st[n].list ∧ st0[n].ladrlist ⊑ st[n].ladrlist ∧ # st0[n].list = # st0[n].ladrlist ∧ # st[n].list = # st[n].ladrlist)
Type: An axiom
Validity: The proof is valid.
Features: lws,
Comment:
Used by:
prefix-alloc
,
prefix-append-in
,
prefix-append-notin
,
prefix-at
,
prefix-del-right
,
prefix-domsubset
,
prefix-empty-left
,
prefix-empty-right
,
prefix-fwd-in
,
prefix-in
,
prefix-just-alloc
,
prefix-notin-fwd
,
prefix-refl
,
prefix-rem
,
prefix-rem-alloc
,
prefix-rem-left
,
prefix-remove-refsize0
,
prefix-set-flags
,
prefix-trans
,
Used by units in proved state:
apersistence-asm
,
apersistence-base
,
ablock-nodes
,
Proof exists?: No