[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 lebrefs-lref
⊦ eq-entry(n, v × m) '.lebrefs = ∅ ++ (v × m)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
lebrefs-append-lref
,
Used by units in proved state:
ubi-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 3
Used lemmas:
lebrefs-base
,
lebrefs-rec
,
Used spec theorems:
list
/erasequeue-base/
One
list
/erasequeue-base/
c
Used simplifier rules:
erasequeueentry
/
sel-01
lebref
/
disj
set-union
/lebrefset/
One
set-union
/lebrefset/
unadd
set-union
/lebrefset/
une
set-union
/lebrefset/
una
set-union
/lebrefset/
unc