[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 lebs-write-subseteq
⊦ ri.lebs ⊆ dom gstore → ri[key, @(m, m1, m2)].lebs ⊆ dom gstore ++ m
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
gjournal-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 13
Used lemmas:
lebs-index
,
Used spec theorems:
set-union
/nat-set/
subdef
store+set
/node-index/
Data-notin-other
Used simplifier rules:
set-basic
/nat-set/
add
address-data
/
elim
store+set
/group-store-ablock-store-nat-store/
Dom
address-data
/
inj
address-data
/
sel-03