[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 validref-nopath-superset
⊦ validrefnotnull(str, r, st[r -- _type] .type, st) ∧ st ⊆ st0 ∧ newref(r1, st) → ¬ path∃(str, r, r1, st0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 14
Used lemmas:
validrefs-subset-notnew
,
validrefs-one
,
pathex-def
,
Used spec theorems:
addfuns
/
is_valid_ref-new
junkrefs
/
validrefnotnull-def
Used simplifier rules:
list
/references/
in-06
list
/references/
Last
list-last
/references/
butlast-last
list-last
/references/
l-02
junkrefs
/
validref-newref
addfuns
/
is_valid_ref-type
list-last
/references/
l
list
/references/
app
list
/references/
a
list
/references/
e-01
list
/references/
c
list-data
/references/
elim-list-c
junkrefs
/
validrefnotnull-notnull
storefuns
/
newref-01