[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 in-vl-in-lebrefs
⊦ lref ∈ q0.lebrefs ↔ lref ∈ q0 ∧ lref ≠ none
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
eq-entry-in-lref-in
,
lebrefs-none-notin
,
subseteq-lebrefs-subseteq
,
Used by units in proved state:
ubi-refine
,
ubi-crash-recovery-base
,
ubi-abs
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 33
Used lemmas:
lebrefs-rec
,
lebrefs-base
,
queue-in-vl
,
Used spec theorems:
Used simplifier rules:
list
/erasequeue-base/
in-empty
list
/erasequeue-base/
in-rec
list
/erasequeue-base/
a
set-union
/lebrefset/
One
list
/erasequeue-base/
c
erasequeueentry
/
elim
set-basic
/lebrefset/
size-zero
set-basic
/lebrefset/
In-insert
set-basic
/lebrefset/
ne
set-union
/lebrefset/
unadd
nat-basic
/
c
nat-basic
/
a
nat-basic
/
oz
set-basic
/lebrefset/
Size-insert
set-basic
/lebrefset/
size-zero-01
set-basic
/lebrefset/
ne-01
set-union
/lebrefset/
une
set-union
/lebrefset/
unc
set-union
/lebrefset/
una
set-union
/lebrefset/
Union
set-basic
/lebrefset/
in-04
erasequeueentry
/
inj
set-basic
/lebrefset/
In-empty