[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 prefix-notin-fwd
⊦ ¬ adr ∈ st1 ∧ st0 ⊑ st1 → ¬ adr ∈ st0
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
Used by units in proved state:
persistence-refine
,
apersistence-asm
,
ablock-nodes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 13
Used lemmas:
in
,
blockstore-prefix
,
Used spec theorems:
set-union
/nat-set/
subdef
Used simplifier rules:
address-data
/
elim
ablock
/
elim
store+set
/ablock-store-nat-store/
Dom
ablock
/
sel-01
address-data
/
sel-03
address-data
/
sel-04
address-data
/
sel-05
ablock
/
sel-02
list-last
/laddress-list/
prefix-in-02