[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 absf-at
⊦ n < m ∧ m ≤ # ebatbl → absf(v, evol, apebs, ebatbl, q, m)[n] = (ebatbl[n] = unmapped ⊃ (v × n ∈ q.lebrefs ⊃ unmapped;erased) ;mapped(apebs[ebatbl[n].pnum].data, (evol[n].mapped? ⊃ evol[n].fill;apebs[ebatbl[n].pnum].fill)) )
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
Used by units in proved state:
ubi-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 11
Used lemmas:
absf-size
,
absf-rec
,
absf-base
,
Used spec theorems:
Used simplifier rules:
nat
/
fle
nat
/
lez
nat-basic
/
zero-01
nat-basic
/
s-04
lebref
/
disj
erasequeue
/
in-vl-in-lebrefs
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat
/
ler
array
/abstract-volume/
Put-same
nat
/
fle-01
nat
/
lels
nat
/
ls-le-simp
nat-basic
/
succ
nat-basic
/
lf
nat-basic
/
f
nat
/
lels-02
array
/abstract-volume/
Put-other
nat
/
lels-03