[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-cons-write
⊦ v ∈ avols ∧ m < # avols[v] ∧ ebm-cons(avols) → (ebm-cons(avols[v, avols[v][m, leb]]) ↔ valid-leb(avols[v][m]) → valid-leb(leb))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss,
Comment:
Used by:
Used by units in proved state:
ubi-refine
,
ebm-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 29
Used lemmas:
valid-leb-def
,
ebm-cons
,
ebm-cons-def
,
Used spec theorems:
Used simplifier rules:
leb
/
elim
array
/abstract-volume/
Size-put
store
/abstract-volumes/
insin
store
/abstract-volumes/
At-same
array
/abstract-volume/
Put-same
leb
/
test-03
leb
/
sel
leb
/
sel-01
array
/abstract-volume/
Put-other
nat-basic
/
f
store
/abstract-volumes/
in-neq
store
/abstract-volumes/
At-other