[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-mapped-abs
⊦ abs○(avols, apebs, vols, q, v, m) ∧ v ∈ vols ∧ m < # vols[v] ∧ avols[v][m] = mapped(buf, m0) ∧ vols[v][m] = ⌜n⌝ ∧ apebs[n].data = buf ∧ apebs[n].fill ≤ m0 → abs(avols, apebs, vols, q)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
ubi-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 7
Used lemmas:
abs-def
,
absexpt-def
,
Used spec theorems:
Used simplifier rules:
apeb
/
elim
apeb
/
sel-06
apeb
/
sel-07
nat-basic
/
lf-02
nat-basic
/
lf-01
ebaentry
/
sel
nat-basic
/
f
ebaentry
/
disj
leb
/
test-03
leb
/
sel
leb
/
sel-01
leb
/
disj
apeb
/
inj