[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 absexpt-pebs-write
⊦ v ∈ vols ∧ m < # vols[v] ∧ vols[v][m] = ⌜n⌝ ∧ valid-ebatbl(apebs, wlar, vols, n0) → (abs○(avols, apebs[n, apeb], vols, q, v, m) ↔ abs○(avols, apebs, vols, q, v, m))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss,
Comment:
Used by:
Used by units in proved state:
ubi-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 45
Used lemmas:
absexpt-def
,
Used spec theorems:
ubi-base
/
valid-ebatbl
Used simplifier rules:
apeb
/
elim
nat-basic
/
lf-01
leb
/
elim
leb
/
disj
leb
/
test-03
ebaentry
/
elim
ebaentry
/
disj
array
/apebs/
Put-other
apeb
/
inj
nat-basic
/
lf-02
array
/apebs/
cgetput
nat
/
le-ls-simp
nat
/
lels
avidheader
/
elim
nat-basic
/
f
wlentry
/
elim-02
wlentry
/
sel-04
apeb
/
sel-05
avidheader
/
test-03
avidheader
/
sel-06
avidheader
/
sel-08