[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 ebm-order-write-same
⊦ v ∈ avols0 ∧ avols0 ⊆ avols1 → avols0[v, avols0[v][m, leb]] ⊆ avols1[v, avols1[v][m, leb]]
Type: A user defined theorem
Validity: The proof is valid.
Features: ss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 15
Used lemmas:
ebm-le
,
Used spec theorems:
Used simplifier rules:
array
/abstract-volume/
cngetput
array
/abstract-volume/
Size-put
store
/abstract-volumes/
At-same
store
/abstract-volumes/
insin
array
/abstract-volume/
cgetput
nat
/
le-ls-simp
nat
/
fle-01
leb
/
disj-02
nat
/
lels
array
/abstract-volume/
Put-same
array
/abstract-volume/
Put-other
nat-basic
/
lf-01
nat-basic
/
f
store
/abstract-volumes/
At-other
store
/abstract-volumes/
in-neq