[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-idset
⊦ abs(avols, apebs0, vols, q) ∧ v ∈ vols ∧ m < # vols[v] ∧ vols[v][m] = ⌜n⌝ ∧ id(apebs1, apebs0, mapped-pebs(vols) -- n) ∧ valid-ebatbl(apebs0, wlar, vols, n0) → abs○(avols, apebs1, 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: 32
Used lemmas:
absexpt-def
,
abs-def
,
Used spec theorems:
ubi-base
/
id-set
ubi-base
/
mapped-pebs-at
ubi-base
/
valid-ebatbl
Used simplifier rules:
apeb
/
elim
leb
/
elim
leb
/
disj
leb
/
test-03
ebaentry
/
elim
ebaentry
/
disj
set-union
/nat-set/
Delete
apeb
/
inj
nat-basic
/
lf-02
nat-basic
/
lf-01
avidheader
/
elim
nat-basic
/
f
wlentry
/
elim-02
wlentry
/
sel-04
apeb
/
sel-05
avidheader
/
test-03
avidheader
/
sel-06
avidheader
/
sel-08
nat
/
le-ls-simp
nat
/
lels
nat
/
fle-01
nat
/
fle
oelem
/nat-set/
irreflexivity