[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-rec
⊦ (eqent ' + q).lebrefs = q.lebrefs ∪ (eqent.lebref ≠ none ⊃ {eqent.lebref} ;∅)
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
in-vl-in-lebrefs
,
lebrefs-append-lref
,
lebrefs-append-none
,
lebrefs-lref
,
lebrefs-none
,
subseteq-lebrefs-subseteq
,
Used by units in proved state:
ubi-asm
,
Proof exists?: No