[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 validrefs-subset-notnew
⊦ r ∈ refs0 ∧ validrefs(str, refs0 + r1, ty, st0) ∧ validrefnotnull(str, r, st[r -- _type] .type, st) ∧ st ⊆ st0 → ¬ newref(r1, st)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
validref-nopath-superset
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 1
Used lemmas:
validref-refs-last-valid-subset
,
Used spec theorems:
Used simplifier rules:
list
/references/
Last
junkrefs
/
validref-newref
junkrefs
/
validrefnotnull-validref