[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 abs-lebrefs-subset-noterased-some
⊦ q1.lebrefs ⊆ q0.lebrefs ++ (v × m) ∧ abs(avols, apebs, vols, q0) ∧ v ∈ avols ∧ m < # avols[v] ∧ avols[v][m] ≠ erased → abs(avols, apebs, vols, q1)
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: 1
Proof steps: 15
Used lemmas:
abs-def
,
Used spec theorems:
set-union
/lebrefset/
subdef
Used simplifier rules:
apeb
/
elim
nat-basic
/
f
leb
/
test-02
apeb
/
sel-07
apeb
/
sel-06
nat-basic
/
lf-01
set-basic
/lebrefset/
In-insert
erasequeue
/
in-vl-in-lebrefs
lebref
/
disj
lebref
/
inj